Skip Navigation



Nucleic Acids Research Advance Access published online on November 5, 2007
Nucleic Acids Research, doi:10.1093/nar/gkm924
This Article
Right arrow Full Text Freely available
Right arrow Print PDF (7175K) Freely available
Right arrow Screen PDF (907K) Freely available
Right arrowOA All Versions of this Article:
36/suppl_1/D255    most recent
gkm924v1
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 arrow Commercial Re-use Guidelines
for Open Access NAR Content
Google Scholar
Right arrow Articles by Ding, G.
Right arrow Articles by Li, Y.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Ding, G.
Right arrow Articles by Li, Y.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© 2007 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.

Database Issue

EPGD: a comprehensive web resource for integrating and displaying eukaryotic paralog/paralogon information

Guohui Ding1,2, Yan Sun1,2, Hong Li1,2, Zhen Wang1,2, Haiwei Fan1, Chuan Wang1, Dan Yang4 and Yixue Li1,3,*

1Bioinformatics Center, Key Lab of Systems Biology, Shanghai Institutes for Biological Sciences, Chinese Academy of Sciences, 320 Yueyang Road, 2Graduate School of the Chinese Academy of Sciences, Shanghai 200031, 3Shanghai Center for Bioinformation Technology, 100 Qinzhou Road, Shanghai 200235 and 4Shanghai Information Center for Life Sciences, Shanghai Institutes for Biology Science, Chinese Academy of Science, Shanghai 200031, P. R. China

*To whom correspondence should be addressed. Tel: +86 21 54920089; Fax: +86 21 54920143; Email: yxli{at}sibs.ac.cn

Received August 4, 2007. Revised October 8, 2007. Accepted October 10, 2007.

Gene duplication is common in all three domains of life, especially in eukaryotic genomes. The duplicates provide new material for the action of evolutionary forces such as selection or genetic drift. Here we describe a sophisticated procedure to extract duplicated genes (paralogs) from 26 available eukaryotic genomes, to pre-calculate several evolutionary indexes (evolutionary rate, synonymous distance/clock, transition redundant exchange clock, etc.) based on the paralog family, and to identify block or segmental duplications (paralogons). We also constructed an internet-accessible Eukaryotic Paralog Group Database (EPGD; http://epgd.biosino.org/EPGD/). The database is gene-centered and organized by paralog family. It focuses on paralogs and evolutionary duplication events. The paralog families and paralogons can be searched by text or sequence, and are downloadable from the website as plain text files. The database will be very useful for both experimentalists and bioinformaticians interested in the study of duplication events or paralog families.

The authors wish it to be known that, in their opinion, the first two authors should be regarded as joint First Authors.


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
 Nucleic Acids ResHome page
G. Ding, P. Lorenz, M. Kreutzer, Y. Li, and H.-J. Thiesen
SysZNF: the C2H2 zinc finger gene database
Nucleic Acids Res., January 1, 2009; 37(suppl_1): D267 - D273.
[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.