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

DOI10.1080/00207160214653zbMATH Open1052.68107OpenAlexW2042821342MaRDI QIDQ4792964FDOQ4792964

Authors: A. 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

Recommendations

• scientific article; zbMATH DE number 2105041
• Computing the repetitions in a biological weighted sequence
• Optimal bounds for computing \({\alpha}\)-gapped repeats
• Optimal bounds for computing \(\alpha\)-gapped repeats
• Characterizing the reconstruction and enumerating the patterns of DNA sequences with re\-peats
• Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis.
• A parallel algorithm for pattern discovery in biological sequences
• Approximation Algorithms for Reconstructing the Duplication History of Tandem Repeats

zbMATH Keywords

string algorithmsrepetitionssuffix link

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Cites Work

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

Cited In (4)

• COMBINATORIAL CHARACTERIZATION OF THE LANGUAGE RECOGNIZED BY FACTOR AND SUFFIX ORACLES
• Title not available (Why is that?)
• THE STRUCTURE OF FACTOR ORACLES
• A sublinear time string prefix square detection algorithm

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4792964)