Reconstructing ancestor-descendant lineages from serially-sampled data: A comparison study

N/ACitations
Citations of this article
4Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The recent accumulation of serially-sampled viral sequences in public databases attests to the need for development of algorithms that infer phylogenetic relationships among such data with the goal of elucidating patterns and processes of viral evolution. Phylogenetic methods are typically applied to contemporaneous taxa, and result in the taxa being placed at the tips or leaves of the tree. In a serial sampling scenario an evolutionary framework may offer a more meaningful alternative in which the rise, persistence, and extinction of different viral lineages is readily observable. Recently, algorithms have been developed to study such data. We evaluate the performance of 5 different methods in correctly inferring ancestor-descendant relationships by using empirical and simulated sequence data. Our results suggest that for inferring ancestor-descendant relationships among serially-sampled taxa, the MinPD program is an accurate and efficient method, and that traditional ML methods, while marginally more accurate, are far less efficient. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Buendia, P., Collins, T. M., & Narasimhan, G. (2006). Reconstructing ancestor-descendant lineages from serially-sampled data: A comparison study. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3992 LNCS-II, pp. 807–814). Springer Verlag. https://doi.org/10.1007/11758525_108

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free