A Heuristic For Computing Repeats With A Factor Oracle: Application To Biological Sequences

DOI10.1080/00207160214653zbMath1052.68107OpenAlexW2042821342MaRDI QIDQ4792964

Arnaud Lefebvre, Thierry Lecroq

Publication date: 2002

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160214653

zbMATH Keywords

string algorithmsrepetitionssuffix link

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (3)

THE STRUCTURE OF FACTOR ORACLES ⋮ COMBINATORIAL CHARACTERIZATION OF THE LANGUAGE RECOGNIZED BY FACTOR AND SUFFIX ORACLES ⋮ A sublinear time string prefix square detection algorithm

Cites Work

• The smallest automaton recognizing the subwords of a text
• Repetitive perhaps, but certainly not boring
• Transducers and repetitions
• A fast string searching algorithm
• A Correct Preprocessing Algorithm for Boyer–Moore String-Searching
• Fast Pattern Matching in Strings
• A universal algorithm for sequential data compression
• Compression of individual sequences via variable-rate coding

This page was built for publication: A Heuristic For Computing Repeats With A Factor Oracle: Application To Biological Sequences