Jerzy Tiuryn

Jerzy Tiuryn

Auto-generated profile, based on publicly available information

Jerzy Tiuryn

Institute of Informatics, University of Warsaw, Warsaw, Poland

Research Focus & Metrics

Academic Career Length

49Years (1978-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
8 May 2006 in BMC Bioinformatics
Verified
Journal Article
Open access
PDF file
NDNorbert Dojer
Norbert Dojer
AGAnna Gambin
Anna Gambin
AMAndrzej Mizera
Andrzej Mizera
BWBartek Wilczynski
Bartek Wilczynski
JTJerzy Tiuryn
Jerzy Tiuryn
Background: A central goal of molecular biology is to understand the regulatory mechanisms of gene transcription and protein synthesis. Because of their solid basis in statistics, allowing to deal with the stochastic aspects of gene expressions and noisy measurements in a natural way, Bayesian networks appear attractive in the field of inferring gene interactions structure from microarray experiments data. However, the basic formalism has some disadvantages, e.g. it is sometimes hard to distinguish between the origin and the target of an interaction. Two kinds of microarray experiments yield data particularly rich in information regarding the direction of interactions: time series and perturbation experiments. In order to correctly handle them, the basic formalism must be modified. For example, dynamic Bayesian networks (DBN) apply to time series microarray data. To our knowledge the DBN technique has not been applied in the context of perturbation experiments. Results: We extend the framework of dynamic Bayesian networks in order to incorporate perturbations. Moreover, an exact algorithm for inferring an optimal network is proposed and a discretization method specialized for time series data from perturbation experiments is introduced. We apply our procedure to realistic simulations data. The results are compared with those obtained by standard DBN learning techniques. Moreover, the advantages of using exact learning algorithm instead of heuristic methods are analyzed. Conclusion: We show that the quality of inferred networks dramatically improves when using data from perturbation experiments. We also conclude that the exact algorithm should be used when it is possible, i.e. when considered set of genes is small enough.

1 August 2006 in Theoretical Computer Science
Verified
Journal Article
Closed access
PGPawel Gorecki
Pawel Gorecki
JTJerzy Tiuryn
Jerzy Tiuryn

1 July 2007 in Bioinformatics
Verified
Journal Article
Open access
PDF file
JDJanusz Dutkowski
Janusz Dutkowski
JTJerzy Tiuryn
Jerzy Tiuryn
Motivation: The increasing availability of large-scale protein–protein interaction (PPI) data has fuelled the efforts to elucidate the building blocks and organization of cellular machinery. Previous studies have shown cross-species comparison to be an effective approach in uncovering functional modules in protein networks. This has in turn driven the research for new network alignment methods with a more solid grounding in network evolution models and better scalability, to allow multiple network comparison. Results: We develop a new framework for protein network alignment, based on reconstruction of an ancestral PPI network. The reconstruction algorithm is built upon a proposed model of protein network evolution, which takes into account phylogenetic history of the proteins and the evolution of their interactions. The application of our methodology to the PPI networks of yeast, worm and fly reveals that the most probable conserved ancestral interactions are often related to known protein complexes. By projecting the conserved ancestral interactions back onto the input networks we are able to identify the corresponding conserved protein modules in the considered species. In contrast to most of the previous methods, our algorithm is able to compare many networks simultaneously. The performed experiments demonstrate the ability of our method to uncover many functional modules with high specificity. Availability: Information for obtaining software and supplementary results are available at http://bioputer.mimuw.edu.pl/papers/cappi. Contact:januszd@mimuw.edu.pl

1 April 1993 in ACM Transactions on Programming Languages and Systems
Verified
Journal Article
Open access
PDF file
AKA. J. Kfoury
A. J. Kfoury
JTJ. Tiuryn
J. Tiuryn
PUP. Urzyczyn
P. Urzyczyn

1 January 1993 in Information and Computation
Verified
Journal Article
Closed access
AKA.J. Kfoury
A.J. Kfoury
JTJ. Tiuryn
J. Tiuryn
PUP. Urzyczyn
P. Urzyczyn

1 June 2005 in Genome Research
Verified
Journal Article
Open access
PDF file
THTorgeir R. Hvidsten
Torgeir R. Hvidsten
BWBartek Wilczynski
Bartek Wilczynski
AKAndriy Kryshtafovych
Andriy Kryshtafovych
JTJerzy Tiuryn
Jerzy Tiuryn
JKJan Komorowski
Jan Komorowski
KFKrzysztof Fidelis
Krzysztof Fidelis
Transcription factors regulate expression by binding selectively to sequence sites incis-regulatory regions of genes. It is therefore reasonable to assume that genes regulated by the same transcription factors should all contain the corresponding binding sites in their regulatory regions and exhibit similar expression profiles as measured by, for example, microarray technology. We have used this assumption to analyze genome-wide yeast binding-site and microarray expression data to reveal the combinatorial nature of gene regulation. We obtained IF-THEN rules linking binding-site combinations (binding-site modules) to genes with particular expression profiles, and thereby provided testable hypotheses on the combinatorial coregulation of gene expression. We showed that genes associated with such rules have a significantly higher probability of being bound by the same transcription factors, as indicated by a genome-wide location analysis, than genes associated with only common binding sites or similar expression. Furthermore, we also found that such genes were significantly more often biologically related in terms of Gene Ontology annotations than genes only associated with common binding sites or similar expression. We analyzed expression data collected under different sets of stress conditions and found many binding-site modules that are conserved over several of these condition sets, as well as modules that are specific to particular biological responses. Our results on the reoccurrence of binding sites in different modules provide specific data on how binding sites may be combined to allow a large number of expression outcomes using relatively few transcription factors.