CPM 2005 Combinatorial Pattern Matching
 |  |
Wall of Fame | Most Viewed CPM-2005 Paper
CPM
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. Approximate string matching is a fundamental and challenging problem in computer science, for which a fast algorithm is highly demanded in many applications including tex...
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 |  | 206 | ||
| 2 | | 194 | ||
| 3 | | 142 | ||
| 4 | | 125 | ||
| 5 | | 123 | ||
| 6 | | 116 | ||
| 7 | | 114 | ||
| 8 | | 109 | ||
| 9 | | 106 | ||
| 10 | | 105 | ||
| 11 | | 103 | ||
| 12 | | 101 | ||
| 13 | | 100 | ||
| 14 | | 97 | ||
| 15 | | 95 | ||
| 16 | | 92 | ||
| 17 | | 89 | ||
| 18 | | 87 | ||
| 19 | | 75 | ||
| 20 | | 70 |