Computing the longest common substring with one mismatch
From MaRDI portal
Publication:764249
DOI10.1134/S0032946011010030zbMath1232.68189MaRDI QIDQ764249
Maxim A. Babenko, Tatiana Starikovskaya
Publication date: 13 March 2012
Published in: Problems of Information Transmission (Search for Journal in Brave)
Related Items
Longest common substring with approximately \(k\) mismatches ⋮ Longest Common Factor After One Edit Operation ⋮ A note on the longest common substring with \(k\)-mismatches problem ⋮ Longest common substrings with \(k\) mismatches ⋮ Locally Maximal Common Factors as a Tool for Efficient Dynamic String Algorithms. ⋮ Linear-Time Algorithm for Long LCF with k Mismatches
Cites Work