Substring search and repeat search using factor oracles

Authors:
Ryoichi Kato;Osamu Watanabe
Affiliations:
Tokyo Institute of Technology, Department of Mathematical and Computing Science, Meguro-ku, Ookayama 2-12-1 W8-25,Tokyo 152-8552, Japan;Tokyo Institute of Technology, Department of Mathematical and Computing Science, Meguro-ku, Ookayama 2-12-1 W8-25,Tokyo 152-8552, Japan
Venue:
Information Processing Letters
Year:
2005

Citing 3
Cited 1

Compror: on-line lossless data compression with a factor oracle

Information Processing Letters
Factor Oracle: A New Structure for Pattern Matching

SOFSEM '99 Proceedings of the 26th Conference on Current Trends in Theory and Practice of Informatics on Theory and Practice of Informatics
Efficient Experimental String Matching by Weak Factor Recognition

CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching

Converting suffix trees into factor/suffix oracles

Journal of Discrete Algorithms

Quantified Score

Hi-index	0.89

Visualization

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.