Learning regular sets from queries and counterexamples
Information and Computation
Text algorithms
Approximate solution of NP optimization problems
Theoretical Computer Science
Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Machine Learning
Machine Learning
CPM '97 Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching
Discovering Repetitive Expressions and Affinities from Anthologies of Classical Japanese Poems
DS '01 Proceedings of the 4th International Conference on Discovery Science
Discovering instances of poetic allusion from anthologies of classical Japanese poems
Theoretical Computer Science
On the Resemblance and Containment of Documents
SEQUENCES '97 Proceedings of the Compression and Complexity of Sequences 1997
| Hi-index | 0.01 |
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 polynomial-time 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.