A theoretical and experimental study on the construction of suffix arrays in external memory
From MaRDI portal
Publication:5956830
DOI10.1007/s00453-001-0051-5zbMath0995.68032MaRDI QIDQ5956830
Publication date: 28 February 2002
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11858/00-001M-0000-0014-6F9B-2
Related Items
Faster Compressed Suffix Trees for Repetitive Collections, Linearized suffix tree: An efficient index data structure with the capabilities of suffix trees and suffix arrays, Engineering a lightweight external memory suffix array construction algorithm, Lightweight data indexing and compression in external memory, Fast BWT in small space by blockwise suffix sorting
Uses Software