| The Paleozoic origin of enzymatic lignin decomposition reconstructed from 31 fungal genomes D Floudas, M Binder, R Riley, K Barry, RA Blanchette, B Henrissat, ... Science 336 (6089), 1715-1719, 2012 | 891 | 2012 |
| DLS-trees: a model of evolutionary scenarios P Gorecki, J Tiuryn Theoretical Computer Science 359 (1-3), 378-399, 2006 | 103 | 2006 |
| Reconciliation problems for duplication, loss and horizontal gene transfer P Górecki RECOMB 2004, 316-325, 2004 | 46 | 2004 |
| Inferring phylogeny from whole genomes P Górecki, J Tiuryn Bioinformatics 23 (2), e116-e122, 2007 | 37 | 2007 |
| Maximum likelihood models and algorithms for gene tree evolution with duplications and losses P Górecki, GJ Burleigh, O Eulenstein BMC bioinformatics 12 (1), S15, 2011 | 34 | 2011 |
| Unrooted Tree Reconciliation: A Unified Approach P Górecki, O Eulenstein, J Tiuryn IEEE/ACM Transactions on Computational Biology and Bioinformatics 10 (2 …, 2013 | 28 | 2013 |
| A linear time algorithm for error-corrected reconciliation of unrooted gene trees P Górecki, O Eulenstein International Symposium on Bioinformatics Research and Applications, 148-159, 2011 | 27 | 2011 |
| Algorithms: simultaneous error-correction and rooting for gene tree reconciliation and the gene duplication problem P Górecki, O Eulenstein BMC bioinformatics 13 (10), S14, 2012 | 26 | 2012 |
| URec: a system for unrooted reconciliation P Górecki, J Tiuryn Bioinformatics 23 (4), 511-512, 2006 | 26 | 2006 |
| Exact Solutions for Species Tree Inference from Discordant Gene Trees WC Chang, P Górecki, O Eulenstein Journal of Bioinformatics and Computational Biology 11 (5), 1342005, 2013 | 20 | 2013 |
| On the structure of reconciliations P Górecki, J Tiuryn Lecture Notes in Computer Science, RECOMB-CG 2004 3388 (Springer, Berlin …, 2005 | 18 | 2005 |
| GTP Supertrees from Unrooted Gene Trees: Linear Time Algorithms for NNI Based Local Searches P Górecki, J Burleigh, O Eulenstein Lecture Notes in Computer Science, 102-114, 2012 | 16 | 2012 |
| Deep coalescence reconciliation with unrooted gene trees: Linear time algorithms P Górecki, O Eulenstein International Computing and Combinatorics Conference, 531-542, 2012 | 11 | 2012 |
| A Robinson-Foulds Measure to Compare Unrooted Trees with Rooted Trees P Górecki, O Eulenstein Lecture Notes in Computer Science, 115-126, 2012 | 11 | 2012 |
| Maximizing Deep Coalescence Cost P Gorecki, O Eulenstein IEEE/ACM Transactions on Computational Biology and Bioinformatics 11 (1 …, 2014 | 10 | 2014 |
| Gene Tree Diameter for Deep Coalescence P Górecki, O Eulenstein IEEE/ACM Transactions on Computational Biology and Bioinformatics 1, 155 - 165, 2015 | 9 | 2015 |
| Duplication cost diameters P Górecki, J Paszek, O Eulenstein International Symposium on Bioinformatics Research and Applications, 212-223, 2014 | 7 | 2014 |
| DrML: probabilistic modeling of gene duplications P Górecki, O Eulenstein Journal of Computational Biology 21 (1), 89-98, 2014 | 7 | 2014 |
| Genomic duplication problems for unrooted gene trees J Paszek, P Górecki BMC genomics 17 (1), 15, 2016 | 6 | 2016 |
| Fast Algorithms for Inferring Gene-Species Associations A Betkier, P Szczęsny, P Górecki Bioinformatics Research and Applications 9096, 36-47, 2015 | 6 | 2015 |
Oliver EulensteinProfessor of Computer Science, Iowa State UniversityZweryfikowany adres z cs.iastate.edu