This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Mining conditional phosphorylation motifs
PrePrint
ISSN: 1545-5963
Xiaoqing Liu, Xiaoqing Liu is with the School of Software, Dalian University of Technology, Dalian, China. (Email: eileenwelldone@gmail.com).
Phosphorylation motifs represent position-specific amino acid patterns around the phosphorylation sites in the set of phosphopeptides. Several algorithms have been proposed to uncover phosphorylation motifs, whereas the problem of efficiently discovering a set of significant motifs with sufficiently high coverage and non-redundancy still remains unsolved. Here we present a novel notion called conditional phosphorylation motifs. Through this new concept, the motifs whose over-expressiveness mainly benefits from its constituting parts can be filtered out effectively. To discover conditional phosphorylation motifs, we propose an algorithm called C-Motif for a non-redundant identification of significant phosphorylation motifs. C-Motif is implemented under the Apriori framework, and it tests the statistical significance together with the frequency of candidate motifs in a single stage. Experiments demonstrate that C-Motif outperforms some current algorithms such as MMFPh and Motif-All in terms of coverage and non-redundancy of the results and efficiency of the excution. The source code of C-Motif is available at: https://sourceforge.net/projects/cmotif/.
Citation:
Zengyou He, Shengchun Deng, Haipeng Gong, Xiaoqing Liu, Jun Wu, "Mining conditional phosphorylation motifs," IEEE/ACM Transactions on Computational Biology and Bioinformatics, 22 May 2014. IEEE computer Society Digital Library. IEEE Computer Society, <http://doi.ieeecomputersociety.org/10.1109/TCBB.2014.2321400>
Usage of this product signifies your acceptance of the Terms of Use.