| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10331422 | Information Processing Letters | 2005 | 6 Pages |
Abstract
We present some simple but useful properties of factor oracles, and propose fast algorithms for indexed full-text search and finding repeated substrings. Some experiments are given to demonstrate the performance of our algorithms.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Ryoichi Kato, Osamu Watanabe,