Skip Navigation


MBE Advance Access originally published online on October 5, 2006
Molecular Biology and Evolution 2007 24(1):130-136; doi:10.1093/molbev/msl140
This Article
Right arrow Full Text Freely available
Right arrow FREE Full Text (PDF) Freely available
Right arrow Supplementary Material
Right arrow All Versions of this Article:
24/1/130    most recent
msl140v1
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 Lake, J. A.
Right arrow Articles by Skophammer, R. G.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Lake, J. A.
Right arrow Articles by Skophammer, R. G.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author 2006. 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 Articles

Rooting the Tree of Life Using Nonubiquitous Genes

James A. Lake*,{dagger},{ddagger},§, Craig W. Herbold{dagger},§, Maria C. Rivera*,§, Jacqueline A. Servin{dagger},§ and Ryan G. Skophammer*,§

* Department of MCD Biology, University of California
{dagger} Molecular Biology Institute, University of California
{ddagger} Department of Human Genetics, University of California
§ UCLA NASA Astrobiology Institute, University of California

E-mail: lake{at}mbi.ucla.edu.

Accepted for publication September 29, 2006.

Insertion and deletion (indel)–based analyses have great potential for rooting the tree of life, but their use has been limited because they require ubiquitous sequences that have not been horizontally/laterally transferred. Very few such sequences exist. Here we describe and demonstrate a new algorithm that can use nonubiquitous sequences for rooting. This algorithm, top–down indel rooting, uses the traditional logical framework of indel rooting, but by considering gene gains and losses in addition to indel gains and losses, it is able to analyze incomplete data sets. The method is demonstrated using theoretical examples and incomplete gene sets. In particular, it is applied to the well-studied Hsp70/MreB indel, a sequence set thought to have been compromised by gene transfers from Firmicutes to archaebacteria. By sequentially assigning all observable character states, including gene absences, to the questionable archaebacterial Hsp70 and MreB sequences, we demonstrate that this gene set robustly excludes the root of the tree of life from the Gram-negative, double-membrane prokaryotes independently of the archaeal character states. There are very few ubiquitous paralog gene sets, and most of them contain compromised data. The ability of top–down rooting to use incomplete and/or compromised gene sets promises to make rooting analyses more robust and to greatly increase the number of useful indel sets.

Key Words: tree of life • root • indels • cenancestor • double-membrane prokaryotes


Martin Embley, Associate Editor


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


This article has been cited by other articles:


Home page
Mol Biol EvolHome page
J. A. Lake
Reconstructing Evolutionary Graphs: 3D Parsimony
Mol. Biol. Evol., August 1, 2008; 25(8): 1677 - 1682.
[Abstract] [Full Text] [PDF]


Home page
Microbiol. Mol. Biol. Rev.Home page
G. J. Workun, K. Moquin, R. A. Rothery, and J. H. Weiner
Evolutionary Persistence of the Molybdopyranopterin-Containing Sulfite Oxidase Protein Fold
Microbiol. Mol. Biol. Rev., June 1, 2008; 72(2): 228 - 248.
[Abstract] [Full Text] [PDF]



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.