Simple chained guide trees give poorer multiple sequence alignments than inferred trees in simulation and phylogenetic benchmarks
Author(s) -
Ge Tan,
Manuel Gil,
Ari Löytynoja,
Nick Goldman,
Christophe Dessimoz
Publication year - 2015
Publication title -
proceedings of the national academy of sciences
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 5.011
H-Index - 771
eISSN - 1091-6490
pISSN - 0027-8424
DOI - 10.1073/pnas.1417526112
Subject(s) - phylogenetic tree , simple (philosophy) , multiple sequence alignment , sequence (biology) , tree (set theory) , computational biology , biology , phylogenetic network , computer science , sequence alignment , evolutionary biology , mathematics , combinatorics , genetics , peptide sequence , gene , epistemology , philosophy
Multiple sequence aligners typically work by progressively aligning the most closely related sequences or group of sequences according to guide trees. In PNAS, Boyce et al. (1) report that alignments reconstructed using simple chained trees (i.e., comb-like topologies) with random leaf assignment performed better in protein structure-based benchmarks than those reconstructed using phylogenies estimated from the data as guide trees. The authors state that this result could turn decades of research in the field on its head. In light of this statement, it is important to check immediately whether their result holds under evolutionary criteria: recovery of homologous sequence residues and inference of phylogenetic trees from the alignments (2). We have done this and the results are entirely opposed to Boyce et al.’s findings (1). Simulation entails simplifying assumptions, but …
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom