From constrained to unconstrained maximum agreement subtree in linear time
From MaRDI portal
Publication:2479535
DOI10.1007/s00453-007-9084-8zbMath1141.68049MaRDI QIDQ2479535
Publication date: 3 April 2008
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-007-9084-8
Bioinformatics; Reduction; Consensus; Constrained maximum agreement subtrees; Evolutionary trees; Maximum agreement subtrees
68Q25: Analysis of algorithms and problem complexity
05C05: Trees
92D15: Problems related to evolution
68R10: Graph theory (including graph drawing) in computer science
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Kaikoura tree theorems: Computing the maximum agreement subtree
- An algorithm to find agreement subtrees
- 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
- Tree Contractions and Evolutionary Trees
- Tree Compatibility and Inferring Evolutionary History
- Combinatorial Pattern Matching
- Algorithms and Computation
- Efficient algorithms for inferring evolutionary trees