@article{69d75d12393841f693243fcbf164adb7,
title = "Linear-time String Indexing and Analysis in Small Space",
keywords = "Compact data structures, compressed indexes, Burrows-Wheeler transform, suffix array, suffix tree, suffix-link tree, compressed suffix array, compressed suffix tree, bidirectional BWT index, partial rank query, monotone minimal perfect hash function, matching statistics, maximal repeat, maximal unique match, maximal exact match, minimal absent word, string kernel, BURROWS-WHEELER TRANSFORM, SUFFIX ARRAYS, SUCCINCT REPRESENTATIONS, CONSTRUCTION, RETRIEVAL, TREES, ALGORITHMS, STORAGE, SETS, 113 Computer and information sciences",
author = "Djamal Belazzougui and Fabio Cunial and Juha Karkkainen and Veli Makinen",
year = "2020",
month = mar,
doi = "10.1145/3381417",
language = "English",
volume = "16",
journal = "ACM Transactions on Algorithms",
issn = "1549-6325",
publisher = "ASSOC COMPUTING MACHINERY",
number = "2",
}