Fast and space efficient string kernels using suffix arrays

ACM International Conference Proceeding Series

Volumn 148, Issue , 2006, Pages 929-936

  Choon, Hui Teo ^b   Vishwanathan, S V N ^a  

^a CSIRO   (Australia)

^b AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ARRAY PROCESSING; COMPUTATIONAL METHODS; DECISION TREES; DETERIORATION; SCALABILITY; SIGNAL FILTERING AND PREDICTION; STORAGE ALLOCATION (COMPUTER);

ANNOTATION; LENGTH STRING; MEMORY ACCESS; STRING KERNELS;

LEARNING SYSTEMS;

EID: 34250766728     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1143844.1143961     Document Type: Conference Paper

References (17)

1. Abouelhoda, M. I., Kurtz, S., & Ohlebusch, E. (2004). Replacing suffix trees with enhanced suffix arrays. Journal of Discrete Algorithms, 2, 53-86.
2. Chang, W. I., & Lawler, E. L. (1994). Sublinear approximate sting matching and biological applications. Algorithmica, 12(4/5), 327-344.
3. Collins, M., & Duffy, N. (2001). Convolution kernels for natural language. In T. G. Dietterich, S. Becker, & Z. Ghahramani, eds., Advances in Neural Information Processing Systems 14. Cambridge, MA: MIT Press.
4. Durbin, R., Eddy, S., Krogh, A., & Mitchison, G. (1998). Biological Sequence Analysis: Probabilistic models of proteins and nucleic acids. Cambridge University Press.
5. Giegerich, R., & Kurtz, S. (1997). From Ukkonen to McCreight and Weiner: A unifying view of linear-time suffix tree construction. Algorithmica, 19(3), 331-353.
6. Gonnet, G. H., Baeza-Yates, R. A., & Snider, T. (1992). Information Retrieval: Data Structures and Algorithms, chap. 5, New indices for text: PAT Trees and PAT arrays, 66-82. Upper Saddle River, NJ, USA: Prentice-Hall, Inc. ISBN 0-13-463837-9.
7. Gusfield, D. (1997). Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology. Cambridge University Press. ISBN 0 - 521 - 58519 - 8.
8. Herbrich, R. (2002). Learning Kernel Classifiers: Theory and Algorithms. MIT Press.
9. Leslie, C., Eskin, E., & Noble, W. S. (2002a). The spectrum kernel: A string kernel for SVM protein classification. In Proceedings of the Pacific Symposium, on Biocomputing, 564-575.
10. Leslie, C., Eskin, E., Weston, J., & Noble, W. S. (2002b). Mismatch string kernels for SVM protein classification. In S. Becker, S. Thrun, & K. Obermayer, eds., Advances in Neural Information Processing Systems 15, vol. 15. Cambridge, MA: MIT Press.
11. Lodhi, H., Saunders, C., Shawe-Taylor, J., Cristianini, N., & Watkins, C. (2002). Text classification using string kernels. Journal of Machine Learning Research, 2, 419-444.
12. Manber, U., & Myers, G. (1993). Suffix arrays: A new method for on-line string searches. SIAM journal on computing, 22(5), 935-948.
13. Maniscalco, M. A., & Puglisi, S. J. (2005). An efficient, versatile approach to suffix sorting. ACM Journal of Experimental Algorithms. Submitted.
14. Manzinni, G. (2004). Two space saving tricks for linear time lcp array computation. In Proc. 9th Scandinavian Workshop on Algorithm Theory (SWAT'04), vol. 3111 of LCNS, 372-383. Humlebaek, Denmark: Springer-Verlag.
15. Schölkopf, B., & Smola, A. (2002). Learning with Kernels. Cambridge, MA: MIT Press.
16. Vishwanathan, S. V. N., & Smola, A. J. (2004). Fast kernels for string and tree matching. In K. Tsuda, B. Schölkopf, & J. Vert, eds., Kernels and Bioinformatics. Cambridge, MA: MIT Press.
17. Vishwanathan, S. V. N., Smola, A. J., & Murty, M. (2003). SimpleSVM. In T. Fawcett, & N. Mishra, eds., Proceedings of the 20th International Conference on Machine Learning (ICML). Washington DC: AAAI press.