Optimal in‐place suffix sorting
The suffix array is a fundamental data structure for many applications that involve string searching and data compression. Designing time/space-efficient suffix array construction algorithms has attracted significant attention and considerable advances have been made for the past 20 years. We obtain...
Saved in:
Main Authors: | LI, Zhize, LI, Jian, HUO, Hongwei |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2022
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/8690 https://ink.library.smu.edu.sg/context/sis_research/article/9693/viewcontent/IANDC22_suffixsorting.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Optimal in-place suffix sorting
by: LI, Zhize, et al.
Published: (2018) -
String matching and indexing with suffix data structures
by: WONG SWEE SEONG
Published: (2010) -
Breaking a time-and-space barrier in constructing full-text indices
by: Hon, W.-K., et al.
Published: (2013) -
Homologous synteny block detection based on suffix tree algorithms
by: Chen, Y.-L., et al.
Published: (2014) -
A study of Taiwanese suffix -a53: An integrated autosegmental analysis
by: Lin, Ping-yu
Published: (2006)