Best fitting fixed-length substring patterns for a set of strings

Hirotaka Ono, Yen Kaow Ng

Research output: Contribution to journalConference articlepeer-review

3 Citations (Scopus)

Abstract

Finding a pattern, or a set of patterns that best characterizes a set of strings is considered important in the context of Knowledge Discovery as applied in Molecular Biology. Our main objective is to address the problem of "over-generalization", which is the phenomenon that a characterization is so general that it potentially includes many incorrect examples. To overcome this we formally define a criteria for a most fitting language for a set of strings, via a natural notion of density. We show how the problem can be solved by solving the membership problem and counting problem, and we study the runtime complexities of the problem with respect to three solution spaces derived from unions of the languages generated from fixed-length substring patterns. Two of these we show to be solvable in time polynomial to the input size. In the third case, however, the problem turns out to be NP-complete.

Original languageEnglish
Pages (from-to)240-250
Number of pages11
JournalLecture Notes in Computer Science
Volume3595
Publication statusPublished - Oct 24 2005
Event11th Annual International Conference on Computing and Combinatorics, COCOON 2005 - Kunming, China
Duration: Aug 16 2005Aug 29 2005

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Best fitting fixed-length substring patterns for a set of strings'. Together they form a unique fingerprint.

Cite this