Fragmentary Pattern Matching: Complexity, Algorithms and Applications for Analyzing Classic Literary Works.
Algorithms and Computation, 12th International Symposium, ISAAC 2001, Christchurch, New Zealand, December 19-21, 2001, Proceedings,
Lecture Notes in Computer Science Vol.2223, pp.719-730
(2001), [peer-reviewed]
Event Date:
December 19-21, 2001
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…