Index Terms
- Preface
Recommendations
A graph approach to the threshold all-against-all substring matching problem
We present a novel graph model and an efficient algorithm for solving the “threshold all against all” problem, which involves searching two strings (with length M and N, respectively) for all maximal approximate substring matches of length at least S, ...
Comments