TY - GEN

T1 - A new algorithm for the characteristic string problem under loose similarity criteria

AU - Sakai, Yoshifumi

PY - 2011

Y1 - 2011

N2 - Given two strings S and T, together with an integer representing the similarity bound, the characteristic string problem consists in finding the shortest substrings of T such that S has no substrings similar to them, in the sense that one string is similar to another if the amount of 'dissimilarities' between them is less than or equal to the similarity bound. Under the similarity criterion that uses Levenshtain distance to measure the amount of dissimilarities between two strings, this problem is known to be solvable in cubic time and linear space. The present article proposes a new algorithm for this problem that performs in almost quadratic time and almost linear space, under a certain class of similarity criteria, including the similarity criterion based on Levenshtain distance.

AB - Given two strings S and T, together with an integer representing the similarity bound, the characteristic string problem consists in finding the shortest substrings of T such that S has no substrings similar to them, in the sense that one string is similar to another if the amount of 'dissimilarities' between them is less than or equal to the similarity bound. Under the similarity criterion that uses Levenshtain distance to measure the amount of dissimilarities between two strings, this problem is known to be solvable in cubic time and linear space. The present article proposes a new algorithm for this problem that performs in almost quadratic time and almost linear space, under a certain class of similarity criteria, including the similarity criterion based on Levenshtain distance.

UR - http://www.scopus.com/inward/record.url?scp=84055190792&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84055190792&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-25591-5_68

DO - 10.1007/978-3-642-25591-5_68

M3 - Conference contribution

AN - SCOPUS:84055190792

SN - 9783642255908

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 663

EP - 672

BT - Algorithms and Computation - 22nd International Symposium, ISAAC 2011, Proceedings

T2 - 22nd International Symposium on Algorithms and Computation, ISAAC 2011

Y2 - 5 December 2011 through 8 December 2011

ER -