Computing the longest common substring with one mismatch

DOI10.1134/S0032946011010030MaRDI QIDQ764249zbMATH OpenFDO

Authors Maxim Babenko, Tatiana Starikovskaya

Publication date 13 March 2012

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

Full work available at URL https://doi.org/10.1134/S0032946011010030

zbMATH Keywords

longest common substringmismatchstringology

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

(9)

• Dynamic and internal longest common substring
• A note on the longest common substring with k-mismatches problem
• Longest common substrings with k mismatches
• Longest common substring with approximately \(k\) mismatches
• Locally maximal common factors as a tool for efficient dynamic string algorithms
• Linear-time algorithm for long LCF with k mismatches
• Longest common factor after one edit operation
• Longest common substring with approximately \(k\) mismatches
• Longest common substring with gaps and related problems

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)