Skip Navigation


Bioinformatics Advance Access originally published online on February 15, 2006
Bioinformatics 2006 22(8):997-998; doi:10.1093/bioinformatics/btl050
This Article
Right arrow Full Text Freely available
Right arrow FREE Full Text (Print PDF) Freely available
Right arrow All Versions of this Article:
22/8/997    most recent
btl050v1
Right arrow Comments: Submit a response
Right arrow Alert me when this article is cited
Right arrow Alert me when Comments are posted
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 arrowRequest Permissions
Google Scholar
Right arrow Articles by Pagel, P.
Right arrow Articles by Frishman, D.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Pagel, P.
Right arrow Articles by Frishman, D.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author 2006. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org

The DIMA web resource—exploring the protein domain network

Philipp Pagel 1,2,{dagger},*, Matthias Oesterheld 2,{dagger}, Volker Stümpflen 2 and Dmitrij Frishman 1,2

1 Department of Genome Oriented Bioinformatics, Technical University of Munich Wissenschaftszentrum Weihenstephan, 85350 Freising, Germany
2 Institute for Bioinformatics/MIPS, GSF, Research Center for Environment and Health, Ingolstädter Landstrasse 1, 85764 Neuherberg, Germany

*To whom correspondence should be addressed.

Summary: Conserved domains represent essential building blocks of most known proteins. Owing to their role as modular components carrying out specific functions they form a network based both on functional relations and direct physical interactions. We have previously shown that domain interaction networks provide substantially novel information with respect to networks built on full-length protein chains. In this work we present a comprehensive web resource for exploring the Domain Interaction MAp (DIMA), interactively. The tool aims at integration of multiple data sources and prediction techniques, two of which have been implemented so far: domain phylogenetic profiling and experimentally demonstrated domain contacts from known three-dimensional structures. A powerful yet simple user interface enables the user to compute, visualize, navigate and download domain networks based on specific search criteria.

Availability: http://mips.gsf.de/genre/proj/dima

Contact: p.pagel{at}gsf.de


Received on November 10, 2005; revised on January 16, 2006; accepted on February 7, 2006

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
BioinformaticsHome page
S.-E. Schelhorn, T. Lengauer, and M. Albrecht
An integrative approach for predicting interactions of protein regions
Bioinformatics, August 15, 2008; 24(16): i35 - i41.
[Abstract] [Full Text] [PDF]


Home page
Nucleic Acids ResHome page
P. Pagel, M. Oesterheld, O. Tovstukhina, N. Strack, V. Stumpflen, and D. Frishman
DIMA 2.0 predicted and known domain interactions
Nucleic Acids Res., January 11, 2008; 36(suppl_1): D651 - D655.
[Abstract] [Full Text] [PDF]


Home page
Nucleic Acids ResHome page
A. Ceol, A. Chatr-aryamontri, E. Santonico, R. Sacco, L. Castagnoli, and G. Cesareni
DOMINO: a database of domain-peptide interactions
Nucleic Acids Res., January 12, 2007; 35(suppl_1): D557 - D560.
[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.