Consensus Methods Using Phylogenetic Databases

A. Kramer, D.R. Richards, J.O. Bowlby, R.M. Felciano
2005 IEEE Computational Systems Bioinformatics Conference - Workshops (CSBW'05)  
With the increasing use and size of phylogenies, the output of reconstruction programs must be stored for future reference, in which case post-tree analyses such as consensus must be run from a database. We set out to determine whether such analyses can be run at a reasonable cost; we chose consensus (which summarizes the information from many trees into a single tree) because of its general applicability and because it creates a severe demand on the database by requiring examination of every
more » ... mination of every edge of every tree. Methodology: We preprocess the data (trees) to create tables that support consensus computations, using our own extensions to the PhyloDB schema of Nakhleh et al. For each of the three consensus methods (strict, majority, and greedy), we compare the database computation with the memory-resident computation using the Phylip consensus programs. We use a large selection of datasets of varying sizes (up to 1,000 trees of up to 1,500 taxa each) and of varying degrees of commonality. Results: The computations from the database are very practical: they often run faster, and never run more than 5 times slower, than the computations in main memory using Phylip. The additional storage costs are easily handled by any database system, while the preprocessing costs remain reasonable. Thus suitable preprocessing of phylogenetic data allows post-tree analyses to be run directly from the database at much the same cost as current memory-resident analyses.
doi:10.1109/csbw.2005.43 dblp:conf/csb/KramerRBF05 fatcat:5nfdin4sxvbv5ksdlhfs2zhl2i