Efficient List-Based Computation of the String Subsequence Kernel
From MaRDI portal
(Redirected from Publication:5404907)
Recommendations
- Efficient geometric-based computation of the string subsequence kernel
- Efficient computation of gapped substring kernels on large alphabets
- Efficient Computation of Substring Equivalence Classes with Suffix Arrays
- Efficient computation of substring equivalence classes with suffix arrays
- Efficient algorithms for the longest common subsequence in \(k\)-length substrings
- Faster subsequence recognition in compressed strings
Cited in
(2)
This page was built for publication: Efficient List-Based Computation of the String Subsequence Kernel
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5404907)