Sparse Dynamic Programming for Evolutionary-Tree Comparison

DOI10.1137/S0097539794262422MaRDI QIDQ4337441zbMATH OpenFDO

Authors Martin Farach, Mikkel Thorup

Publication date 24 September 1997

Published in SIAM Journal on Computing (Search for Journal in Brave)

zbMATH Keywords

dynamic programmingcomparisonevolutionary treerooted treeunary weighted bipartite matching

Mathematics Subject Classification ID

Applications of graph theory (05C90) Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Dynamic programming (90C39) General biology and biomathematics (92B05)

Recommendations

• scientific article; zbMATH DE number 1113983
• Fast comparison of evolutionary trees
• scientific article; zbMATH DE number 1003280

Cited in

(9)

• APPROXIMATING THE MAXIMUM ISOMORPHIC AGREEMENT SUBTREE IS HARD
• Improved algorithms for maximum agreement and compatible supertrees
• Computing and Combinatorics
• Fast comparison of evolutionary trees
• On the complexity of comparing evolutionary trees
• Finding maximal leaf-agreement isomorphic descendent subtrees from phylogenetic trees with different species
• An improved algorithm for the maximum agreement subtree problem
• Computing the maximum agreement of phylogenetic networks
• An efficient strategy for generating all descendant subtree patterns from phylogenetic trees with its implementation

This page was built for publication: Sparse Dynamic Programming for Evolutionary-Tree Comparison

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4337441)