Sparse Dynamic Programming for Evolutionary-Tree Comparison
From MaRDI portal
Publication:4337441
DOI10.1137/S0097539794262422zbMath0871.05050MaRDI QIDQ4337441
Publication date: 24 September 1997
Published in: SIAM Journal on Computing (Search for Journal in Brave)
05C05: Trees
05C90: Applications of graph theory
90C39: Dynamic programming
05C85: Graph algorithms (graph-theoretic aspects)
92B05: General biology and biomathematics
Related Items
APPROXIMATING THE MAXIMUM ISOMORPHIC AGREEMENT SUBTREE IS HARD, On the complexity of comparing evolutionary trees, Improved algorithms for maximum agreement and compatible supertrees, Finding maximal leaf-agreement isomorphic descendent subtrees from phylogenetic trees with different species, An efficient strategy for generating all descendant subtree patterns from phylogenetic trees with its implementation, An improved algorithm for the maximum agreement subtree problem, Computing the maximum agreement of phylogenetic networks