Author of the publication

Linear-Time Algorithms for Some Phylogenetic Tree Completion Problems Under Robinson-Foulds Distance.

. RECOMB-CG, volume 11183 of Lecture Notes in Computer Science, page 209-226. Springer, (2018)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

On the Complexity of Duplication-Transfer-Loss Reconciliation with Non-binary Gene Trees., and . ISBRA, volume 9096 of Lecture Notes in Computer Science, page 187-198. Springer, (2015)Integrative analysis of 111 reference human epigenomes Open., , , , , , , , , and 86 other author(s). Nat., 518 (7539): 317-330 (2015)Phylogenetic uncertainty and transmission network inference: Lessons from phylogenetic reconciliation.. ICCABS, page 1. IEEE Computer Society, (2016)Inferring species trees from gene duplication episodes., , , and . BCB, page 198-203. ACM, (2010)An Omega(n2/log n) Speed-Up of TBR Heuristics for the Gene-Duplication Problem., and . WABI, volume 4645 of Lecture Notes in Computer Science, page 124-135. Springer, (2007)Linear-Time Algorithms for Some Phylogenetic Tree Completion Problems Under Robinson-Foulds Distance.. RECOMB-CG, volume 11183 of Lecture Notes in Computer Science, page 209-226. Springer, (2018)Generalized Binary Tanglegrams: Algorithms and Applications., , , and . BICoB, volume 5462 of Lecture Notes in Computer Science, page 114-125. Springer, (2009)On Inferring Additive and Replacing Horizontal Gene Transfers Through Phylogenetic Reconciliation., , and . BCB, page 514-523. ACM, (2019)DupTree: a program for large-scale phylogenetic analyses using gene tree parsimony., , , and . Bioinform., 24 (13): 1540-1541 (2008)A Supervised Machine Learning Approach for Distinguishing Between Additive and Replacing Horizontal Gene Transfers., , and . BCB, page 16:1-16:11. ACM, (2020)