Substring search and repeat search using factor oracles

Substring search and repeat search using factor oracles

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.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Information processing letters 2005, Vol.93 (6), p.269-274
Hauptverfasser: Kato, Ryoichi, Watanabe, Osamu
Format: Artikel
Sprache:eng
Schlagworte:
Algorithmics. Computability. Computer arithmetics
Algorithms
Applied sciences
Automata. Abstract machines. Turing machines
Automation
Automaton
Computer science
control theory
systems
Exact sciences and technology
Full text
Mathematical analysis
Repetition search
Searches
Studies
Substring search
Suffix-trees
Theoretical computing
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:0020-0190
1872-6119
DOI:10.1016/j.ipl.2004.11.011