Keywords

phylogenetic analysis, DNA sequencing, large data sets

Abstract

Phylogenetic analysis is an integral part of biological research. As the number of sequenced genomes increases, available data sets are growing in number and size. Several algorithms have been proposed to handle these larger data sets. A family of algorithms known as disc covering methods (DCMs), have been selected by the NSF funded CIPRes project to boost the performance of existing phylogenetic algorithms. Recursive Iterative Disc Covering Method 3 (Rec-I-DCM3), recursively decomposes the guide tree into subtrees, executing a phylogenetic search on the subtree and merging the subtrees, for a set number of iterations. This paper presents a detailed analysis of this algorithm.

Original Publication Citation

Phylogenetic Analysis of Large Sequence Data Sets, Hyrum Carroll, Mark Clement, Quinn Snell, Keith Crandall, Biotechnology and Bioinformatics Symposium (BIOT), Colorado Springs, CO, October 25, pp 2-25.