Jerzy Tiuryn
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Jerzy Tiuryn has a total of 81 co-authors. Here are the top co-authors by number of shared publications:
- Paweł Górecki
Faculty of Mathematics, Informatics, and Mechanics, University of Warsaw , Warsaw 02-097
10 shared publications - Bartek Wilczynski
Faculty of Mathematics, Informatics and Mechanics, University of Warsaw, Warsaw, Poland
8 shared publications A.J. Kfoury
6 shared publications- Damian Wojtowicz
Faculty of Mathematics, Informatics and Mechanics, University of Warsaw, Warsaw, Poland
6 shared publications P. Urzyczyn
6 shared publications- Limsoon Wong
Department of Computer Science, School of Computing, National University of Singapore, 117417, Singapore
5 shared publications
Latest Publications
- Open Access
- 1 June 2024
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 47 (5) , 1-27
Phylogenetic network-assisted rooting of unrooted gene trees
Gene trees inferred from molecular sequence alignments are typically unrooted, and determining the most credible rooting edge is a classical problem in computational biology. One approach to solve this problem is unrooted reconciliation, where the rooting edge is postulated based on the split of the root from a given species tree. In this paper, we propose a novel variant of the gene tree rooting problem, where the gene tree root is inferred using a phylogenetic network of the species present in the gene tree. To obtain the best rooting, unrooted reconciliation can be applied, where the unrooted gene tree is jointly reconciled with a set of splits inferred from the network. However, the exponential size of the set induced by display trees of the network makes this approach computationally prohibitive. To address this, we propose a broader and easier-to-control set of splits based on the structural properties of the network. We then derive exact mathematical formulas for the rooting problem and propose two general rooting algorithms to handle cases where the input network does not meet the initial requirements. Our experimental study based on simulated gene trees and networks demonstrates that our algorithms infer gene tree rootings correctly or with a small error in most cases.
- 1 June 2024
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 47 (5) , 1-27
Open AccessPhylogenetic network-assisted rooting of unrooted gene trees
Gene trees inferred from molecular sequence alignments are typically unrooted, and determining the most credible rooting edge is a classical problem in computational biology. One approach to solve this problem is unrooted reconciliation, where the rooting edge is postulated based on the split of the root from a given species tree. In this paper, we propose a novel variant of the gene tree rooting problem, where the gene tree root is inferred using a phylogenetic network of the species present in the gene tree. To obtain the best rooting, unrooted reconciliation can be applied, where the unrooted gene tree is jointly reconciled with a set of splits inferred from the network. However, the exponential size of the set induced by display trees of the network makes this approach computationally prohibitive. To address this, we propose a broader and easier-to-control set of splits based on the structural properties of the network. We then derive exact mathematical formulas for the rooting problem and propose two general rooting algorithms to handle cases where the input network does not meet the initial requirements. Our experimental study based on simulated gene trees and networks demonstrates that our algorithms infer gene tree rootings correctly or with a small error in most cases.
- 1 January 2023
- Published by Springer Nature
- p. C1
Correction to: Rooting Gene Trees via Phylogenetic Networks
- 1 January 2023
- Published by Springer Nature
- p. C1
Correction to: Rooting Gene Trees via Phylogenetic Networks
- 1 January 2022
- Published by Springer Nature
- p. 419-431
Rooting Gene Trees via Phylogenetic Networks
Gene trees inferred from alignments of molecular sequences are usually unrooted. Since the root of a gene tree is often the desired property, one of the most classical problems in computational biology is gene tree rooting, where the goal is to infer the most credible rooting edge in an unrooted gene tree. One way to solve it is to apply unrooted reconciliation, where the rooting edge is postulated based on a given split of a rooted species tree. Here, we address a novel variant of the rooting problem, where the gene tree root is inferred using a given phylogenetic network of the species present in the gene tree. One can apply unrooted reconciliation to obtain the best rooting, where the unrooted gene tree is jointly reconciled with a set of splits inferred from the given network. Natural candidates are splits induced by display trees of the network. However, such an approach is computationally prohibiting due to the exponential size of the set. Therefore, we propose a broader and easier-to-control set of splits based on the structural properties of the network. Next, we derive exact mathematical formulas for the rooting problem with the algorithm that runs in square time and space. We verify the algorithm’s quality based on simulated gene trees and networks.
- 1 January 2022
- Published by Springer Nature
- p. 419-431
Rooting Gene Trees via Phylogenetic Networks
Gene trees inferred from alignments of molecular sequences are usually unrooted. Since the root of a gene tree is often the desired property, one of the most classical problems in computational biology is gene tree rooting, where the goal is to infer the most credible rooting edge in an unrooted gene tree. One way to solve it is to apply unrooted reconciliation, where the rooting edge is postulated based on a given split of a rooted species tree. Here, we address a novel variant of the rooting problem, where the gene tree root is inferred using a given phylogenetic network of the species present in the gene tree. One can apply unrooted reconciliation to obtain the best rooting, where the unrooted gene tree is jointly reconciled with a set of splits inferred from the given network. Natural candidates are splits induced by display trees of the network. However, such an approach is computationally prohibiting due to the exponential size of the set. Therefore, we propose a broader and easier-to-control set of splits based on the structural properties of the network. Next, we derive exact mathematical formulas for the rooting problem with the algorithm that runs in square time and space. We verify the algorithm’s quality based on simulated gene trees and networks.
- Open Access
- 1 December 2020
- Published by Elsevier in Computational Biology and Chemistry
- Vol. 89, 107260
Minimizing genomic duplication episodes
- 1 December 2020
- Published by Elsevier in Computational Biology and Chemistry
- Vol. 89, 107260
Open AccessMinimizing genomic duplication episodes
- 28 May 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Computational Biology and Bioinformatics
- Vol. 18 (6) , 2125-2135
The Unconstrained Diameters of the Duplication-Loss Cost and the Loss Cost
Tree reconciliation costs are a popular choice to account for the discordance between the evolutionary history of a gene family (i.e., a gene tree), and the species tree through which this family has evolved. This discordance is accounted for by the minimum number of postulated evolutionary events necessary for reconciling the two trees. Such events include gene duplication, loss, and deep coalescence, and are used to define different types of tree reconciliation costs. For example, the duplication-loss cost for a gene tree and species tree accounts for the minimum number of gene duplications and losses necessary to reconcile these trees. Fundamental to the understanding of how gene trees and species trees relate to each other are the diameters of tree reconciliation costs. While such diameters have been well-researched, still absent from these studies are the unconstrained diameters for two of the classic tree reconciliation costs, namely the duplication-loss cost and the loss cost. Here, we show the essential mathematical properties of these diameters and provide efficient solutions for computing them. Finally, we analyze the distributions of these diameters using simulated datasets.
- 28 May 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Computational Biology and Bioinformatics
- Vol. 18 (6) , 2125-2135
The Unconstrained Diameters of the Duplication-Loss Cost and the Loss Cost
Tree reconciliation costs are a popular choice to account for the discordance between the evolutionary history of a gene family (i.e., a gene tree), and the species tree through which this family has evolved. This discordance is accounted for by the minimum number of postulated evolutionary events necessary for reconciling the two trees. Such events include gene duplication, loss, and deep coalescence, and are used to define different types of tree reconciliation costs. For example, the duplication-loss cost for a gene tree and species tree accounts for the minimum number of gene duplications and losses necessary to reconcile these trees. Fundamental to the understanding of how gene trees and species trees relate to each other are the diameters of tree reconciliation costs. While such diameters have been well-researched, still absent from these studies are the unconstrained diameters for two of the classic tree reconciliation costs, namely the duplication-loss cost and the loss cost. Here, we show the essential mathematical properties of these diameters and provide efficient solutions for computing them. Finally, we analyze the distributions of these diameters using simulated datasets.
- 1 March 2017
- Published by SAGE Publications in Journal of Computational Biology
- Vol. 24 (3) , 193-199
FastBill: An Improved Tool for Prediction of Cis-Regulatory Modules
Here, we provide a new software tool, called FastBill, for prediction of evolutionarily conserved cis-regulatory modules. It improves on the previous version of our program, called Billboard, by improving the statistical significance calculation. It is also faster than the original Billboard, allowing for large-scale analyses, including multiple informant species. We illustrate the utility of FastBill by performing a large-scale computational experiment of enhancer prediction in the promoter area of more than 150 Drosophila melanogaster genes that possess annotated experimentally verified enhancers. FastBill is written in Python and is freely available for download as a standalone tool.
- 1 March 2017
- Published by SAGE Publications in Journal of Computational Biology
- Vol. 24 (3) , 193-199
FastBill: An Improved Tool for Prediction of Cis-Regulatory Modules
Here, we provide a new software tool, called FastBill, for prediction of evolutionarily conserved cis-regulatory modules. It improves on the previous version of our program, called Billboard, by improving the statistical significance calculation. It is also faster than the original Billboard, allowing for large-scale analyses, including multiple informant species. We illustrate the utility of FastBill by performing a large-scale computational experiment of enhancer prediction in the promoter area of more than 150 Drosophila melanogaster genes that possess annotated experimentally verified enhancers. FastBill is written in Python and is freely available for download as a standalone tool.
- Open Access
- 4 December 2015
- Published by Springer Nature in BMC Neuroscience
- Vol. 16 (S1) , P261
Analysis of replacing DNase-seq data with histone marks in computational dimer prediction
- 4 December 2015
- Published by Springer Nature in BMC Neuroscience
- Vol. 16 (S1) , P261
Open AccessAnalysis of replacing DNase-seq data with histone marks in computational dimer prediction
- Open Access
- 1 December 2015
- Published by Springer Nature in BMC Systems Biology
- Vol. 10 (1) , 1-13
Enhanceosome transcription factors preferentially dimerize with high mobility group proteins
The enhanceosome is an enhancer located upstream of the human interferon β gene, bound by transcription factor (TF) complex of extremely rigid structure. Within these rigid constraints, even a slight change of distances between transcription factor binding sites (TFBS) results in loss of functionality of the enhanceosome. We hypothesized that smaller subunits of the enhanceosome may entail TF complex formation in other regulatory regions. In order to verify this hypothesis we systematically searched for dimerization preferences of the TFs that have TFBS in the enhanceosome. For this we utilized our recently developed tool, TACO. We performed this computational experiment in a cell-type–specific manner by utilizing cell-type–specific DNase-seq data for 105 human cell types. We also used 20 TRANSFAC motifs comprising not only the usual TFs constituting the enhanceosome but also the architectural proteins of High Mobility Group I(Y) (HMG I). A similar experiment used 42 DNase-seq data sets for mouse cell types. We found 137 statistically significant dimer predictions in the human genome, and 37 predictions in the mouse genome, that matched the positioning on the enhanceosome with ±2 bp tolerance. To characterize these predicted TF dimers, we performed functional analysis (Gene Ontology enrichment) for sets of genes which were in the neighbourhood of predicted dimer instances. A notable feature of these instances is that (1) most of them are located in introns of genes, (2) they are enriched in regulatory states, and (3) those instances that are located near transcription start sites are enriched for inclusion in computationally predicted enhancers. We also investigated similarity of dimer predictions between human and mouse. It follows from our experiments that, except for homodimer formed by IRF proteins, the rest of the dimers were formed exclusively between one of the transcriptional activators (ATF-2/c-Jun and IRF) and a HMG I protein. NF- κB did not participate in forming dimers with other proteins. Dimers predicted in mouse were fully contained in those predicted in human, with exactly the same spacing and orientation. Intriguingly, in most of the cases the enhanceosome motifs have 1 bp wider spacing than the corresponding dimers predicted genome-wide, which is likely caused by the overall 3D structure constraints of the enhanceosome-bound complex.
- 1 December 2015
- Published by Springer Nature in BMC Systems Biology
- Vol. 10 (1) , 1-13
Open AccessEnhanceosome transcription factors preferentially dimerize with high mobility group proteins
The enhanceosome is an enhancer located upstream of the human interferon β gene, bound by transcription factor (TF) complex of extremely rigid structure. Within these rigid constraints, even a slight change of distances between transcription factor binding sites (TFBS) results in loss of functionality of the enhanceosome. We hypothesized that smaller subunits of the enhanceosome may entail TF complex formation in other regulatory regions. In order to verify this hypothesis we systematically searched for dimerization preferences of the TFs that have TFBS in the enhanceosome. For this we utilized our recently developed tool, TACO. We performed this computational experiment in a cell-type–specific manner by utilizing cell-type–specific DNase-seq data for 105 human cell types. We also used 20 TRANSFAC motifs comprising not only the usual TFs constituting the enhanceosome but also the architectural proteins of High Mobility Group I(Y) (HMG I). A similar experiment used 42 DNase-seq data sets for mouse cell types. We found 137 statistically significant dimer predictions in the human genome, and 37 predictions in the mouse genome, that matched the positioning on the enhanceosome with ±2 bp tolerance. To characterize these predicted TF dimers, we performed functional analysis (Gene Ontology enrichment) for sets of genes which were in the neighbourhood of predicted dimer instances. A notable feature of these instances is that (1) most of them are located in introns of genes, (2) they are enriched in regulatory states, and (3) those instances that are located near transcription start sites are enriched for inclusion in computationally predicted enhancers. We also investigated similarity of dimer predictions between human and mouse. It follows from our experiments that, except for homodimer formed by IRF proteins, the rest of the dimers were formed exclusively between one of the transcriptional activators (ATF-2/c-Jun and IRF) and a HMG I protein. NF- κB did not participate in forming dimers with other proteins. Dimers predicted in mouse were fully contained in those predicted in human, with exactly the same spacing and orientation. Intriguingly, in most of the cases the enhanceosome motifs have 1 bp wider spacing than the corresponding dimers predicted genome-wide, which is likely caused by the overall 3D structure constraints of the enhanceosome-bound complex.
- Open Access
- 19 March 2014
- Published by Springer Nature in BMC Genomics
- Vol. 15 (1) , 208
TACO: a general-purpose tool for predicting cell-type–specific transcription factor dimers
Cooperative binding of transcription factor (TF) dimers to DNA is increasingly recognized as a major contributor to binding specificity. However, it is likely that the set of known TF dimers is highly incomplete, given that they were discovered using ad hoc approaches, or through computational analyses of limited datasets.
- 19 March 2014
- Published by Springer Nature in BMC Genomics
- Vol. 15 (1) , 208
Open AccessTACO: a general-purpose tool for predicting cell-type–specific transcription factor dimers
Cooperative binding of transcription factor (TF) dimers to DNA is increasingly recognized as a major contributor to binding specificity. However, it is likely that the set of known TF dimers is highly incomplete, given that they were discovered using ad hoc approaches, or through computational analyses of limited datasets.
- Open Access
- 5 March 2014
- Published by Springer Nature in BMC Bioinformatics
- Vol. 15 (1) , 65
eCAMBer: efficient support for large-scale comparative analysis of multiple bacterial strains
Inconsistencies are often observed in the genome annotations of bacterial strains. Moreover, these inconsistencies are often not reflected by sequence discrepancies, but are caused by wrongly annotated gene starts as well as mis-identified gene presence. Thus, tools are needed for improving annotation consistency and accuracy among sets of bacterial strain genomes.
- 5 March 2014
- Published by Springer Nature in BMC Bioinformatics
- Vol. 15 (1) , 65
Open AccesseCAMBer: efficient support for large-scale comparative analysis of multiple bacterial strains
Inconsistencies are often observed in the genome annotations of bacterial strains. Moreover, these inconsistencies are often not reflected by sequence discrepancies, but are caused by wrongly annotated gene starts as well as mis-identified gene presence. Thus, tools are needed for improving annotation consistency and accuracy among sets of bacterial strain genomes.