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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationAlgorithms and Computation - 22nd International Symposium, ISAAC 2011, Proceedings
Pages663-672
Number of pages10
DOIs
Publication statusPublished - 2011
Event22nd International Symposium on Algorithms and Computation, ISAAC 2011 - Yokohama, Japan
Duration: 2011 Dec 52011 Dec 8

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7074 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other22nd International Symposium on Algorithms and Computation, ISAAC 2011
Country/TerritoryJapan
CityYokohama
Period11/12/511/12/8

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint

Dive into the research topics of 'A new algorithm for the characteristic string problem under loose similarity criteria'. Together they form a unique fingerprint.

Cite this