Computing the longest common substring with one mismatch

DOI10.1134/S0032946011010030zbMATH Open1232.68189MaRDI QIDQ764249FDOQ764249

Authors: Maxim Babenko, Tatiana Starikovskaya 

Publication date: 13 March 2012

Published in: Problems of Information Transmission (Search for Journal in Brave)

Recommendations

• Longest common substrings with \(k\) mismatches
• Longest common substring with approximately \(k\) mismatches
• Longest common substring with approximately \(k\) mismatches
• A note on the longest common substring with \(k\)-mismatches problem
• Longest common prefix with mismatches

zbMATH Keywords

stringologylongest common substringmismatch

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Cites Work

• On-line construction of suffix trees

Cited In (7)

• Locally Maximal Common Factors as a Tool for Efficient Dynamic String Algorithms.
• Longest Common Factor After One Edit Operation
• A note on the longest common substring with \(k\)-mismatches problem
• Longest common substring with approximately \(k\) mismatches
• Dynamic and internal longest common substring
• Longest common substrings with \(k\) mismatches
• Linear-Time Algorithm for Long LCF with k Mismatches

This page was built for publication: Computing the longest common substring with one mismatch

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q764249)