Representation in stochastic search for phylogenetictree reconstruction
MetadataShow full item record
CitationWeber, 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.
AbstractPhylogenetic 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, ﬁnding 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.
Citable link to this pagehttp://nrs.harvard.edu/urn-3:HUL.InstRepos:2031671
- FAS Scholarly Articles 
Contact administrator regarding this item (to report mistakes or request changes)