An efficient strategy for generating all descendant subtree patterns from phylogenetic trees with its implementation
From MaRDI portal
Publication:990618
DOI10.1016/j.amc.2007.03.077zbMath1193.05152OpenAlexW2023208060MaRDI QIDQ990618
Chao-Wen Huang, Sun-Yuan Hsieh
Publication date: 1 September 2010
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2007.03.077
treebaseknowledge discoveryphylogenetic treesdesign and analysis of algorithmsdescendant subtreestree pattern retrievalweb-based system
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
- Parallel concepts in graph theory
- 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
