Large-Scale Learning with String Kernels
The MIT Press eBooksPublished 17 August 2007
Sören Sonnenburg, Gunnar Rätsch, Konrad Rieck
Citations50
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
This chapter contains sections titled: Introduction, String Kernels, Sparse Feature Maps, Speeding up SVM Training and Testing, Benchmark Experiments, Extensions, Conclusion.
Abstract
This chapter contains sections titled: Introduction, String Kernels, Sparse Feature Maps, Speeding up SVM Training and Testing, Benchmark Experiments, Extensions, Conclusion
Keywords
Computer ScienceBiochemistry, Genetics and Molecular Biology
Algorithms on strings, trees, and sequences
1,723 Citations1997Dan Gusfield
THE SPECTRUM KERNEL: A STRING KERNEL FOR SVM PROTEIN CLASSIFICATION
944 Citations2001Christina S. Leslie, Eleazar Eskin +1 more
A new sequence-similarity kernel, the spectrum kernel, is introduced for use with support vector machines (SVMs) in a discriminative approach to the protein classification problem and performs well in comparison with state-of-the-art methods for homology detection.
The MIT Press eBooksLarge-Scale Kernel Machines
542 Citations2007
This volume offers researchers and engineers practical solutions for learning from large scale datasets, with detailed descriptions of algorithms and experiments carried out on realistically large datasets, and offers information that can address the relative lack of theoretical grounding for many useful algorithms.
BMC BioinformaticsAccurate splice site prediction using support vector machines
188 Citations2007Sören Sonnenburg, Gabriele Schweikert +3 more
The performance estimates indicate that splice sites can be recognized very accurately in these genomes and that the method outperforms many other methods including Markov Chains, GeneSplicer and SpliceMachine.
BioinformaticsARTS: accurate recognition of transcription starts in human
137 Citations2006Sören Sonnenburg, Alexander Zien +1 more
New methods for finding transcription start sites (TSS) of RNA Polymerase II binding genes in genomic DNA sequences are developed, employing Support Vector Machines with advanced sequence kernels to achieve drastically higher prediction accuracies than state-of-the-art methods.
Fast and space efficient string kernels using suffix arrays
44 Citations2006Choon Hui Teo, S. V. N. Vishwanathan
A new linear time yet space efficient and scalable algorithm for computing string kernels, based on suffix arrays, which is faster and easier to implement, and on the average requires only 19n bytes of storage, and exhibits strong locality of memory access.