Keywords (1)

Academic
Publications
Computing the longest common substring with one mismatch

Computing the longest common substring with one mismatch,10.1134/S0032946011010030,Problems of Information Transmission,M. A. Babenko,T. A. Starikovsk

Computing the longest common substring with one mismatch  
BibTex | RIS | RefWorks Download
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.
Journal: Problems of Information Transmission - PROBL INF TRANSM , vol. 47, no. 1, pp. 28-33, 2011
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.