VOLUME 8 2003 NUMBER 4

Computing Quasi Suffix Arrays
František Franěk, Jan Holub, William F. Smyth, Xiangdong Xiao
Pages 593–606





Download Abstract
Fulltext is accessible with your personal account
ShowHide BibTeX
BibTeX:
@article{JALC-2003-593,
  author  = {Franti{\v{s}}ek Fran{\v{e}}k and Jan Holub and William F. Smyth and Xiangdong Xiao},
  title   = {Computing Quasi Suffix Arrays},
  journal = {Journal of Automata, Languages and Combinatorics},
  volume  = {8},
  number  = {4},
  pages   = {593--606},
  year    = {2003},
  url     = {https://doi.org/10.25596/jalc-2003-593},
  doi     = {10.25596/jalc-2003-593}
}
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: quasi suffix arrays, pattern matching, suffix trees, string algorithms
DOI: 10.25596/jalc-2003-593