VOLUME 8 2003 NUMBER 4

An Improved Algorithm for Finding Longest Repeats with a Modified Factor Oracle
Arnaud Lefebvre, Thierry Lecroq, Joël Alexandre
Pages 647–657





Download Abstract
Fulltext is accessible with your personal account
ShowHide BibTeX
BibTeX:
@article{JALC-2003-647,
  author  = {Arnaud Lefebvre and Thierry Lecroq and Jo{\"{e}}l Alexandre},
  title   = {An Improved Algorithm for Finding Longest Repeats with a Modified Factor Oracle},
  journal = {Journal of Automata, Languages and Combinatorics},
  volume  = {8},
  number  = {4},
  pages   = {647--657},
  year    = {2003},
  url     = {https://doi.org/10.25596/jalc-2003-647},
  doi     = {10.25596/jalc-2003-647}
}
If you would like to see an embedded preview, try to select preview as the action for Portable Document Format (PDF) in your brower settings.
Keywords: string algorithms, computational biology, factor oracle, repetitions, data compression
DOI: 10.25596/jalc-2003-647