Fast string kernels using inexact matching for protein sequences

Journal of Machine Learning Research

Volumn 5, Issue , 2004, Pages 1435-1455

  Leslie, Christina ^a   Kuang, Rui ^b  

^a Center for Computational Learning Systems Columbia University ^*  (United States)

^b Department of Earth and Environmental Sciences   (United States)

Author keywords

Computational biology; Kernel methods; String kernels

Indexed keywords

BENCHMARKING; BIOINFORMATICS; HIDDEN MARKOV MODELS; MARKOV PROCESSES; PROTEINS; SUPPORT VECTOR MACHINES;

COMPUTATIONAL BIOLOGY; KERNEL METHODS; PARAMETER DEPENDENTS; PROFILE HIDDEN MARKOV MODEL; PROTEIN CLASSIFICATION; PROTEIN SEQUENCE DATA; STRING KERNEL; SUPPORT VECTOR MACHINE (SVMS);

CLASSIFICATION (OF INFORMATION);

EID: 84883575579     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Article

References (29)

1. S. F. Altschul, W. Gish, W. Miller, E. W. Myers, and D. J. Lipman. A basic local alignment search tool. Journal of Molecular Biology, 215:403-410, 1990.
2. C. Cortes, P. Haffner, and M. Mohri. Rational kernels. Neural Information Processing Systems 16, 2002.
3. N. Cristianini and J. Shawe-Taylor. An Introduction to Support Vector Machines. Cambridge, 2000.
4. N. Cristianini, J. Shawe-Taylor, A. Elisseeff, and J. Kandola. On kernel-target alignment. In Neural Information Processing Systems, volume 15, 2001.
5. R. Durbin, S. Eddy, A. Krogh, and G. Mitchison. Biological Sequence Analysis. Cambridge UP, 1998.
6. E. Eskin, W. S. Noble, Y. Singer, and S. Snir. A unified approach for sequence prediction using sparse sequence models. Technical report, Hebrew University, 2003.
7. M. Gribskov, A. D. McLachlan, and D. Eisenberg. Profile analysis: Detection of distantly related proteins. PNAS, pages 4355-4358, 1987.
8. M. Gribskov and N. L. Robinson. Use of receiver operating characteristic (ROC) analysis to evaluate sequence matching. Computers and Chemistry, 20(1):25-33, 1996.
9. D. Haussler. Convolution kernels on discrete structure. Technical report, UC Santa Cruz, 1999.
10. S. Henikoff and J. G. Henikoff. Amino acid substitution matrices from protein blocks. PNAS, 89:10915-10919, 1992.
11. T. Jaakkola, M. Diekhans, and D. Haussler. Using the Fisher kernel method to detect remote protein homologies. In Proceedings of the Seventh International Conference on Intelligent Systems for Molecular Biology, pages 149-158. AAAI Press, 1999.
12. J. Kandola, J. Shawe-Taylor, and N. Cristianini. Optimizing kernel alignment over combinations of kernels. NeoroCOLT Technical Report NC-TR-2002-121, http://www.neurocolt.org, 2002.
13. R. Kuang, E. Ie, K. Wang, K. Wang, M. Siddiqi, Y. Freund, and C. Leslie. Profile-based string kernels for remote homology detection and motif extraction. In Computational Systems Bioinformatics, 2004.
14. C. Leslie, E. Eskin, A. Cohen, J. Weston, and W. S. Noble. Mismatch string kernels for discriminative protein classification. Bioinformatics, 2004.
15. C. Leslie, E. Eskin, and W. S. Noble. The spectrum kernel: A string kernel for SVM protein classification. Proceedings of the Pacific Biocomputing Symposium, 2002a.
16. C. Leslie, E. Eskin, J. Weston, and W. S. Noble. Mismatch string kernels for SVM protein classification. Neural Information Processing Systems 16, 2002b.
17. C. Leslie and R. Kuang. Fast kernels for inexact string matching. Proceedings of COLT/Kernel Workshop, 2003.
18. C. Liao and W. S. Noble. Combining pairwise sequence similarity and support vector machines for remote protein homology detection. Proceedings of the Sixth Annual International Conference on Research in Computational Molecular Biology, 2002.
19. H. Lodhi, C. Saunders, J. Shawe-Taylor, N. Cristianini, and C. Watkins. Text classification using string kernels. Journal of Machine Learning Research, 2:419-444, 2002.
20. A. G. Murzin, S. E. Brenner, T. Hubbard, and C. Chothia. SCOP: A structural classification of proteins database for the investigation of sequences and structures. Journal of Molecular Biology, 247:536-540, 1995.
21. M. Sagot. Spelling approximate or repeated motifs using a suffix tree. Lecture Notes in Computer Science, 1380:111-127, 1998.
22. S. L. Salzberg. On comparing classifiers: Pitfalls to avoid and a recommended approach. Data Mining and Knowledge Discovery, 1:371-328, 1997.
23. R. M. Schwartz and M. O. Dayhoff. Matrices for detecing distant relationships. In Atlas of Protein Sequence and Structure, pages 353-358, Silver Spring, MD, 1978. National Biomedical Research Foundation.
24. J. Shawe-Taylor and N. Cristianini. Kernel Methods for Pattern Analysis. Cambridge University Press, 2004.
25. J.-P. Vert, H. Saigo, and T. Akutsu. Kernel Methods in Computational Biology, chapter Local alignment kernels for biological sequences. MIT Press, 2004.
26. S. V. N. Vishwanathan and A. Smola. Fast kernels for string and tree matching. Neural Information Processing Systems 16, 2002.
27. M. S. Waterman, J. Joyce, and M. Eggert. Computer alignment of sequences, chapter Phylogenetic Analysis of DNA Sequences. Oxford, 1991.
28. C. Watkins. Dynamic alignment kernels. Technical report, UL Royal Holloway, 1999.
29. J. Weston, C. Leslie, D. Zhou, A. Elisseeff, and W. S. Noble. Cluster kernels for semi-supervised protein classification. Neural Information Processing Systems 17, 2003.