Fast kernels for inexact string matching.

DOI10.1007/B12006MaRDI QIDQ5305845zbMATH OpenOpenAlexFDO

Authors C. Leslie, Rui Kuang

Publication date 23 March 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b12006

zbMATH Keywords

computational biologykernel methodsstring kernels

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Algorithms on strings (68W32) Computational methods for problems pertaining to biology (92-08) Protein sequences, DNA sequences (92D20)

Recommendations

• Fast string kernels using inexact matching for protein sequences
• Versatile string kernels
• Efficient computation of gapped substring kernels on large alphabets
• Lambda pruning: an approximation of the string subsequence kernel for practical SVM classification and redundancy clustering

Cited in

(12)

• Optimization approaches to supervised classification
• Modeling sequence evolution with kernel methods
• On using physico-chemical properties of amino acids in string kernels for protein classification via support vector machines
• Fast string kernels using inexact matching for protein sequences
• Efficient computation of gapped substring kernels on large alphabets
• Versatile string kernels
• 10.1162/153244303322533197
• 10.1162/153244302760200687
• All fingers are not the same: handling variable-length sequences in a discriminative setting using conformal multi-instance kernels
• Maximum margin classifier working in a set of strings
• Machine Learning: ECML 2004
• Modelling phylogeny in 16s rRNA gene sequencing datasets using string-based kernels

This page was built for publication: Fast kernels for inexact string matching.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5305845)