Reducing space for index implementation.
type: Item
instance of: scholarly article
title: Reducing space for index implementation.
zbMATH Open document ID: 1063.68046
DOI: 10.1016/S0304-3975(01)00222-5
author: Maxime Crochemore
published in: Theoretical Computer Science
publication date: 2003-01-22T00:00:00Z
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68T10
zbMATH DE Number: 1857218
zbMATH Keywords: Data retrieval
zbMATH Keywords: Suffix tree
zbMATH Keywords: Suffix automaton
zbMATH Keywords: DAWG
zbMATH Keywords: Suffix oracle
zbMATH Keywords: Index
zbMATH Keywords: Text compression
zbMATH Keywords: Pattern matching
Wikidata QID: Q61677954
MaRDI profile type: Publication
cites work: Efficient string matching
cites work: Minimal forbidden words and symbolic dynamics
cites work: Q3859267
cites work: The smallest automaton recognizing the subwords of a text
cites work: Average sizes of suffix trees and DAWGs
cites work: Transducers and repetitions
cites work: Automata and forbidden words
cites work: Structures in logic and computer science. A selection of essays in honor of Andrzej Ehrenfeucht (65th birthday on August 8, 1997)
cites work: Q4234120
cites work: Algorithms on Strings, Trees and Sequences
cites work: Q2723961
cites work: Suffix Arrays: A New Method for On-Line String Searches
cites work: A Space-Economical Suffix Tree Construction Algorithm
cites work: Q4138196
cites work: Q3024796
cites work: On-line construction of suffix trees
cites work: A universal algorithm for sequential data compression
full work available at URL: s0304-3975(01)00222-5
OpenAlex ID: W2007572846
description: scientific article; zbMATH DE number 1857218