Skip Navigation



MBE Advance Access published online on January 8, 2009

Molecular Biology and Evolution, doi:10.1093/molbev/msp003
This Article
Right arrow Advance Access manuscript (PDF)
Right arrow All Versions of this Article:
26/4/801    most recent
msp003v1
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by O'Brien, J. D.
Right arrow Articles by Suchard, M. A.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by O'Brien, J. D.
Right arrow Articles by Suchard, M. A.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author 2009. Published by Oxford University Press on behalf of the Society for Molecular Biology and Evolution. All rights reserved. For permissions, please e-mail: journals.permissions@oxfordjournals.org

Research Article

Learning to Count: Robust Estimates for Labeled Distances between Molecular Sequences

John D. O'Brien1,{dagger}, Vladimir N. Minin2,{dagger} and Marc A. Suchard1,3,4,*

1 Department of Biomathematics, UCLA, Los Angeles, CA, 90095, USA
2 Department of Statistics, University of Washington, Seattle, WA, 98195, USA
3 Department of Biostatistics, UCLA, Los Angeles, CA, 90095, USA
4 Department of Human Genetics, UCLA, Los Angeles, CA, 90095, USA

* To whom correspondence should be addressed.

Corresponding author: Marc A. Suchard, Departments of Biomathematics, Biostatistics and Human Genetics, 6558 Gonda Building, 695 Charles E. Young Drive, South, Los Angeles, CA 90095-1766, email: msuchard{at}ucla.edu, telephone: (310) 825-7442, fax: (310) 825-8685

Received for publication July 1, 2008. Revision received November 3, 2008. Revision received December 29, 2008. Accepted for publication December 30, 2008.

Researchers routinely estimate distances between molecular sequences using continuous-time Markov chain models. We present a new method, robust counting, that protects against the possibly severe bias arising from model misspecification. We achieve this robustness by generalizing conventional distance estimation to incorporate the empirical distribution of site patterns found in the observed pairwise sequence alignment. Our flexible framework allows for computing distances based only on a subset of possible substitutions. From this, we show how to estimate labeled codon distances, such as expected numbers of synonymous or nonsynonymous substitutions. We present two simulation studies. The first compares the relative bias and variance of conventional and robust labeled nucleotide estimators. In the second simulation, we demonstrate that robust counting furnishes accurate synonymous and nonsynonymous distance estimates based only on easy-to-fit models of nucleotide substitution, bypassing the need for computationally expensive codon models. We conclude with three empirical examples. In the first two examples, we investigate the evolutionary dynamics of the influenza A hemagglutinin gene using labeled codon distances. In the final example, we demonstrate the advantages of using robust synonymous distances to alleviate the effect of convergent evolution on phylogenetic analysis of an HIV transmission network.

Key Words: robust counting • labeled codon distance • empirical distribution • Markov chain substitution model


{dagger} These authors wish to be considered as joint first authors.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.