Computing the longest common substring with one mismatch

DOI10.1134/S0032946011010030MaRDI QIDQ764249zbMATHFDO

Authors Maxim Babenko, Tatiana Starikovskaya

Publication date 13 March 2012

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

zbMATH Keywords

stringologylongest common substringmismatch

Mathematics Subject Classification ID

Algorithms on strings (68W32)

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

Cites work

• On-line construction of suffix trees

Cited in

(8)

• Longest common substrings with \(k\) mismatches
• 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
• Dynamic and internal longest common substring
• Longest common substring with approximately \(k\) mismatches
• Linear-time algorithm for long LCF with \(k\) mismatches
• Longest common substring with approximately \(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)