A suffix tree or not a suffix tree?

Tatiana A. Starikovskaya; Hjalte Wedel Vildhøj

doi:10.1016/j.jda.2015.01.005

A suffix tree or not a suffix tree?

Tatiana A. Starikovskaya
, Hjalte Wedel Vildhøj

Algorithms and Complexity

Research output: Contribution to journal › Article (Academic Journal) › peer-review

19 Citations (Scopus)

418 Downloads (Pure)

Original language	English
Pages (from-to)	14-23
Number of pages	10
Journal	Journal of Discrete Algorithms
Volume	32
Early online date	19 Jan 2015
DOIs	https://doi.org/10.1016/j.jda.2015.01.005
Publication status	Published - May 2015

Keywords

Reverse engineering
Suffix trees
Suffix links
Suffix tour graphs

Access to Document

10.1016/j.jda.2015.01.005

main_journalAccepted author manuscript, 318 KB

http://dx.doi.org/10.1016/j.jda.2015.01.005

Handle.net

Persistent link

Cite this

@article{b20748a52f884812a78b66effe50375c,

title = "A suffix tree or not a suffix tree?",

keywords = "Reverse engineering, Suffix trees, Suffix links, Suffix tour graphs",

author = "Starikovskaya, \{Tatiana A.\} and Vildh{\o}j, \{Hjalte Wedel\}",

year = "2015",

month = may,

doi = "10.1016/j.jda.2015.01.005",

language = "English",

volume = "32",

pages = "14--23",

journal = "Journal of Discrete Algorithms",