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

研究成果: Conference contribution

6 被引用数 (Scopus)

抄録

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.

本文言語English
ホスト出版物のタイトルAlgorithms and Computation - 22nd International Symposium, ISAAC 2011, Proceedings
ページ663-672
ページ数10
DOI
出版ステータスPublished - 2011
イベント22nd International Symposium on Algorithms and Computation, ISAAC 2011 - Yokohama, Japan
継続期間: 2011 12 52011 12 8

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
7074 LNCS
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

Other

Other22nd International Symposium on Algorithms and Computation, ISAAC 2011
国/地域Japan
CityYokohama
Period11/12/511/12/8

ASJC Scopus subject areas

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「A new algorithm for the characteristic string problem under loose similarity criteria」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル