CPM 1998 Combinatorial Pattern Matching
 |  |
Wall of Fame | Most Viewed CPM-1998 Paper
CPM
1998
Springer
13 years 8 months ago
1998
Springer
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
Disclaimer and Copyright Notice
Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website.
Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
| Id | Read | Views | Title | Status |
|---|---|---|---|---|
| 1 |  | 209 | ||
| 2 | | 132 | ||
| 3 | | 115 | ||
| 4 | | 84 |