Sciweavers

174
Voted
DIS
2004
Springer
16 years 11 days ago
Finding Optimal Pairs of Cooperative and Competing Patterns with Bounded Distance
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...
Shunsuke Inenaga, Hideo Bannai, Heikki Hyyrö,...