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

Hideaki Hori, Shinichi Shimozono, Masayuki Takeda, Ayumi Shinohara

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

5 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationAlgorithms and Computation - 12th International Symposium, ISAAC 2001, Proceedings
Pages719-730
Number of pages12
DOIs
Publication statusPublished - Dec 1 2001
Event12th International Symposium on Algorithms and Computation, ISAAC 2001 - Christchurch, New Zealand
Duration: Dec 19 2001Dec 21 2001

Publication series

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

Other

Other12th International Symposium on Algorithms and Computation, ISAAC 2001
CountryNew Zealand
CityChristchurch
Period12/19/0112/21/01

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Fragmentary pattern matching: Complexity, algorithms and applications for analyzing classic literary works'. Together they form a unique fingerprint.

  • Cite this

    Hori, H., Shimozono, S., Takeda, M., & Shinohara, A. (2001). Fragmentary pattern matching: Complexity, algorithms and applications for analyzing classic literary works. In Algorithms and Computation - 12th International Symposium, ISAAC 2001, Proceedings (pp. 719-730). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2223 LNCS). https://doi.org/10.1007/3-540-45678-3_61