Representation in stochastic search for phylogenetictree reconstruction

View/ Open
Published Version
https://doi.org/10.1016/j.jbi.2005.11.001Metadata
Show full item recordCitation
Weber, Griffin, Lucila Ohno-Machado, and Stuart M. Shieber. Representation in stochastic search for phylogenetictree reconstruction. Journal of Biomedical Informatics 39.1 (2006): 43-50. Copyright World Scientific Publishing Company. http://www.sciencedirect.com/science/journal/15320464.Abstract
Phylogenetic tree reconstruction is a process in which the ancestral relationships among a group of organisms are inferred from their DNA sequences. For all but trivial sized data sets, finding the optimal tree is computationally intractable. Many heuristic algorithms exist, but the branch-swapping algorithm used in the software package PAUP is the most popular. This method performs a stochastic search over the space of trees, using a branch-swapping operation to construct neighboring trees in the search space. This study introduces a new stochastic search algorithm that operates over an alternative representation of trees, namely as permutations of taxa giving the order in which they are processed during stepwise addition. Experiments on several data sets suggest that this algorithm for generating an initial tree, when followed by branch-swapping, can produce better trees for a given total amount of time.Terms of Use
This article is made available under the terms and conditions applicable to Other Posted Material, as set forth at http://nrs.harvard.edu/urn-3:HUL.InstRepos:dash.current.terms-of-use#LAACitable link to this page
http://nrs.harvard.edu/urn-3:HUL.InstRepos:2031671
Collections
- FAS Scholarly Articles [17553]
Contact administrator regarding this item (to report mistakes or request changes)