Computing the longest common substring with one mismatch

Authors:
M. A. Babenko;T. A. Starikovskaya
Affiliations:
Chair of Mathematical Logic and Theory of Algorithms, Faculty of Mechanics and Mathematics, Lomonosov Moscow State University, Moscow, Russia;Chair of Mathematical Logic and Theory of Algorithms, Faculty of Mechanics and Mathematics, Lomonosov Moscow State University, Moscow, Russia
Venue:
Problems of Information Transmission
Year:
2011

Citing 2
Cited 0

Algorithms on strings, trees, and sequences: computer science and computational biology

Algorithms on strings, trees, and sequences: computer science and computational biology
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper describes an algorithm for computing longest common substrings of two strings 驴 1 and 驴 2 with one mismatch in O(|驴 1||驴 2|) time and O(|驴 1|) additional space. The algorithm always scans symbols of 驴 2 sequentially, starting from the first symbol. The RAM model of computation is used.