Cargando…
Fast and Accurate Discovery of Degenerate Linear Motifs in Protein Sequences
Linear motifs mediate a wide variety of cellular functions, which makes their characterization in protein sequences crucial to understanding cellular systems. However, the short length and degenerate nature of linear motifs make their discovery a difficult problem. Here, we introduce MotifHound, an...
Autores principales: | , , , |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Public Library of Science
2014
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4160167/ https://www.ncbi.nlm.nih.gov/pubmed/25207816 http://dx.doi.org/10.1371/journal.pone.0106081 |
_version_ | 1782334345557573632 |
---|---|
author | Kelil, Abdellali Dubreuil, Benjamin Levy, Emmanuel D. Michnick, Stephen W. |
author_facet | Kelil, Abdellali Dubreuil, Benjamin Levy, Emmanuel D. Michnick, Stephen W. |
author_sort | Kelil, Abdellali |
collection | PubMed |
description | Linear motifs mediate a wide variety of cellular functions, which makes their characterization in protein sequences crucial to understanding cellular systems. However, the short length and degenerate nature of linear motifs make their discovery a difficult problem. Here, we introduce MotifHound, an algorithm particularly suited for the discovery of small and degenerate linear motifs. MotifHound performs an exact and exhaustive enumeration of all motifs present in proteins of interest, including all of their degenerate forms, and scores the overrepresentation of each motif based on its occurrence in proteins of interest relative to a background (e.g., proteome) using the hypergeometric distribution. To assess MotifHound, we benchmarked it together with state-of-the-art algorithms. The benchmark consists of 11,880 sets of proteins from S. cerevisiae; in each set, we artificially spiked-in one motif varying in terms of three key parameters, (i) number of occurrences, (ii) length and (iii) the number of degenerate or “wildcard” positions. The benchmark enabled the evaluation of the impact of these three properties on the performance of the different algorithms. The results showed that MotifHound and SLiMFinder were the most accurate in detecting degenerate linear motifs. Interestingly, MotifHound was 15 to 20 times faster at comparable accuracy and performed best in the discovery of highly degenerate motifs. We complemented the benchmark by an analysis of proteins experimentally shown to bind the FUS1 SH3 domain from S. cerevisiae. Using the full-length protein partners as sole information, MotifHound recapitulated most experimentally determined motifs binding to the FUS1 SH3 domain. Moreover, these motifs exhibited properties typical of SH3 binding peptides, e.g., high intrinsic disorder and evolutionary conservation, despite the fact that none of these properties were used as prior information. MotifHound is available (http://michnick.bcm.umontreal.ca or http://tinyurl.com/motifhound) together with the benchmark that can be used as a reference to assess future developments in motif discovery. |
format | Online Article Text |
id | pubmed-4160167 |
institution | National Center for Biotechnology Information |
language | English |
publishDate | 2014 |
publisher | Public Library of Science |
record_format | MEDLINE/PubMed |
spelling | pubmed-41601672014-09-12 Fast and Accurate Discovery of Degenerate Linear Motifs in Protein Sequences Kelil, Abdellali Dubreuil, Benjamin Levy, Emmanuel D. Michnick, Stephen W. PLoS One Research Article Linear motifs mediate a wide variety of cellular functions, which makes their characterization in protein sequences crucial to understanding cellular systems. However, the short length and degenerate nature of linear motifs make their discovery a difficult problem. Here, we introduce MotifHound, an algorithm particularly suited for the discovery of small and degenerate linear motifs. MotifHound performs an exact and exhaustive enumeration of all motifs present in proteins of interest, including all of their degenerate forms, and scores the overrepresentation of each motif based on its occurrence in proteins of interest relative to a background (e.g., proteome) using the hypergeometric distribution. To assess MotifHound, we benchmarked it together with state-of-the-art algorithms. The benchmark consists of 11,880 sets of proteins from S. cerevisiae; in each set, we artificially spiked-in one motif varying in terms of three key parameters, (i) number of occurrences, (ii) length and (iii) the number of degenerate or “wildcard” positions. The benchmark enabled the evaluation of the impact of these three properties on the performance of the different algorithms. The results showed that MotifHound and SLiMFinder were the most accurate in detecting degenerate linear motifs. Interestingly, MotifHound was 15 to 20 times faster at comparable accuracy and performed best in the discovery of highly degenerate motifs. We complemented the benchmark by an analysis of proteins experimentally shown to bind the FUS1 SH3 domain from S. cerevisiae. Using the full-length protein partners as sole information, MotifHound recapitulated most experimentally determined motifs binding to the FUS1 SH3 domain. Moreover, these motifs exhibited properties typical of SH3 binding peptides, e.g., high intrinsic disorder and evolutionary conservation, despite the fact that none of these properties were used as prior information. MotifHound is available (http://michnick.bcm.umontreal.ca or http://tinyurl.com/motifhound) together with the benchmark that can be used as a reference to assess future developments in motif discovery. Public Library of Science 2014-09-10 /pmc/articles/PMC4160167/ /pubmed/25207816 http://dx.doi.org/10.1371/journal.pone.0106081 Text en © 2014 Kelil et al http://creativecommons.org/licenses/by/4.0/ This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are properly credited. |
spellingShingle | Research Article Kelil, Abdellali Dubreuil, Benjamin Levy, Emmanuel D. Michnick, Stephen W. Fast and Accurate Discovery of Degenerate Linear Motifs in Protein Sequences |
title | Fast and Accurate Discovery of Degenerate Linear Motifs in Protein Sequences |
title_full | Fast and Accurate Discovery of Degenerate Linear Motifs in Protein Sequences |
title_fullStr | Fast and Accurate Discovery of Degenerate Linear Motifs in Protein Sequences |
title_full_unstemmed | Fast and Accurate Discovery of Degenerate Linear Motifs in Protein Sequences |
title_short | Fast and Accurate Discovery of Degenerate Linear Motifs in Protein Sequences |
title_sort | fast and accurate discovery of degenerate linear motifs in protein sequences |
topic | Research Article |
url | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4160167/ https://www.ncbi.nlm.nih.gov/pubmed/25207816 http://dx.doi.org/10.1371/journal.pone.0106081 |
work_keys_str_mv | AT kelilabdellali fastandaccuratediscoveryofdegeneratelinearmotifsinproteinsequences AT dubreuilbenjamin fastandaccuratediscoveryofdegeneratelinearmotifsinproteinsequences AT levyemmanueld fastandaccuratediscoveryofdegeneratelinearmotifsinproteinsequences AT michnickstephenw fastandaccuratediscoveryofdegeneratelinearmotifsinproteinsequences |