Fragmentary pattern matching: Complexity, algorithms and applications for analyzing classic literary works

Hideaki Hori, Shinichi Shimozono, Masayuki Takeda, Ayumi Shinohara

研究成果: Chapter in Book/Report/Conference proceedingConference contribution

5 被引用数 (Scopus)

抄録

A fragmentary pattern is a multiset of non-empty strings, and it matches a string w if all the strings in it occur within w without any overlaps. We study some fundamental issues on computational complexity related to the matching of fragmentary patterns. We show that the fragmentary pattern matching problem is NP-complete, and the problem to find a fragmentary pattern common to two strings that maximizes the pattern score is NP-hard. Moreover, we propose a polynomialtime approximation algorithm for the fragmentary pattern matching, and show that it achieves a constant worst-case approximation ratio if either the strings in a pattern have the same length, or the importance weights of strings in a pattern are proportional to their lengths.

本文言語英語
ホスト出版物のタイトルAlgorithms and Computation - 12th International Symposium, ISAAC 2001, Proceedings
ページ719-730
ページ数12
DOI
出版ステータス出版済み - 12 1 2001
イベント12th International Symposium on Algorithms and Computation, ISAAC 2001 - Christchurch, ニュージ―ランド
継続期間: 12 19 200112 21 2001

出版物シリーズ

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

その他

その他12th International Symposium on Algorithms and Computation, ISAAC 2001
Countryニュージ―ランド
CityChristchurch
Period12/19/0112/21/01

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

フィンガープリント 「Fragmentary pattern matching: Complexity, algorithms and applications for analyzing classic literary works」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル