@inproceedings{a123cfd46f10415ead235a935bf44913,

title = "A practical algorithm to find the best episode patterns",

abstract = "Episode pattern is a generalized concept of subsequence pattern where the length of substring containing the subsequence is bounded. Given two sets of strings, consider an optimization problem to find a best episode pattern that is common to one set but not common in the other set. The problem is known to be NP-hard. We give a practical algorithm to solve it exactly.",

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

year = "2001",

month = jan,

day = "1",

doi = "10.1007/3-540-45650-3_37",

language = "English",

isbn = "9783540429562",

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

publisher = "Springer Verlag",

pages = "435--440",

editor = "Jantke, {Klaus P.} and Ayumi Shinohara",

booktitle = "Discovery Science - 4th International Conference, DS 2001, Proceedings",

address = "Germany",

note = "4th International Conference on Discovery Science, DS 2001 ; Conference date: 25-11-2001 Through 28-11-2001",

}