An \(O(n\log n)\)-time algorithm for the maximum constrained agreement subtree problem for binary trees
From MaRDI portal
Publication:845850
DOI10.1016/j.ipl.2006.06.013zbMath1185.68834MaRDI QIDQ845850
Publication date: 29 January 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2006.06.013
Cites Work
- 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
- Combinatorial Pattern Matching
- Computing and Combinatorics
- Efficient algorithms for inferring evolutionary trees