An \(O(n\log n)\)-time algorithm for the maximum constrained agreement subtree problem for binary trees

DOI10.1016/j.ipl.2006.06.013zbMath1185.68834OpenAlexW1546313448MaRDI QIDQ845850

N. E. Zubov

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

zbMATH Keywords

design of algorithmsphylogenetic analysismaximum agreement subtree

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An \(O(n\log n)\)-time algorithm for the maximum constrained agreement subtree problem for binary trees