The Community for Technology Leaders
Green Image
Issue No. 01 - January-March (2009 vol. 6)
ISSN: 1545-5963
pp: 7-21
Serita Nelesen , The University of Texas at Austin, Austin
Kevin Liu , The University of Texas at Austin, Austin
Tandy Warnow , The University of Texas at Austin, Austin
Sindhu Raghavan , The University of Texas at Austin, Austin
C. Randal Linder , The University of Texas at Austin, Austin
Several methods have been developed for simultaneous estimation of alignment and tree, of which POY is the most popular. In a 2007 paper published in Systematic Biology, Ogden and Rosenberg reported on a simulation study in which they compared POY to estimating the alignment using ClustalW and then analyzing the resultant alignment using maximum parsimony. They found that ClustalW+MP outperformed POY with respect to alignment and phylogenetic tree accuracy, and they concluded that simultaneous estimation techniques are not competitive with two-phase techniques. Our paper presents a simulation study in which we focus on the NP-hard optimization problem that POY addresses: minimizing treelength. Our study considers the impact of the gap penalty and suggests that the poor performance observed for POY by Ogden and Rosenberg is due to the simple gap penalties they used to score alignment/tree pairs. Our study suggests that optimizing under an affine gap penalty might produce alignments that are better than ClustalW alignments, and competitive with those produced by the best current alignment methods. We also show that optimizing under this affine gap penalty produces trees whose topological accuracy is better than ClustalW+MP, and competitive with the current best two-phase methods.
Markov processes, Biology and genetics
Serita Nelesen, Kevin Liu, Tandy Warnow, Sindhu Raghavan, C. Randal Linder, "Barking Up The Wrong Treelength: The Impact of Gap Penalty on Alignment and Tree Accuracy", IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 6, no. , pp. 7-21, January-March 2009, doi:10.1109/TCBB.2008.63
109 ms
(Ver 3.1 (10032016))