Efficient computations of gapped string kernels based on suffix kernel
- 31 January 2008
- journal article
- research article
- Published by Elsevier BV in Neurocomputing
- Vol. 71 (4-6), 944-962
- https://doi.org/10.1016/j.neucom.2007.02.005
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Bit-Parallel Witnesses and Their Applications to Approximate String MatchingAlgorithmica, 2004
- Protein homology detection using string alignment kernelsBioinformatics, 2004
- Advanced support vector machines and kernel methodsNeurocomputing, 2003
- Kernel methods: a survey of current techniquesNeurocomputing, 2002
- A fast bit-vector algorithm for approximate string matching based on dynamic programmingJournal of the ACM, 1999
- Geometric range searching and its relativesPublished by American Mathematical Society (AMS) ,1999