An O(nlog n) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees

https://doi.org/10.1137/S0097539796313477

Abstract

The maximum agreement subtree problem is the following. Given two rooted trees whose leaves are drawn from the same set of items (e.g., species), find the largest subset of these items so that the portions of the two trees restricted to these items are isomorphic. We consider the case which occurs frequently in practice, i.e., the case when the trees are binary, and give an O(nlog n) time algorithm for this problem.

[1] Amihood Amir and , Dmitry Keselman, Maximum agreement subtree in a set of evolutionary trees: metrics and efficient algorithms, SIAM J. Comput., 26 (1997), 1656–1669 10.1137/S0097539794269461 98i:68109 Link ISI Google Scholar
[2] Google Scholar
[3] Google Scholar
[4] M. Farach, , T. Przytycka and , and M. Thorup, Agreement of many bounded degree evolutionary trees, Inform. Process. Lett., 55 (1995), pp. 297–301. ipl IFPLAT 0020-0190 Inf. Process. Lett. Crossref ISI Google Scholar
[5] Martin Farach and , Mikkel Thorup, Fast comparison of evolutionary trees, Inform. and Comput., 123 (1995), 29–37 10.1006/inco.1995.1155 96j:92013 Crossref ISI Google Scholar
[6] Martin Farach and , Mikkel Thorup, Sparse dynamic programming for evolutionary‐tree comparison, SIAM J. Comput., 26 (1997), 210–230 10.1137/S0097539794262422 97m:68093 Link ISI Google Scholar
[7] C. R. Finden and and A. D. Gordon, Obtaining common pruned trees, J. Classification, 2 (1985), pp. 255–276. Crossref ISI Google Scholar
[8] Google Scholar
[9] Google Scholar
[10] Dov Harel and , Robert Tarjan, Fast algorithms for finding nearest common ancestors, SIAM J. Comput., 13 (1984), 338–355 85f:68081 Link ISI Google Scholar
[11] Ming‐Yang Kao, Tree contractions and evolutionary trees, SIAM J. Comput., 27 (1998), 1592–1616 10.1137/S0097539795283504 2000a:05063 Link ISI Google Scholar
[12] E. Kubicka, , G. Kubicki and , and F. R. McMorris, An algorithm to find agreement subtrees, J. Classification, 12 (1995), pp. 91–100. Crossref ISI Google Scholar
[13] K. Mehlhorn, A best possible bound for the weighted path length of binary search trees, SIAM J. Computing, 6 (1977), pp. 235–239. sim SMJCAT 0097-5397 SIAM J. Comput. Link Google Scholar
[14] Mike Steel and , Tandy Warnow, Kaikoura tree theorems: computing the maximum agreement subtree, Inform. Process. Lett., 48 (1993), 77–82 10.1016/0020-0190(93)90181-8 95d:68066 Crossref ISI Google Scholar

Keywords

- On the Maximum Agreement Subtree Conjecture for Balanced Trees
  Magnus Bordewich,
  Simone Linz,
  Megan Owen,
  Katherine St. John,
  Charles Semple, and
  Kristina Wicke
  31 January 2022 | SIAM Journal on Discrete Mathematics, Vol. 36, No. 1
  Abstract PDF (1343 KB)
- A Faster Algorithm for Computing the Kernel of Maximum Agreement Subtrees
  IEEE/ACM Transactions on Computational Biology and Bioinformatics, Vol. 18, No. 2
  Cross Ref
- On the extremal maximum agreement subtree problem
  Discrete Applied Mathematics, Vol. 285
  Cross Ref
- Computing a Consensus Phylogeny via Leaf Removal
  Journal of Computational Biology, Vol. 27, No. 2
  Cross Ref
- Computing a Consensus Phylogeny via Leaf Removal
  9 May 2019
  Cross Ref
- Finding a Center Tree of Phylogenetic Trees via Leaf Removal
  Cross Ref
- Linear-Time Tree Containment in Phylogenetic Networks
  8 September 2018
  Cross Ref
- Computing Asymmetric Median Tree of Two Trees via Better Bipartite Matching Algorithm
  17 April 2018
  Cross Ref
- Algorithms for the Majority Rule (+) Consensus Tree and the Frequency Difference Consensus Tree
  IEEE/ACM Transactions on Computational Biology and Bioinformatics, Vol. 15, No. 1
  Cross Ref
- On finding the Adams consensus tree
  Information and Computation, Vol. 256
  Cross Ref
- A More Practical Algorithm for the Rooted Triplet Distance
  Journal of Computational Biology, Vol. 24, No. 2
  Cross Ref
- Constructing a Consensus Phylogeny from a Leaf-Removal Distance (Extended Abstract)
  6 September 2017
  Cross Ref
- Faster Algorithms for Computing the R* Consensus Tree
  27 January 2016 | Algorithmica, Vol. 76, No. 4
  Cross Ref
- Maximum Agreement Subtree (of 2 Binary Trees)
  22 April 2016
  Cross Ref
- On the complexity of finding a largest common subtree of bounded degree
  Theoretical Computer Science, Vol. 590
  Cross Ref
- Tree Matching Using Data Shaping
  Cross Ref
- A More Practical Algorithm for the Rooted Triplet Distance
  28 July 2015
  Cross Ref
- Maximum Agreement Subtree (of 2 Binary Trees)
  18 February 2015
  Cross Ref
- EvoMiner: frequent subtree mining in phylogenetic databases
  30 July 2013 | Knowledge and Information Systems, Vol. 41, No. 3
  Cross Ref
- On Decomposing Integration Tasks for Hierarchical Structures
  Cross Ref
- Algorithms for the Majority Rule (+) Consensus Tree and the Frequency Difference Consensus Tree
  Cross Ref
- Succinct representations of weighted trees supporting path queries
  Journal of Discrete Algorithms, Vol. 17
  Cross Ref
- A scalable method for identifying frequent subtrees in sets of large phylogenetic trees
  3 October 2012 | BMC Bioinformatics, Vol. 13, No. 1
  Cross Ref
- Gene tree correction for reconciliation and species tree inference
  20 November 2012 | Algorithms for Molecular Biology, Vol. 7, No. 1
  Cross Ref
- A Metric for Phylogenetic Trees Based on Matching
  IEEE/ACM Transactions on Computational Biology and Bioinformatics, Vol. 9, No. 4
  Cross Ref
- Evolutionary algorithms for supertree search
  Cross Ref
- Forbidden Patterns
  Cross Ref
- Improved Algorithms for Maximum Agreement and Compatible Supertrees
  7 April 2009 | Algorithmica, Vol. 59, No. 2
  Cross Ref
- A Metric for Phylogenetic Trees Based on Matching
  Cross Ref
- Removing Noise from Gene Trees
  Cross Ref
- New common ancestor problems in trees and directed acyclic graphs
  Information Processing Letters, Vol. 110, No. 8-9
  Cross Ref
- Linear time 3-approximation for the MAST problem
  23 March 2009 | ACM Transactions on Algorithms, Vol. 5, No. 2
  Cross Ref
- New scalable measure for comparing phylogenetic trees
  Cross Ref
- From Constrained to Unconstrained Maximum Agreement Subtree in Linear Time
  17 October 2007 | Algorithmica, Vol. 50, No. 3
  Cross Ref
- Maximum Agreement Subtree (of 2 Binary Trees)
  Cross Ref
- Maximum Agreement Subtree (of 3 or More Trees)
  Cross Ref
- An efficient strategy for generating all descendant subtree patterns from phylogenetic trees with its implementation
  Applied Mathematics and Computation, Vol. 193, No. 2
  Cross Ref
- Maximum agreement and compatible supertrees
  Journal of Discrete Algorithms, Vol. 5, No. 3
  Cross Ref
- Summarizing a Posterior Distribution of Trees Using Agreement Subtrees
  1 August 2007 | Systematic Biology, Vol. 56, No. 4
  Cross Ref
- Finding maximal leaf-agreement isomorphic descendent subtrees from phylogenetic trees with different species
  Theoretical Computer Science, Vol. 370, No. 1-3
  Cross Ref
- An -time algorithm for the maximum constrained agreement subtree problem for binary trees
  Information Processing Letters, Vol. 100, No. 4
  Cross Ref
- An algebraic view of the relation between largest common subtrees and smallest common supertrees
  Theoretical Computer Science, Vol. 362, No. 1-3
  Cross Ref
- Efficient computation of 2-medians in a tree network with positive/negative weights
  Discrete Mathematics, Vol. 306, No. 14
  Cross Ref
- Improved Parameterized Complexity of the Maximum Agreement Subtree and Maximum Compatible Tree Problems
  IEEE/ACM Transactions on Computational Biology and Bioinformatics, Vol. 3, No. 3
  Cross Ref
- Linear-Time Algorithms for Two Subtree-Comparison Problems on Phylogenetic Trees with Different Species
  Cross Ref
- A novel algorithm and web-based tool for comparing two alternative phylogenetic trees
  18 October 2005 | Bioinformatics, Vol. 22, No. 1
  Cross Ref
- An improved algorithm for the maximum agreement subtree problem
  Information Processing Letters, Vol. 94, No. 5
  Cross Ref
- The mutated subsequence problem and locating conserved genes
  3 March 2005 | Bioinformatics, Vol. 21, No. 10
  Cross Ref
- Computing the maximum agreement of phylogenetic networks
  Theoretical Computer Science, Vol. 335, No. 1
  Cross Ref
- On the Approximation of Computing Evolutionary Trees
  Cross Ref
- An Efficient Reduction from Constrained to Unconstrained Maximum Agreement Subtree
  Cross Ref
- Fast Structural Search in Phylogenetic Databases
  9 November 2017 | Evolutionary Bioinformatics, Vol. 1
  Cross Ref
- Computing the Maximum Agreement of Phylogenetic Networks
  Electronic Notes in Theoretical Computer Science, Vol. 91
  Cross Ref
- Rooted Maximum Agreement Supertrees
  Cross Ref
- Maximum Agreement and Compatible Supertrees
  Cross Ref
- Online Consensus and Agreement of Phylogenetic Trees
  Cross Ref
- The Maximum Agreement of Two Nested Phylogenetic Networks
  Cross Ref
- An O(nlog n)-Time Algorithm for the Maximum Constrained Agreement Subtree Problem for Binary Trees
  Cross Ref
- Partitioning Polygons into Tree Monotone and Y -monotone Subpolygons
  18 June 2003
  Cross Ref
- Efficient Algorithms for Descendent Subtrees Comparison of Phylogenetic Trees with Applications to Co-evolutionary Classifications in Bacterial Genome
  Cross Ref
- An Even Faster and More Unifying Algorithm for Comparing Trees via Unbalanced Bipartite Matchings
  Journal of Algorithms, Vol. 40, No. 2
  Cross Ref
- Efficient Algorithms for SNP Haplotype Block Selection Problems
  Cross Ref
- An improved algorithm for the maximum agreement subtree problem
  Cross Ref
- A mutation-sensitive approach for locating conserved gene pairs between related species
  Cross Ref
- Calculation, visualization, and manipulation of MASTs (maximum agreement subtrees)
  Cross Ref
- TreeRank: a similarity measure for nearest neighbor searching in phylogenetic databases
  Cross Ref

Volume 30, Issue 5| 2000

SIAM Journal on Computing

History

Published online:27 July 2006

Information

Keywords

MSC codes

PDF Download

Article & Publication Data

Article DOI:10.1137/S0097539796313477

Article page range:pp. 1385-1404

ISSN (print):0097-5397

ISSN (online):1095-7111

Publisher:Society for Industrial and Applied Mathematics

An O(nlog n) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees

Abstract

Keywords

SIAM Journal on Computing

History

Information

Browse

Browse

Alerts

Alerts

Information

Information

About

About

Verify Phone

Congrats!

An O(nlog n) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees

Abstract

Keywords

SIAM Journal on Computing

History

Information

Browse

Alerts

Information

About

Request Username

Register

Change Password

Password Changed Successfully

Login

Verify Phone

Congrats!