An efficient strategy for generating all descendant subtree patterns from phylogenetic trees with its implementation
DOI10.1016/J.AMC.2007.03.077zbMATH Open1193.05152OpenAlexW2023208060MaRDI QIDQ990618FDOQ990618
Authors: Sun-Yuan Hsieh, Chao-Wen Huang 
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
Recommendations
- Efficient Enumeration of Phylogenetically Informative Substrings
- Efficiently inferring pairwise subtree prune-and-regraft adjacencies between phylogenetic trees
- Properties of subtree-prune-and-regraft operations on totally-ordered phylogenetic trees
- A Fast Algorithm for the Computation and Enumeration of Perfect Phylogenies
- Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology
treebaseknowledge discoveryphylogenetic treesdesign and analysis of algorithmsdescendant subtreestree pattern retrievalweb-based system
Cites Work
- Printer graphics for clustering
- Inferring evolutionary trees with strong combinatorial evidence
- Title not available (Why is that?)
- Parallel concepts in graph theory
- Efficient algorithms for inferring evolutionary trees
- On finding common subtrees
- On an algorithm of Zemlyachenko for subtree isomorphism
- Fast Algorithms for Finding Nearest Common Ancestors
- Optimal algorithms for comparing trees with labeled leaves
- Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions
- Pattern Matching in Trees
- An even faster and more unifying algorithm for comparing trees via unbalanced bipartite matchings
- Maximum Agreement Subtree in a Set of Evolutionary Trees: Metrics and Efficient Algorithms
- On the agreement of many trees
- An \(O(n\log n)\) algorithm for the maximum agreement subtree problem for binary trees
- Sparse Dynamic Programming for Evolutionary-Tree Comparison
- An improved algorithm for the maximum agreement subtree problem
- Algorithms and Computation
- On the subtree isomorphism problem for ordered trees
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (3)
This page was built for publication: An efficient strategy for generating all descendant subtree patterns from phylogenetic trees with its implementation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q990618)
