Skip Navigation

Systematic Biology 2004 53(5):685-692; doi:10.1080/10635150490522269
This Article
Right arrow Full Text Freely available
Right arrow FREE Full Text (PDF) Freely available
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (9)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Pond, S. L. K.
Right arrow Articles by Muse, S. V.
Right arrow Search for Related Content
PubMed
Right arrow Articles by Pond, S. L. K.
Right arrow Articles by Muse, S. V.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© 2004 Society of Systematic Biologists

Column Sorting: Rapid Calculation of the Phylogenetic Likelihood Function

Sergei L. Kosakovsky Pond1,3 and Spencer V. Muse2

1 Department of Mathematics, University of Arizona Tucson Arizona 85721, USA
2 Bioinformatics Research Center and Department of Statistics, North Carolina State University Raleigh North Carolina 27695–7566, USA; E-mail: muse{at}stat.ncsu.edu

Edited by John Huelsenbeck: Associate Editor


   Abstract

Likelihood applications have become a central approach for molecular evolutionary analyses since the first computationally tractable treatment two decades ago. Although Felsenstein's original pruning algorithm makes likelihood calculations feasible, it is usually possible to take advantage of repetitive structure present in the data to arrive at even greater computational reductions. In particular, alignment columns with certain similarities have components of the likelihood calculation that are identical and need not be recomputed if columns are evaluated in an optimal order. We develop an algorithm for exploiting this speed improvement via an application of graph theory. The reductions provided by the method depend on both the tree and the data, but typical savings range between 15% and 50%. Real-data examples with time reductions of 80% have been identified. The overhead costs associated with implementing the algorithm are minimal, and they are recovered in all but the smallest data sets. The modifications will provide faster likelihood algorithms, which will allow likelihood methods to be applied to larger sets of taxa and to include more thorough searches of the tree topology space.

Keywords: DNA sequence; graph theory; likelihood; phylogeny; traveling salesman problem

Received October 24, 2002; Revised April 21, 2003; Accepted April 5, 2004


3 Current Address: Antiviral Research Center, University of California San Diego, California, USA


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
Syst BiolHome page
D. A. Morrison
Increasing the Efficiency of Searches for the Maximum Likelihood Tree in a Phylogenetic Analysis of up to 150 Nucleotide Sequences
Syst Biol, December 1, 2007; 56(6): 988 - 1010.
[Abstract] [Full Text] [PDF]



Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.