Skip Navigation


Nucleic Acids Research Advance Access originally published online on April 29, 2008
Nucleic Acids Research 2008 36(10):3436-3442; doi:10.1093/nar/gkn227
This Article
Right arrow Full Text Freely available
Right arrow Print PDF (202K) Freely available
Right arrow Screen PDF (219K) Freely available
Right arrow Supplementary Data
Right arrowOA All Versions of this Article:
36/10/3436    most recent
gkn227v1
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 ISI Web of Science
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 arrow Commercial Re-use Guidelines
for Open Access NAR Content
Google Scholar
Right arrow Articles by Ho, M.-R.
Right arrow Articles by Lin, W.-c.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Ho, M.-R.
Right arrow Articles by Lin, W.-c.
Related Collections
Right arrow Genomics
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Nucleic Acids Research, 2008, Vol. 36, No. 10 3436-3442
© 2008 The Author(s)
This is an Open Access article distributed under the terms of the Creative Commons Attribution Non-Commercial License (http://creativecommons.org/licenses/by-nc/2.0/uk/) which permits unrestricted non-commercial use, distribution, and reproduction in any medium, provided the original work is properly cited.


Computational Biology

Designating eukaryotic orthology via processed transcription units

Meng-Ru Ho1,2,3, Wen-Jung Jang2,3,4, Chun-houh Chen5, Lan-Yang Ch'ang3 and Wen-chang Lin1,3,*

1Institute of Biomedical Informatics, National Yang-Ming University, 2Bioinformatics Program, Taiwan International Graduate Program, Academia Sinica, 3Institute of Biomedical Sciences, Academia Sinica, Taipei, 4Institute of Bioinformatics, National Chiao-Tung University, Hsinchu and 5Institute of Statistical Sciences, Academia Sinica, Taipei, Taiwan

*To whom correspondence should be addressed. Tel: +(886) 2 2652 3967; Fax: +(886) 2 2782 7654; Email: wenlin{at}ibms.sinica.edu.tw

Received January 4, 2008. Revised April 8, 2008. Accepted April 11, 2008.

Orthology is a widely used concept in comparative and evolutionary genomics. In addition to prokaryotic orthology, delineating eukaryotic orthology has provided insight into the evolution of higher organisms. Indeed, many eukaryotic ortholog databases have been established for this purpose. However, unlike prokaryotes, alternative splicing (AS) has hampered eukaryotic orthology assignments. Therefore, existing databases likely contain ambiguous eukaryotic ortholog relationships and possibly misclassify alternatively spliced protein isoforms as in-paralogs, which are duplicated genes that arise following speciation. Here, we propose a new approach for designating eukaryotic orthology using processed transcription units, and we present an orthology database prototype using the human and mouse genomes. Currently existing programs cover less than 69% of the human reference sequences when assigning human/mouse orthologs. In contrast, our method encompasses up to 80% of the human reference sequences. Moreover, the ortholog database presented herein is more than 92% consistent with the existing databases. In addition to managing AS, this approach is capable of identifying orthologs of embedded genes and fusion genes using syntenic evidence. In summary, this new approach is sensitive, specific and can generate a more comprehensive and accurate compilation of eukaryotic orthologs.


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.