Skip Navigation

This Article
Right arrow Full Text Freely available
Right arrow Print PDF (519K) Freely available
Right arrow Supplementary Data
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 Search for citing articles in:
ISI Web of Science (7)
Right arrow Commercial Re-use Guidelines
for Open Access NAR Content
Google Scholar
Right arrow Articles by Silverstein, K. A. T.
Right arrow Articles by Retzel, E. F.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Silverstein, K. A. T.
Right arrow Articles by Retzel, E. F.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Nucleic Acids Research, 2001, Vol. 29, No. 1 49-51
© 2001 Oxford University Press

The MetaFam Server: a comprehensive protein family resource

Kevin A. T. Silverstein, Elizabeth Shoop, James E. Johnson, Alan Kilian, John L. Freeman, Timothy M. Kunau, Ihab A. Awad, Margaret Mayer and Ernest F. Retzel*

Computational Biology Centers, Academic Health Center, University of Minnesota, Mayo Mail Code 43, 420 Delaware Street, SE Minneapolis, MN 55455-0312, USA

MetaFam is a comprehensive relational database of protein family information. This web-accessible resource integrates data from several primary sequence and secondary protein family databases. By pooling together the information from these disparate sources, MetaFam is able to provide the most complete protein family sets available. Users are able to explore the interrelationships among these primary and secondary databases using a powerful graphical visualization tool, MetaFamView. Additionally, users can identify corresponding sequence entries among the sequence databases, obtain a quick summary of corresponding families (and their sequence members) among the family databases, and even attempt to classify their own unassigned sequences. Hypertext links to the appropriate source databases are provided at every level of navigation. Global family database statistics and information are also provided. Public access to the data is available at http://metafam.ahc.umn.edu/.

* To whom correspondence should be addressed. Tel: +1 612 625 5957; Fax: +1 612 626 6069; Email: metafam{at}ahc.umn.edu. Correspondence may also be addressed to Kevin A. T. Silverstein at the same address and phone number.


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
 Proc. Natl. Acad. Sci. USAHome page
I. Alam, A. Dress, M. Rehmsmeier, and G. Fuellen
Comparative homology agreement search: An effective combination of homology-search methods
PNAS, September 21, 2004; 101(38): 13814 - 13819.
[Abstract] [Full Text] [PDF]

Home page
 Plant Physiol.Home page
K. A. VandenBosch and G. Stacey
Summaries of Legume Genomics Projects from around the Globe. Community Resources for Crops and Models
Plant Physiology, March 1, 2003; 131(3): 840 - 865.
[Full Text] [PDF]

Home page
 Nucleic Acids ResHome page
A.-F. J. Lamblin, J. A. Crow, J. E. Johnson, K. A. T. Silverstein, T. M. Kunau, A. Kilian, D. Benz, M. Stromvik, G. Endre, K. A. VandenBosch, et al.
MtDB: a database for personalized data mining of the model legume Medicago truncatula transcriptome
Nucleic Acids Res., January 1, 2003; 31(1): 196 - 201.
[Abstract] [Full Text] [PDF]

Home page
 Nucleic Acids ResHome page
C. H. Wu, C. Xiao, Z. Hou, H. Huang, and W. C. Barker
iProClass: an integrated, comprehensive and annotated protein classification database
Nucleic Acids Res., January 1, 2001; 29(1): 52 - 54.
[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.