@inbook{a35cd9c9e79144e78144a55421aee552,

title = "Finding best patterns practically",

abstract = "Finding a pattern which separates two sets is a critical task in discovery. Given two sets of strings, consider the problem to find a subsequence that is common to one set but never appears in the other set. The problem is known to be NP-complete. Episode pattern is a generalized concept of subsequence pattern where the length of substring containing the subsequence is bounded. We generalize these problems to optimization problems, and give practical algorithms to solve them exactly. Our algorithms utilize some pruning heuristics based on the combinatorial properties of strings, and efficient data structures which recognize subsequence and episode patterns.",

author = "Ayumi Shinohara and Masayuki Takeda and Setsuo Arikawa and Masahiro Hirao and Hiromasa Hoshino and Shunsuke Inenaga",

year = "2002",

month = jan,

day = "1",

doi = "10.1007/3-540-45884-0_21",

language = "English",

isbn = "3540433384",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "307--317",

booktitle = "Progress in Discovery Science",

}