Name
Abstract | ||
|---|---|---|
We present O(n logm) algorithms for a new class of problems termed self-normalised distance with don't cares. The input is a pattern p of length m and text t of length n m. The elements of these strings are either integers or wild card symbols. In the shift version, the problem is to compute minaα Σj=0m-1 (α + pj - ti+j)2 for all i, where wild cards do not contribute to the sum. In the shift-scale version, the objective is to compute minα,β Σj=0m-1 (α + βpj - ti+j)2 for all i, similarly. We show that the algorithms have the additional benefit of providing simple O(n logm) solutions for the problems of exact matching with don't cares, exact shift matching with don't cares and exact shift-scale matching with don't cares. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1007/978-3-540-73437-6_9 | CPM |
Keywords | Field | DocType |
simple o,shift-scale version,exact shift-scale,exact shift,length n m,shift version,wild card,n logm,self-normalised distance,length m,exact matching,pattern matching | Integer,Discrete mathematics,Combinatorics,Pattern matching,Mathematics | Conference |
Volume | ISSN | ISBN |
4580 | 0302-9743 | 3-540-73436-8 |
Citations | PageRank | References |
6 | 0.52 | 11 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Peter Clifford | 1 | 42 | 2.68 |
| Raphaël Clifford | 2 | 268 | 28.57 |