VOLUME 8 2003 NUMBER 4

Computing all Repeats Using Suffix Arrays
František Franěk, William F. Smyth, Yudong Tang
Pages 579–591





Download Abstract
Fulltext is accessible with your personal account
ShowHide BibTeX
BibTeX:
@article{JALC-2003-579,
  author  = {Franti{\v{s}}ek Fran{\v{e}}k and William F. Smyth and Yudong Tang},
  title   = {Computing all Repeats Using Suffix Arrays},
  journal = {Journal of Automata, Languages and Combinatorics},
  volume  = {8},
  number  = {4},
  pages   = {579--591},
  year    = {2003},
  url     = {https://doi.org/10.25596/jalc-2003-579},
  doi     = {10.25596/jalc-2003-579}
}
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: repeats, suffix arrays, string algorithms, substring
DOI: 10.25596/jalc-2003-579