Calculation, Visualization, and Manipulation of MASTs (Maximum Agreement Subtrees)

Authors:
Shiming Dong;Eileen Kraemer
Affiliations:
University of Georgia;University of Georgia
Venue:
CSB '04 Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference
Year:
2004

Citing 7
Cited 1

Kaikoura tree theorems: computing the maximum agreement subtree

Information Processing Letters
On the agreement of many trees

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

SIAM Journal on Computing
Fast comparison of evolutionary trees

SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
An O(nlog n) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees

SIAM Journal on Computing
LumberJack: a heuristic tool for sequence alignment exploration and phylogenetic inference

Bioinformatics
Optimal evolutionary tree comparison by sparse dynamic programming

SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science

An efficient reduction from constrained to unconstrained maximum agreement subtree

WABI'05 Proceedings of the 5th International conference on Algorithms in Bioinformatics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Phylogenetic trees are used to represent the evolutionary history of a set of species. Comparison of multiple phylogenetic trees can help researchers find the common classification of a tree group, compare tree construction inferences or obtain distances between trees. We present TreeAnalyzer, a freely available package for phylogenetic tree comparison. A MAST (Maximum Agreement Subtree) algorithm is implemented to compare the trees. Additional features of this software include tree comparison, visualization, manipulation, labeling, and printing. Availability: http://www.cs.uga.edu/~eileen/TreeAnalyzer