Skip Navigation


Nucleic Acids Research Advance Access originally published online on June 18, 2007
Nucleic Acids Research 2007 35(Web Server issue):W455-W459; doi:10.1093/nar/gkm400
This Article
Right arrow Full Text Freely available
Right arrow Print PDF (4420K) Freely available
Right arrow Screen PDF (623K) Freely available
Right arrow Supplementary Material
Right arrowOA All Versions of this Article:
35/suppl_2/W455    most recent
gkm400v1
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 Davey, N. E.
Right arrow Articles by Shields, D. C.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Davey, N. E.
Right arrow Articles by Shields, D. C.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Nucleic Acids Research, 2007, Vol. 35, No. suppl_2 W455-W459
© 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.


Articles

The SLiMDisc server: short, linear motif discovery in proteins

Norman E. Davey, Richard J. Edwards and Denis C. Shields*

UCD Conway Institute of Biomolecular and Biomedical Research, University College Dublin, Belfield, Dublin 4, Ireland

*To whom correspondence should be addressed. Tel: +353-1-7165344; Fax: +353-1-7166701; Email: denis.shields{at}ucd.ie

Received January 29, 2007. Revised April 30, 2007. Accepted May 1, 2007.

Short, linear motifs (SLiMs) play a critical role in many biological processes, particularly in protein–protein interactions. Overrepresentation of convergent occurrences of motifs in proteins with a common attribute (such as similar subcellular location or a shared interaction partner) provides a feasible means to discover novel occurrences computationally. The SLiMDisc (Short, Linear Motif Discovery) web server corrects for common ancestry in describing shared motifs, concentrating on the convergently evolved motifs. The server returns a listing of the most interesting motifs found within unmasked regions, ranked according to an information content-based scoring scheme. It allows interactive input masking, according to various criteria. Scoring allows for evolutionary relationships in the data sets through treatment of BLAST local alignments. Alongside this ranked list, visualizations of the results improve understanding of the context of suggested motifs, helping to identify true motifs of interest. These visualizations include alignments of motif occurrences, alignments of motifs and their homologues and a visual schematic of the top-ranked motifs. Additional options for filtering and/or re-ranking motifs further permit the user to focus on motifs with desired attributes. Returned motifs can also be compared with known SLiMs from the literature. SLiMDisc is available at: http://bioware.ucd.ie/~slimdisc/.


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
BioinformaticsHome page
R. J. Edwards, N. E. Davey, and D. C. Shields
CompariMotif: quick and easy comparisons of sequence motifs
Bioinformatics, May 15, 2008; 24(10): 1307 - 1309.
[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.