Reconciliation problems for duplication, loss and horizontal gene transfer. - Pawel Górecki 001 (RECOMB, 2004)

On the Structure of Reconciliations. - Pawel Górecki 001; Jerzy Tiuryn (Comparative Genomics, 2004)

DLS-trees: A model of evolutionary scenarios. - Pawel Górecki 001; Jerzy Tiuryn (Theor. Comput. Sci., 2006)

Inferring phylogeny from whole genomes. - Pawel Górecki 001; Jerzy Tiuryn (Bioinform., 2007)

URec: a system for unrooted reconciliation. - Pawel Górecki 001; Jerzy Tiuryn (Bioinform., 2007)

H-trees: a Model of Evolutionary Scenarios with Horizontal Gene Transfer. - Pawel Górecki 001 (Fundam. Informaticae, 2010)

A Linear Time Algorithm for Error-Corrected Reconciliation of Unrooted Gene Trees. - Pawel Górecki 001; Oliver Eulenstein (ISBRA, 2011)

Maximum likelihood models and algorithms for gene tree evolution with duplications and losses. - Pawel Górecki 001; J. Gordon Burleigh; Oliver Eulenstein (BMC Bioinform., 2011)

Inferring Evolutionary Scenarios in the Duplication, Loss and Horizontal Gene Transfer Model. - Pawel Górecki 001; Jerzy Tiuryn (Logic and Program Semantics, 2012)

Deep Coalescence Reconciliation with Unrooted Gene Trees: Linear Time Algorithms. - Pawel Górecki 001; Oliver Eulenstein (COCOON, 2012)

GTP Supertrees from Unrooted Gene Trees: Linear Time Algorithms for NNI Based Local Searches. - Pawel Górecki 001; J. Gordon Burleigh; Oliver Eulenstein (ISBRA, 2012)

A Robinson-Foulds Measure to Compare Unrooted Trees with Rooted Trees. - Pawel Górecki 001; Oliver Eulenstein (ISBRA, 2012)

Algorithms: simultaneous error-correction and rooting for gene tree reconciliation and the gene duplication problem. - Pawel Górecki 001; Oliver Eulenstein (BMC Bioinform., 2012)

Exact solutions for species Tree Inference from discordant gene Trees. - Wen-Chieh Chang 002; Pawel Górecki 001; Oliver Eulenstein (J. Bioinform. Comput. Biol., 2013)

Unrooted Tree Reconciliation: A Unified Approach. - Pawel Górecki 001; Oliver Eulenstein; Jerzy Tiuryn (IEEE ACM Trans. Comput. Biol. Bioinform., 2013)

Unconstrained gene tree diameters for deep coalescence. - Pawel Górecki 001; Jaroslaw Paszek; Oliver Eulenstein (BCB, 2014)

Duplication Cost Diameters. - Pawel Górecki 001; Jaroslaw Paszek; Oliver Eulenstein (ISBRA, 2014)

Refining discordant gene trees. - Pawel Górecki 001; Oliver Eulenstein (BMC Bioinform., 2014)

DrML: Probabilistic Modeling of Gene Duplications. - Pawel Górecki 001; Oliver Eulenstein (J. Comput. Biol., 2014)

Maximizing Deep Coalescence Cost. - Pawel Górecki 001; Oliver Eulenstein (IEEE ACM Trans. Comput. Biol. Bioinform., 2014)

Fast Algorithms for Inferring Gene-Species Associations. - Arkadiusz Betkier; Pawel Szczesny; Pawel Górecki 001 (ISBRA, 2015)

Gene Tree Diameter for Deep Coalescence. - Pawel Górecki 001; Oliver Eulenstein (IEEE ACM Trans. Comput. Biol. Bioinform., 2015)

Bootstrapping Algorithms for Gene Duplication and Speciation Events. - Agnieszka Mykowiecka 002; Pawel Górecki 001 (AlCoB, 2016)

Mean Values of Gene Duplication and Loss Cost Functions. - Pawel Górecki 001; Jaroslaw Paszek; Agnieszka Mykowiecka 002 (ISBRA, 2016)

Genomic duplication problems for unrooted gene trees. - Jaroslaw Paszek; Pawel Górecki 001 (BMC Genom., 2016)

Phylogenetic Tree Reconciliation: Mean Values for Fixed Gene Trees. - Pawel Górecki 001; Alexey Markin; Agnieszka Mykowiecka 002; Jaroslaw Paszek; Oliver Eulenstein (ISBRA, 2017)

New Algorithms for the Genomic Duplication Problem. - Jaroslaw Paszek; Pawel Górecki 001 (RECOMB-CG, 2017)

Detecting Locus Acquisition Events in Gene Trees. - Michal Aleksander Ciach; Anna Muszewska; Pawel Górecki 001 (WABI, 2017)

Unconstrained Diameters for Deep Coalescence. - Pawel Górecki 001; Jaroslaw Paszek; Oliver Eulenstein (IEEE ACM Trans. Comput. Biol. Bioinform., 2017)

Phylogenetic Consensus for Exact Median Trees. - Pawel Tabaszewski; Pawel Górecki 001; Oliver Eulenstein (BCB, 2018)

Inferring time-consistent and well-supported horizontal gene transfers. - Agnieszka Mykowiecka 002; Anna Muszewska; Pawel Górecki 001 (BIBM, 2018)

Cophenetic Distances: A Near-Linear Time Algorithmic Framework. - Pawel Górecki 001; Alexey Markin; Oliver Eulenstein (COCOON, 2018)

Locus-aware decomposition of gene trees with respect to polytomous species trees. - Michal Aleksander Ciach; Anna Muszewska; Pawel Górecki 001 (Algorithms Mol. Biol., 2018)

Minimizing the deep coalescence cost. - Dawid Dabkowski; Pawel Tabaszewski; Pawel Górecki 001 (J. Bioinform. Comput. Biol., 2018)

Bijective Diameters of Gene Tree Parsimony Costs. - Pawel Górecki 001; Oliver Eulenstein (IEEE ACM Trans. Comput. Biol. Bioinform., 2018)

Inferring Gene-Species Assignments in the Presence of Horizontal Gene Transfer. - Agnieszka Mykowiecka 002; Pawel Szczesny; Pawel Górecki 001 (IEEE ACM Trans. Comput. Biol. Bioinform., 2018)

Efficient Algorithms for Genomic Duplication Models. - Jaroslaw Paszek; Pawel Górecki 001 (IEEE ACM Trans. Comput. Biol. Bioinform., 2018)

Feasibility Algorithms for the Duplication-Loss Cost. - Pawel Górecki 001; Alexey Markin; Oliver Eulenstein (COCOON, 2019)

Mathematical properties of the gene duplication cost. - Pawel Górecki 001; Agnieszka Mykowiecka 002; Jaroslaw Paszek; Oliver Eulenstein (Discret. Appl. Math., 2019)

Credibility of Evolutionary Events in Gene Trees. - Agnieszka Mykowiecka 002; Pawel Górecki 001 (IEEE ACM Trans. Comput. Biol. Bioinform., 2019)

Integer Linear Programming Formulation for the Unified Duplication-Loss-Coalescence Model. - Javad Ansarifar; Alexey Markin; Pawel Górecki 001; Oliver Eulenstein (ISBRA, 2020)

Minimizing genomic duplication episodes. - Jaroslaw Paszek; Jerzy Tiuryn; Pawel Górecki 001 (Comput. Biol. Chem., 2020)

Novel genomic duplication models through integer linear programming. - Jaroslaw Paszek; Oliver Eulenstein; Pawel Górecki 001 (BCB, 2021)

Conflict Resolution Algorithms for Deep Coalescence Phylogenetic Networks. - Marcin Wawerka; Dawid Dabkowski; Natalia Rutecka; Agnieszka Mykowiecka 002; Pawel Górecki 001 (WABI, 2021)

Taming the Duplication-Loss-Coalescence Model with Integer Linear Programming. - Jaroslaw Paszek; Alexey Markin; Pawel Górecki 001; Oliver Eulenstein (J. Comput. Biol., 2021)

The Unconstrained Diameters of the Duplication-Loss Cost and the Loss Cost. - Pawel Górecki 001; Oliver Eulenstein; Jerzy Tiuryn (IEEE ACM Trans. Comput. Biol. Bioinform., 2021)

Consensus of All Solutions for Intractable Phylogenetic Tree Inference. - Pawel Tabaszewski; Pawel Górecki 001; Alexey Markin; Tavis K. Anderson; Oliver Eulenstein (IEEE ACM Trans. Comput. Biol. Bioinform., 2021)

Rooting Gene Trees via Phylogenetic Networks. - Jerzy Tiuryn; Natalia Rutecka; Pawel Górecki 001 (COCOON, 2022)

Scalable and Extensible Robinson-Foulds for Comparative Phylogenetics. - Alvin Chon; Pawel Górecki 001; Oliver Eulenstein; Xiaoqiu Huang 001; Ali Jannesari (IPDPS Workshops, 2022)

Embedding gene trees into phylogenetic networks by conflict resolution algorithms. - Marcin Wawerka; Dawid Dabkowski; Natalia Rutecka; Agnieszka Mykowiecka 002; Pawel Górecki 001 (Algorithms Mol. Biol., 2022)

The Asymmetric Cluster Affinity Cost. - Sanket Wagle; Alexey Markin; Pawel Górecki 001; Tavis K. Anderson; Oliver Eulenstein (RECOMB-CG, 2023)

Simultaneous Reconstruction of Duplication Episodes and Gene-Species Mappings. - Pawel Górecki 001; Natalia Rutecka; Agnieszka Mykowiecka 002; Jaroslaw Paszek (WABI, 2023)

Robinson-Foulds distance between phylogenetic networks and gene trees. - Natalia Rutecka; Agnieszka Mykowiecka 002; Jaroslaw Paszek; Pawel Górecki 001 (BCB, 2024)

Asymmetric Cluster-Based Measures for Comparative Phylogenetics. - Sanket Wagle; Alexey Markin; Pawel Górecki 001; Tavis K. Anderson; Oliver Eulenstein (J. Comput. Biol., 2024)

Phylogenetic network-assisted rooting of unrooted gene trees. - Jerzy Tiuryn; Natalia Rutecka; Pawel Górecki 001 (J. Comb. Optim., 2024)

Unifying duplication episode clustering and gene-species mapping inference. - Pawel Górecki 001; Natalia Rutecka; Agnieszka Mykowiecka 002; Jaroslaw Paszek (Algorithms Mol. Biol., 2024)