Abstract
The recently introduced longest common substring with k-mismatches (k-LCF) problem is to find, given two sequences S1 and S2 of length n each, a longest substring A1 of S1 and A2 of S2 such that the Hamming distance between A1 and A2 is at most k. So far, the only subquadratic time result for this problem was known for k=1[5]. We present two output-dependent algorithms solving the k-LCF problem and show that for k=O(log1−εn), where ε>0, at least one of them works in subquadratic time, using O(n) words of space. The choice of one of these two algorithms to be applied for a given input can be done after linear time and space preprocessing.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
