Name
Abstract | ||
|---|---|---|
Here we consider computational problems on -approximate and (; )-approximate string matching. These are two new notions of approximate matching that arise naturally in applications of computer assisted music analysis. We present fast, efficient and practical algorithms for these two notions of approximate string matching. |
Year | Venue | Keywords |
|---|---|---|
2001 | Stringology | music analysis,approximate string matching |
Field | DocType | Citations |
String searching algorithm,Combinatorics,Computational problem,Music theory,Commentz-Walter algorithm,Computer science,Approximate string matching,3-dimensional matching,String metric,Bitap algorithm | Conference | 9 |
PageRank | References | Authors |
0.69 | 6 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Maxime Crochemore | 1 | 2655 | 281.75 |
| Costas S. Iliopoulos | 2 | 1534 | 167.43 |
| Thierry Lecroq | 3 | 662 | 58.52 |
| Yoan J. Pinzon | 4 | 158 | 16.81 |