An efficient strategy for generating all descendant subtree patterns from phylogenetic trees with its implementation

DOI10.1016/J.AMC.2007.03.077MaRDI QIDQ990618zbMATHOpenAlexFDO

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

zbMATH Keywords

treebaseknowledge discoveryphylogenetic treesdesign and analysis of algorithmsdescendant subtreestree pattern retrievalweb-based system

Mathematics Subject Classification ID

Problems related to evolution (92D15) Graph algorithms (graph-theoretic aspects) (05C85)

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

Cites work

• scientific article; zbMATH DE number 1615275 (Why is no real title available?)
• scientific article; zbMATH DE number 3698213 (Why is no real title available?)
• scientific article; zbMATH DE number 1820633 (Why is no real title available?)
• Algorithms and Computation
• An \(O(n\log 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
• An improved algorithm for the maximum agreement subtree problem
• Efficient algorithms for inferring evolutionary trees
• Fast Algorithms for Finding Nearest Common Ancestors
• Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions
• Inferring evolutionary trees with strong combinatorial evidence
• Maximum Agreement Subtree in a Set of Evolutionary Trees: Metrics and Efficient Algorithms
• On an algorithm of Zemlyachenko for subtree isomorphism
• On finding common subtrees
• On the agreement of many trees
• On the subtree isomorphism problem for ordered trees
• Optimal algorithms for comparing trees with labeled leaves
• Parallel concepts in graph theory
• Pattern Matching in Trees
• Printer graphics for clustering
• Sparse Dynamic Programming for Evolutionary-Tree Comparison

Cited in

(3)

• Linear-Time Algorithms for Two Subtree-Comparison Problems on Phylogenetic Trees with Different Species
• Algorithms and Computation
• Efficient Enumeration of Phylogenetically Informative Substrings

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)