Finding maximal leaf-agreement isomorphic descendent subtrees from phylogenetic trees with different species
From MaRDI portal
Publication:868961
DOI10.1016/j.tcs.2006.10.028zbMath1118.68190OpenAlexW2085572762MaRDI QIDQ868961
Publication date: 26 February 2007
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2006.10.028
phylogenetic treesdesign and analysis of algorithmsmaximal leaf-agreement descendent subtreesmaximal leaf-agreement isomorphic descendent subtrees
Analysis of algorithms (68W40) Problems related to evolution (92D15) Nonnumerical algorithms (68W05)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On an algorithm of Zemlyachenko for subtree isomorphism
- An improved algorithm for the maximum agreement subtree problem
- Optimal algorithms for comparing trees with labeled leaves
- On the subtree isomorphism problem for ordered trees
- On finding common subtrees
- On the agreement of many trees
- Inferring evolutionary trees with strong combinatorial evidence
- An O(nlog n) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees
- An Even Faster and More Unifying Algorithm for Comparing Trees via Unbalanced Bipartite Matchings
- Fast Algorithms for Finding Nearest Common Ancestors
- Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions
- Pattern Matching in Trees
- Printer graphics for clustering
- Sparse Dynamic Programming for Evolutionary-Tree Comparison
- Maximum Agreement Subtree in a Set of Evolutionary Trees: Metrics and Efficient Algorithms
- Algorithms and Computation
- Efficient algorithms for inferring evolutionary trees
