A note on the longest common substring with \(k\)-mismatches problem

DOI10.1016/J.IPL.2015.03.003zbMath1328.68329arXiv1409.7217OpenAlexW2024243150MaRDI QIDQ2345875

Szymon Grabowski

Publication date: 21 May 2015

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1409.7217

zbMATH Keywords

combinatorial problemsstring algorithmsword-level parallelismlongest common substring with \(k\)-mismatches

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Related Items (4)

Longest common substring with approximately \(k\) mismatches ⋮ Longest Common Factor After One Edit Operation ⋮ Locally Maximal Common Factors as a Tool for Efficient Dynamic String Algorithms. ⋮ Linear-Time Algorithm for Long LCF with k Mismatches

Cites Work

• Unnamed Item
• Computing the longest common substring with one mismatch
• Longest common substrings with \(k\) mismatches
• Approximate pattern matching with \(k\)-mismatches in packed text
• Dictionary matching and indexing with errors and don't cares
• Algorithms on Strings, Trees and Sequences

This page was built for publication: A note on the longest common substring with \(k\)-mismatches problem