A Linear-Time Algorithm for Reconciliation of Non-binary Gene Tree and Binary Species Tree

DOI10.1007/978-3-319-03780-6_17zbMath1408.92014OpenAlexW22269019MaRDI QIDQ2867119

Taoyang Wu, Louxin Zhang, Yu Zheng

Publication date: 10 December 2013

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-03780-6_17

zbMATH Keywords

linear-time algorithmbinary species treenon-binary gene tree

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Genetics and epigenetics (92D10)

Uses Software

• TxT
• Notung

Cites Work

• DLS-trees: a model of evolutionary scenarios
• The gene evolution model and computing its associated probabilities
• Reconciling Gene Trees with Apparent Polytomies
• On Finding Lowest Common Ancestors: Simplification and Parallelization
• From Gene Trees to Species Trees
• A Dual of Dilworth's Decomposition Theorem
• Research in Computational Molecular Biology