Issue No. 04 - July-Aug. (2012 vol. 9)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TCBB.2012.11
N. D. Pattengale , Sandia Nat. Labs., Albuquerque, NM, USA
E. Chen , Dept. of Biol., Univ. of Ottawa, Ottawa, ON, Canada
K. M. Swenson , Dept. of Math. & Stat., Univ. of Ottawa, Montreal, QC, Canada
D. Sankoff , Dept. of Math. & Stat., Univ. of Ottawa, Ottawa, ON, Canada
A Maximum Agreement SubTree (MAST) is a largest subtree common to a set of trees and serves as a summary of common substructure in the trees. A single MAST can be misleading, however, since there can be an exponential number of MASTs, and two MASTs for the same tree set do not even necessarily share any leaves. In this paper, we introduce the notion of the Kernel Agreement SubTree (KAST), which is the summary of the common substructure in all MASTs, and show that it can be calculated in polynomial time (for trees with bounded degree). Suppose the input trees represent competing hypotheses for a particular phylogeny. We explore the utility of the KAST as a method to discern the common structure of confidence, and as a measure of how confident we are in a given tree set. We also show the trend of the KAST, as compared to other consensus methods, on the set of all trees visited during a Bayesian analysis of flatworm genomes.
zoology, Bayes methods, genetics, genomics, trees (mathematics), flatworm genomes, maximum agreement subtrees, MAST, tree substructure, leaves, Kernel Agreement SubTree, KAST, polynomial time, phylogeny, Bayesian analysis, Vegetation, Phylogeny, Kernel, Bioinformatics, Computational biology, Heuristic algorithms, MAST., Phylogenetics, consensus tree, agreement subtree
N. D. Pattengale, E. Chen, K. M. Swenson and D. Sankoff, "The Kernel of Maximum Agreement Subtrees," in IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 9, no. , pp. 1023-1031, 2012.