Approximating Longest Common Substring with k mismatches: Theory and Practice
From MaRDI portal
Cited in
(2)
This page was built for publication: Approximating Longest Common Substring with k mismatches: Theory and Practice
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5874444)