抄録
We consider a fully compressed pattern matching problem, where both text T and pattern P are given by its succinct representation, in terms of straight-line programs and its variant. The length of the text T and pattern P may grow exponentially with respect to its description size n and m, respectively. The best known algorithm for the problems runs in O(n2m2) time using O(nm) space. The authors introduce a variant of straight-line programs, called balanced straight-line programs so that we establish a faster fully compressed pattern matching algorithm. Although the compression ratio of balanced straight-line programs may be worse than the original straight-line programs, they can still express exponentially long strings. Our algorithm runs in O(nm) time using O(nm) space.
| 本文言語 | 英語 |
|---|---|
| ホスト出版物のタイトル | Proceedings - 7th International Symposium on String Processing and Information Retrieval, SPIRE 2000 |
| 出版社 | Institute of Electrical and Electronics Engineers Inc. |
| ページ | 132-138 |
| ページ数 | 7 |
| ISBN（電子版） | 0769507468, 9780769507460 |
| DOI | |
| 出版ステータス | 出版済み - 2000 |
| イベント | 7th International Symposium on String Processing and Information Retrieval, SPIRE 2000 - A Curuna, スペイン 継続期間: 9 27 2000 → 9 29 2000 |
その他
| その他 | 7th International Symposium on String Processing and Information Retrieval, SPIRE 2000 |
|---|---|
| Country | スペイン |
| City | A Curuna |
| Period | 9/27/00 → 9/29/00 |
All Science Journal Classification (ASJC) codes
- Information Systems
- Signal Processing
- Information Systems and Management