Fast string kernels using inexact matching for protein sequences
From MaRDI portal
Recommendations
Cited in
(17)- Fast structural alignment of biomolecules using a hash table, n-grams and string descriptors
- Distance metric learning for graph structured data
- Optimal string clustering based on a Laplace-like mixture and EM algorithm on a set of strings
- The graph matching problem
- On using physico-chemical properties of amino acids in string kernels for protein classification via support vector machines
- Efficient computation of gapped substring kernels on large alphabets
- Versatile string kernels
- Kernels for sequentially ordered data
- All fingers are not the same: handling variable-length sequences in a discriminative setting using conformal multi-instance kernels
- Extended pairwise local alignment of wild card DNA/RNA sequences using dynamic programming
- Fast kernels for inexact string matching.
- Graph-Based Representations in Pattern Recognition
- Maximum margin classifier working in a set of strings
- Framework for kernel regularization with application to protein clustering
- A Class of New Kernels Based on High-Scored Pairs of k-Peptides for SVMs and Its Application for Prediction of Protein Subcellular Localization
- Machine Learning: ECML 2004
- Potential Functions for Signals and Symbolic Sequences
This page was built for publication: Fast string kernels using inexact matching for protein sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3093231)
