Name
Abstract | ||
|---|---|---|
We use a simple observation about the locations of critical factorizations to derive a real-time variation of the Crochemore-Perrin constant-space string matching algorithm. The real-time variation has a simple and efficient control structure. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1007/978-3-642-21458-5_16 | CPM |
Field | DocType | Volume |
String searching algorithm,Discrete mathematics,Combinatorics,Commentz-Walter algorithm,Computer science,Approximate string matching,String metric,Time constant | Conference | 6661 |
ISSN | Citations | PageRank |
0302-9743 | 16 | 0.75 |
References | Authors | |
23 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dany Breslauer | 1 | 346 | 26.19 |
| Roberto Grossi | 2 | 581 | 57.47 |
| Filippo Mignosi | 3 | 569 | 99.71 |