Finding motifs in protein secondary structure for use in function prediction

Journal of Computational Biology

Volumn 13, Issue 3, 2006, Pages 719-731

  Ferré, Sébastien ^a   King, Ross D ^b  

^a UNIVERSITÉ DE RENNES 1   (France)

^b ABERYSTWYTH UNIVERSITY   (United Kingdom)

Author keywords

Dichotomic search algorithm; Flexible motifs; Functional genomics; Protein secondary structure

Indexed keywords

MEMBRANE PROTEIN;

ALGORITHM; ARTICLE; COMPUTER PREDICTION; ESCHERICHIA COLI; FUNCTIONAL GENOMICS; GENE; GENE FUNCTION; MYCOBACTERIUM TUBERCULOSIS; PREDICTION; PRIORITY JOURNAL; PROTEIN MOTIF; PROTEIN SECONDARY STRUCTURE; SEQUENCE ALIGNMENT; YGL124C GENE;

ALGORITHMS; AMINO ACID MOTIFS; MEMBRANE PROTEINS; PREDICTIVE VALUE OF TESTS; SACCHAROMYCES CEREVISIAE PROTEINS; SEQUENCE ANALYSIS, PROTEIN; STRUCTURE-ACTIVITY RELATIONSHIP;

EID: 33744456230     PISSN: 10665277     EISSN: None     Source Type: Journal    
DOI: 10.1089/cmb.2006.13.719     Document Type: Article

References (30)

1. Albert-Lorincz, H., and Boulicaut, J.-F. 2003. Mining frequent sequential patterns under regular expressions: A highly adaptive strategy for pushing contraints. SIAM Int. Conf. on Data Mining.
2. Altschul, S.F., Madden, T.L., Schaffer, A.A., Zhang, J., Zhang, Z., Miller, W., and Lipman, D.J. 1997. Gapped BLAST and PSI-BLAST: A new generation of protein database search programs. Nucl. Acids Res. 25, 3389-3402.
3. Apostolico, A. 1997. String editing and longest common subsequences, in Rozenberg, G., and Salomaa, A., eds., Handbook of Formal Languages, vol. 2, Linear Modeling: Background and Application, chap. 8, 361-398. Springer-Verlag, Berlin.
4. Baker, B.S., and Giancarlo, R. 1998. Longest common subsequence from fragments via sparse dynamic programming. Algorithms-ESA'98, 6th Ann. Eur. Symp., LNCS 1461, 79-90.
5. Brāzma, A., Jonassen, I., Eidhammer, I., and Gilbert, D. 1995. Approaches to the automatic discovery of patterns in biosequences. Technical report 113, Department of Informatics, University of Bergen, Norway.
6. Brejová, B., DiMarco, C., Vinař, T., Hidalgo, S.R., Holguin, G., and Patten, C. 2000. Finding patterns in biological sequences. Technical report CS-2000-22, University of Waterloo.
7. Clare, A., and King, R.D. 2003. Predicting gene function in Saccharomyces cerevisiae. Bioinformatics 19(Suppl. 2), ii42-ii49.
8. Eyrich, V.A., Przybylski, D., Koh, I.Y., Grana, O., Pazos, F., Valencia, A., and Rost, B. 2003. CAFASP3 in the spotlight of EVA. Proteins 53(Suppl. 6), 548-560.
9. Ferré, S., and King, R.D. 2005. A dichotomic search algorithm for mining and learning in domain-specific logics. Fundamenta Informaticae-Special Issue on Advances in Mining Graphs. Trees and Sequences 66(1-2), 1-32.
10. Ferré, S., and Ridoux, O. 2000. A logical generalization of formal concept analysis. Int. Conf. Conceptual Structures. LNCS 1867, 371-384.
11. Fürnkranz, J. 1996. Separate-and-conquer rule learning. Technical report OEFAI-TR-96-25. Austrian Research Institute for Artificial Intelligence, Schottengasse 3. A-1010 Wien, Austria.
12. Ganter, B., and Wille, R. 1999. Formal Concept Analysis-Mathematical Foundations. Springer, New York.
13. Goffeau, A., et al. 1997. The yeast genome directory. Nature 387, 1-105.
14. Higgins, D.G., Thompson, J.D., and Gibson, T.J. 1994. CLUSTAL W: Improving the sensitivity of progressive multiple sequence alignment through sequence weighting, position specific gap penalties and weight matrix choice. Nucl. Acids Res. 22, 4673-4680.
15. Jonassen, I. 1996. Efficient discovery of conserved patterns using a pattern graph. Technical report 118. Department of Informatics, University of Bergen, Norway.
16. Kelley, L.A., MacCallum, R.M., and Sternberg, M.J.E. 2000. Enhanced genome annotation using structural profiles in the program 3d-pssm. J. Mol. Biol. 299, 501-522.
17. King, R.D., and Clare, A.J. 2003. Confirmation of data mining based predictions of protein function. Bioinformatics. In press.
18. King, R.D., Karwath, A., Clare, A., and Dehaspe, L. 2000. Accurate prediction of protein functional class in the M. tuberculosis and E. coli genomes using data mining. Yeast (Comparative and Functional Genomics) 17, 283-293.
19. King, R.D., and Sternberg, M.J.E. 1990. Machine learning approach for the prediction of protein secondary structure. J. Mol. Biol. 216, 441-457.
20. Laskowski, R.A., Watson, J.D., and Thornton, J.M. 2003. From protein structure to biochemical function? J. Struct. Funct. Genomics 4(2-3), 167-177.
21. Meilling-Wesse, K., Barth, H., Voss, C., Barmark, G., Muren, E., Ronne, H., and Thumm, M. 2002. Yeast Mon1p/Aut12p functions in vacuolar fusion of autophagosomes and cvt-vesicles. FEBS Lett. 530(1-3).
22. Mitchell, T. 1997. Machine Learning, McGraw-Hill, Reading, MA.
23. Muggleton, S., and De Raedt, L. 1994. Inductive logic programming: Theory and methods. J. Logic Programming 19(20), 629-679.
24. Onali, M., and King, R.D. 2000. Cascaded multiple classifiers for secondary structure prediction. Prot. Sci. 9, 1162-1176.
25. Park, J., Karplus, K., Barrett, C., Hughey, R., Haussler, D., Hubbard, T., and Chothia, C. 1998. Sequence comparisons using multiple sequences detect three times as many remote homologues as pairwise methods. J. Mol. Biol. 284(4), 1201-1210.
26. Quinlan, J.R. 1993. C4.5: Programs for machine learning. Machine Learning.
27. Rigoutsos, I., and Floratos, A. 1998. Combinatorial pattern discovery in biological sequences: The TEIRESIAS algorithm. Bioinformatics 14(1), 55-67.
28. Sigrist, C.J.A., Cerutti, L., Hulo, N., Gattiker, A., Falquet, L., Pagni, M. Bairoch, A., and Bucher, P. 2002. PROSITE: A documented database using patterns and profiles as motif descriptors. Brief Bioinform. 3, 265-274.
29. Turcotte, M., Muggleton, S.H., and Sternberg, M.J.F. 1998. Application of inductive logic programming to discover rules governing the three-dimensional topology of protein structure. Int. Conf. Inductive Logic Programming. LNCS 1446, 53-64.
30. Wang, L., and Jiang, T. 1994. On the complexity of multiple sequence alignment. J. Comp. Biol. 1, 337-348.