Versatile string kernels
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 5990082 (Why is no real title available?)
- scientific article; zbMATH DE number 4085051 (Why is no real title available?)
- scientific article; zbMATH DE number 1336330 (Why is no real title available?)
- scientific article; zbMATH DE number 699389 (Why is no real title available?)
- scientific article; zbMATH DE number 1460605 (Why is no real title available?)
- 10.1162/153244302760200687
- A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices
- Aggregation of partial rankings, \(p\)-ratings and top-\(m\) lists
- Algorithms for subsequence combinatorics
- Algorithms on Strings, Trees and Sequences
- Combinatorial representations of token sequences
- Comparing Partial Rankings
- Computing distances between partial rankings
- Concordance and consensus
- Dealing with large diagonals in kernel matrices
- Longest common subsequence between run-length-encoded strings: a new algorithm with improved parallelism
- On the similarity metric and the distance metric
- Repetitions in strings: algorithms and combinatorics
- Subsequence Combinatorics and Applications to Microarray Production, DNA Sequencing and Chaining Algorithms
Cited in
(21)- 10.1162/153244303322533197
- All fingers are not the same: handling variable-length sequences in a discriminative setting using conformal multi-instance kernels
- Hash kernels for structured data
- Machine Learning: ECML 2004
- Fast string kernels using inexact matching for protein sequences
- Quantifying sequential subsumption
- On using physico-chemical properties of amino acids in string kernels for protein classification via support vector machines
- 10.1162/153244302760200687
- Efficient geometric-based computation of the string subsequence kernel
- Kernels for sequentially ordered data
- Using local alignments for relation recognition
- Rational kernels: theory and algorithms
- Some alternatives to Parikh matrices using string kernels
- Graph-Based Representations in Pattern Recognition
- Maximum margin classifier working in a set of strings
- Efficient computation of gapped substring kernels on large alphabets
- Probability product kernels
- Modeling sequence evolution with kernel methods
- Kernel-based machine learning for fast text mining in R
- Learning state machine-based string edit kernels
- Fast kernels for inexact string matching.
This page was built for publication: Versatile string kernels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q391141)