Skip Navigation


Nucleic Acids Research Advance Access first published online on June 21, 2007
This version published online on June 25, 2007
Nucleic Acids Research, doi:10.1093/nar/gkm426
This Article
Right arrow Full Text Freely available
Right arrow Print PDF (572K) Freely available
Right arrow Screen PDF (218K) Freely available
Right arrowOA All Versions of this Article:
35/suppl_2/W121    most recent
gkm426v2
gkm426v1
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 Zheng, H.
Right arrow Articles by Wang, J.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Zheng, H.
Right arrow Articles by Wang, J.
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.

Web Server Issue

FGF: A web tool for Fishing Gene Family in a whole genome database

Hongkun Zheng1,2, Junjie Shi1, Xiaodong Fang1, Yuan Li1, Søren Vang3, Wei Fan1, Junyi Wang4, Zhang Zhang1, Wen Wang5, Karsten Kristiansen2 and Jun Wang1,2,6,*

1Beijing Institute of Genomics of Chinese Academy of Sciences, Beijing Genomics Institute, Beijing 101300, China, 2Department of Biochemistry and Molecular Biology, University of Southern Denmark, DK-5230, Odense M, Denmark, 3Research Unit for Molecular Medicine, Aarhus University Hospital and Faculty of Health Sciences, University of Aarhus, 8200 Aarhus N, Denmark, 4The State Key Laboratory of Plant Cell and Chromosome Engineering, Institute of Genetics and Developmental Biology, Chinese Academy of Sciences, Beijing 100101, China, 5CAS-Max-Plank Junior Research Group, Key Laboratory of Cellular and Molecular Evolution, Kunming Institute, China and 6The Institute of Human Genetics, University of Aarhus, DK-8000 Aarhus C, Denmark

*To whom correspondence should be addressed. Tel: +86 10 8048 1664; Fax: +86 10 8049 8676; Email: wangj{at}genomics.org.cn Correspondence may also be addressed to Karsten Kristiansen Tel: +45 6550 2408; Fax: +45 6550 2467; Email: kak{at}bmb.sdu.dk

Received July 15, 2006. Revised May 3, 2007. Accepted May 9, 2007.

Gene duplication is an important process in evolution. The availability of genome sequences of a number of organisms has made it possible to conduct comprehensive searches for duplicated genes enabling informative studies of their evolution. We have established the FGF (Fishing Gene Family) program to efficiently search for and identify gene families. The FGF output displays the results as visual phylogenetic trees including information on gene structure, chromosome position, duplication fate and selective pressure. It is particularly useful to identify pseudogenes and detect changes in gene structure. FGF is freely available on a web server at http://fgf.genomics.org.cn/

The authors wish it to be known that, in their opinion, the first three 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?




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.