Finding Optimal Pairs of Cooperative and Competing Patterns with Bounded Distance.
Discovery Science, 7th International Conference, DS 2004, Padova, Italy, October 2-5, 2004, Proceedings,
Lecture Notes in Computer Science Vol.3245, pp.32-46
(2004), [peer-reviewed]
Event Date:
October 2-5, 2004
Abstract / 概要
We consider the problem of discovering the optimal pair of substring patterns with bounded distance α, from a given set S of strings. We study two kinds of pattern classes, one is in form…