Building species trees from larger parts of phylogenomic databases

DOI10.1016/j.ic.2010.11.022zbMath1217.92045WikidataQ114751711 ScholiaQ114751711MaRDI QIDQ553332

Celine Scornavacca, Vincent Ranwez, Vincent Berry

Publication date: 27 July 2011

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2010.11.022

zbMATH Keywords

polynomial algorithms; evolutionary tree; duplications; graphs and graph transformation; intractability proof

Mathematics Subject Classification ID

05C90: Applications of graph theory

92C40: Biochemistry, molecular biology

92D10: Genetics and epigenetics

92-08: Computational methods for problems pertaining to biology

Related Items

The matroid structure of representative triple sets and triple-closure computation

Uses Software

• PhySIC
• Notung
• Bio++

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of reconstructing trees from qualitative characters and subtrees
• A supertree method for rooted trees
• Extension operations on sets of leaf-labelled trees
• Closure operations in phylogenetics
• Fast Algorithms for Finding Nearest Common Ancestors
• From Gene Trees to Species Trees through a Supertree Approach
• Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions
• From Gene Trees to Species Trees
• Efficient algorithms for inferring evolutionary trees