| Approximating the true evolutionary distance between two genomes KM Swenson, M Marron, JV Earnest-DeYoung, BME Moret Journal of Experimental Algorithmics (JEA) 12, 1-17, 2008 | 103 | 2008 |
| Genomic distances under deletions and insertions M Marron, KM Swenson, BME Moret Theoretical Computer Science 325 (3), 347-360, 2004 | 72 | 2004 |
| An optimal reconciliation algorithm for gene trees with polytomies M Lafond, KM Swenson, N El-Mabrouk International Workshop on Algorithms in Bioinformatics, 106-122, 2012 | 52 | 2012 |
| Uncovering hidden phylogenetic consensus in large data sets N Pattengale, A Aberer, K Swenson, A Stamatakis, B Moret IEEE/ACM transactions on computational biology and bioinformatics 8 (4), 902-911, 2011 | 50 | 2011 |
| Sorting signed permutations by inversions in O (n log n) time KM Swenson, V Rajan, Y Lin, BME Moret Journal of Computational Biology 17 (3), 489-501, 2010 | 48 | 2010 |
| Rapid alignment-free phylogenetic identification of metagenomic sequences B Linard, KM Swenson, F Pardi Bioinformatics 35 (18), 3303-3312, 2019 | 46 | 2019 |
| Genomic distances under deletions and insertions M Marron, KM Swenson, BME Moret Computing and Combinatorics: 9th Annual International Conference, COCOON …, 2003 | 40 | 2003 |
| OMG! Orthologs in multiple genomes–competing graph-theoretical formulations C Zheng, K Swenson, E Lyons, D Sankoff International Workshop on Algorithms in Bioinformatics, 364-375, 2011 | 38 | 2011 |
| Ancestral Genome Organization: An Alignment Approach P Holloway, K Swenson, D Ardell, N El-Mabrouk Journal of Computational Biology 20 (4), 280-295, 2013 | 37* | 2013 |
| Gene trees and species trees: irreconcilable differences KM Swenson, N El-Mabrouk BMC bioinformatics 13 (19), S15, 2012 | 33 | 2012 |
| Gene tree correction guided by orthology M Lafond, M Semeria, KM Swenson, E Tannier, N El-Mabrouk BMC bioinformatics 14 (15), 1-9, 2013 | 31 | 2013 |
| Heuristics for the inversion median problem V Rajan, AW Xu, Y Lin, KM Swenson, BME Moret BMC bioinformatics 11 (1), S30, 2010 | 28 | 2010 |
| Gene tree correction for reconciliation and species tree inference: complexity and algorithms R Dondi, N El-Mabrouk, KM Swenson Journal of Discrete Algorithms 25, 51-65, 2014 | 24 | 2014 |
| Estimating true evolutionary distances under rearrangements, duplications, and losses Y Lin, V Rajan, KM Swenson, BME Moret BMC bioinformatics 11 (1), 1-11, 2010 | 24 | 2010 |
| Hurdles hardly have to be heeded KM Swenson, Y Lin, V Rajan, BME Moret Comparative Genomics: International Workshop, RECOMB-CG 2008, Paris, France …, 2008 | 24 | 2008 |
| Models and algorithms for genome rearrangement with positional constraints KM Swenson, P Simonaitis, M Blanchette Algorithms for Molecular Biology 11 (1), 13, 2016 | 23 | 2016 |
| Gene tree correction for reconciliation and species tree inference KM Swenson, A Doroftei, N El-Mabrouk Algorithms for Molecular Biology 7, 1-11, 2012 | 23 | 2012 |
| Uncovering hidden phylogenetic consensus ND Pattengale, KM Swenson, BME Moret International Symposium on Bioinformatics Research and Applications, 128-139, 2010 | 22 | 2010 |
| Diversity of bacteriophages encoding Panton-Valentine leukocidin in temporally and geographically related Staphylococcus aureus GW Coombs, SL Baines, BP Howden, KM Swenson, FG O’Brien PloS one 15 (2), e0228676, 2020 | 21 | 2020 |
| A framework for orthology assignment from gene rearrangement data KM Swenson, ND Pattengale, BME Moret RECOMB Workshop on Comparative Genomics, 153-166, 2005 | 20 | 2005 |
Bernard M.E. MoretISCB Fellow, Professor emeritus, Computer & Communication Sciences, EPFL在 epfl.ch 的电子邮件经过验证
