General suffix automaton construction algorithm and space bounds
type: Item
instance of: scholarly article
title: General suffix automaton construction algorithm and space bounds
zbMATH Open document ID: 1194.68143
author: Mehryar Mohri
author: Pedro Moreno
author: Eugene Weinstein
published in: Theoretical Computer Science
publication date: 2009-09-14T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68W05
zbMATH DE Number: 5603656
zbMATH Keywords: string-matching
zbMATH Keywords: pattern-matching
zbMATH Keywords: indexing
zbMATH Keywords: inverted text
zbMATH Keywords: finite automata
zbMATH Keywords: suffix trees
zbMATH Keywords: suffix automata
zbMATH Keywords: factor automata
zbMATH Keywords: music identification
Wikidata QID: Q90410808
MaRDI profile type: Publication
full work available at URL: j.tcs.2009.03.034
OpenAlex ID: W2119425792
cites work: Algorithms on Strings, Trees and Sequences
cites work: Jewels of Stringology
cites work: The smallest automaton recognizing the subwords of a text
cites work: Transducers and repetitions
cites work: Complete inverted files for efficient text retrieval and analysis
cites work: On-line construction of compact directed acyclic word graphs
cites work: Q4552402
cites work: Minimisation of acyclic deterministic automata in linear time
DOI: 10.1016/J.TCS.2009.03.034
description: scientific article; zbMATH DE number 5603656