Maximum Agreement Subtree in a Set of Evolutionary Trees: Metrics and Efficient Algorithms

@article{Amir1997MaximumAS,
  title={Maximum Agreement Subtree in a Set of Evolutionary Trees: Metrics and Efficient Algorithms},
  author={Amihood Amir and Dmitry Keselman},
  journal={SIAM J. Comput.},
  year={1997},
  volume={26},
  pages={1656-1669}
}
The maximum agreement subtree approach is one method of reconciling different evolutionary trees for the same set of species. An agreement subtree enables choosing a subset of the species for whom the restricted subtree is equivalent (under a suitable definition) in all given evolutionary trees. Recently, dynamic programming ideas were used to provide polynomial time algorithms for finding a maximum homeomorphic agreement subtree of two trees. Generalizing these methods to sets of more than two… CONTINUE READING
15 Citations
22 References
Similar Papers

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 22 references

Obtaining common pruned trees

  • C. R. Finden, A. D. Gordon
  • Journal of Classi cation,
  • 1985
Highly Influential
9 Excerpts

A measure of the agreement between

  • A. D. Gordon
  • rankings. Biometrika,
  • 1979
Highly Influential
6 Excerpts

Dress , Reconstructing the shape of a tree from observed dissimilarity data , Adv

  • A.
  • Appl . Math
  • 1994

Fast comparison of evolutionary trees

  • A. D. Gordon
  • Proc . 5 th ACMSIAM Symposiumon Discrete…
  • 1994

Maximum agreement subtree in a set of evolutionary treesmetrics ande  cient algorithms

  • D. Keselman.
  • Proc . FOCS
  • 1994

A measure of the agreement between rankings

  • A. D. Gordon.
  • DIMACS Workshop on Partitioning Data Sets
  • 1993

Similar Papers

Loading similar papers…