A Compressed Enhanced Suffix Array Supporting Fast String Matching
From MaRDI portal
Publication:3399127
DOI10.1007/978-3-642-03784-9_6zbMath1470.68040OpenAlexW1534681609MaRDI QIDQ3399127
Publication date: 29 September 2009
Published in: String Processing and Information Retrieval (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-03784-9_6
Related Items (8)
Algorithms to compute the Burrows-Wheeler similarity distribution ⋮ Bidirectional search in a string with wavelet trees and bidirectional matching statistics ⋮ Alphabet-independent algorithms for finding context-sensitive repeats in linear time ⋮ A simple linear-space data structure for constant-time range minimum query ⋮ Succincter Text Indexing with Wildcards ⋮ Combined data structure for previous- and next-smaller-values ⋮ Fast matching statistics in small space ⋮ Space-Efficient Parallel Construction of Succinct Representations of Suffix Tree Topologies
This page was built for publication: A Compressed Enhanced Suffix Array Supporting Fast String Matching
