An improved algorithm for finding longest repeats with a modified factor oracle

Authors:
Arnaud Lefebvre;Thierry Lecroq;Joël Alexandre
Affiliations:
UMR 6037 - ABISS, Université de Rouen, 76821 Mont-Saint-Aignan Cedex, France;LIFAR - ABISS, Université de Rouen, 76821 Mont-Saint-Aignan Cedex, France;UMR 6037 - ABISS, Université de Rouen, 76821 Mont-Saint-Aignan Cedex, France
Venue:
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the 13th Australasian workshop on combinatorial algorithms
Year:
2003

Citing 3
Cited 1

Algorithms on strings, trees, and sequences: computer science and computational biology

Algorithms on strings, trees, and sequences: computer science and computational biology
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

Factor oracles

CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata

Quantified Score

Hi-index	0.00

Visualization

Abstract

We first give some experimental evidences of the difference rate on the length of the repeats of a string p found using the factor oracle of p. We show then how to improve the length of the repeats. Examples of improvements are given for finding repeats in genomic sequences and using repeats for data compression.