Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching

DOI10.1137/S0097539702402354zbMath1092.68115MaRDI QIDQ5470696

Roberto Grossi, Jeffrey Scott Vitter

Publication date: 1 June 2006

Published in: SIAM Journal on Computing (Search for Journal in Brave)

zbMATH Keywords

compression; pattern matching; suffix trees; compressed data structures; string searching; suffix arrays; text indexing; text retrieval

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68P10: Searching and sorting

68W05: Nonnumerical algorithms

68P30: Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science)

68P05: Data structures