DoReMi: context-based prioritization of linear motif matches

Research output: Contribution to journalJournal articleResearchpeer-review

Standard

DoReMi : context-based prioritization of linear motif matches. / Horn, Heiko; Haslam, Niall; Jensen, Lars Juhl.

In: PeerJ, Vol. 2, e315, 20.03.2014.

Research output: Contribution to journalJournal articleResearchpeer-review

Harvard

Horn, H, Haslam, N & Jensen, LJ 2014, 'DoReMi: context-based prioritization of linear motif matches', PeerJ, vol. 2, e315. https://doi.org/10.7717/peerj.315

APA

Horn, H., Haslam, N., & Jensen, L. J. (2014). DoReMi: context-based prioritization of linear motif matches. PeerJ, 2, [e315]. https://doi.org/10.7717/peerj.315

Vancouver

Horn H, Haslam N, Jensen LJ. DoReMi: context-based prioritization of linear motif matches. PeerJ. 2014 Mar 20;2. e315. https://doi.org/10.7717/peerj.315

Author

Horn, Heiko ; Haslam, Niall ; Jensen, Lars Juhl. / DoReMi : context-based prioritization of linear motif matches. In: PeerJ. 2014 ; Vol. 2.

Bibtex

@article{212d11eb817642889d37a59cef676c6c,
title = "DoReMi: context-based prioritization of linear motif matches",
abstract = "Many protein domains bind to short peptide sequences, called linear motifs. Data on their sequence specificities is sparse, which is why biologists usually resort to basic pattern searches to identify new putative binding sites for experimental follow-up. Most motifs have poor specificity and prioritization of the matches is thus crucial when scanning a full proteome with a pattern. Here we present a generic method to prioritize motif occurrence predictions by using cellular contextual information. We take 2 parameters as input: the motif occurrences and one or more of the interacting domains. The potential hits are ranked based on how strongly the context network associates them with a protein containing one of the specified domains, which leads to an increased predictive performance. The method is available through a web interface at doremi.jensenlab.org, which allows for an easy application of the method. We show that this approach leads to improved predictions of binding partners for PDZ domains and the SUMO binding domain. This is consistent with the earlier observation that coupling sequence motifs with network information improves kinase-specific substrate predictions.",
author = "Heiko Horn and Niall Haslam and Jensen, {Lars Juhl}",
year = "2014",
month = "3",
day = "20",
doi = "10.7717/peerj.315",
language = "English",
volume = "2",
journal = "PeerJ",
issn = "2167-8359",
publisher = "PeerJ",

}

RIS

TY - JOUR

T1 - DoReMi

T2 - context-based prioritization of linear motif matches

AU - Horn, Heiko

AU - Haslam, Niall

AU - Jensen, Lars Juhl

PY - 2014/3/20

Y1 - 2014/3/20

N2 - Many protein domains bind to short peptide sequences, called linear motifs. Data on their sequence specificities is sparse, which is why biologists usually resort to basic pattern searches to identify new putative binding sites for experimental follow-up. Most motifs have poor specificity and prioritization of the matches is thus crucial when scanning a full proteome with a pattern. Here we present a generic method to prioritize motif occurrence predictions by using cellular contextual information. We take 2 parameters as input: the motif occurrences and one or more of the interacting domains. The potential hits are ranked based on how strongly the context network associates them with a protein containing one of the specified domains, which leads to an increased predictive performance. The method is available through a web interface at doremi.jensenlab.org, which allows for an easy application of the method. We show that this approach leads to improved predictions of binding partners for PDZ domains and the SUMO binding domain. This is consistent with the earlier observation that coupling sequence motifs with network information improves kinase-specific substrate predictions.

AB - Many protein domains bind to short peptide sequences, called linear motifs. Data on their sequence specificities is sparse, which is why biologists usually resort to basic pattern searches to identify new putative binding sites for experimental follow-up. Most motifs have poor specificity and prioritization of the matches is thus crucial when scanning a full proteome with a pattern. Here we present a generic method to prioritize motif occurrence predictions by using cellular contextual information. We take 2 parameters as input: the motif occurrences and one or more of the interacting domains. The potential hits are ranked based on how strongly the context network associates them with a protein containing one of the specified domains, which leads to an increased predictive performance. The method is available through a web interface at doremi.jensenlab.org, which allows for an easy application of the method. We show that this approach leads to improved predictions of binding partners for PDZ domains and the SUMO binding domain. This is consistent with the earlier observation that coupling sequence motifs with network information improves kinase-specific substrate predictions.

U2 - 10.7717/peerj.315

DO - 10.7717/peerj.315

M3 - Journal article

C2 - 24711967

VL - 2

JO - PeerJ

JF - PeerJ

SN - 2167-8359

M1 - e315

ER -

ID: 110606770