Versatile string kernels

DOI10.1016/j.tcs.2013.06.006zbMath1294.68167OpenAlexW2115273993MaRDI QIDQ391141

Cees H. Elzinga, Hui Wang

Publication date: 10 January 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2013.06.006

zbMATH Keywords

string matchingrun-length encodinggap-penalizingpartial rankingssoft matchingstring kernelsubsequences

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Algorithms on strings (68W32)

Related Items

Quantifying sequential subsumption

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Concordance and consensus
• Combinatorial representations of token sequences
• Computing distances between partial rankings
• On the similarity metric and the distance metric
• Repetitions in strings: algorithms and combinatorics
• Dealing with large diagonals in kernel matrices
• Algorithms for subsequence combinatorics
• Aggregation of partial rankings, \(p\)-ratings and top-\(m\) lists
• Longest common subsequence between run-length-encoded strings: a new algorithm with improved parallelism
• Algorithms on Strings, Trees and Sequences
• A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices
• 10.1162/153244302760200687
• Subsequence Combinatorics and Applications to Microarray Production, DNA Sequencing and Chaining Algorithms
• Comparing Partial Rankings

This page was built for publication: Versatile string kernels