On-line construction of compact directed acyclic word graphs
type: Item
instance of: scholarly article
title: On-line construction of compact directed acyclic word graphs
zbMATH Open document ID: 1084.68137
author: Shunsuke Inenaga
author: Hiromasa Hoshino
author: Ayumi Shinohara
author: Masayuki Takeda
author: S. Arikawa
author: Giancarlo Mauri
author: Giulio Pavesi
published in: Discrete Applied Mathematics
publication date: 2005-02-22T00:00:00Z
Mathematics Subject Classification ID: 68W05
Mathematics Subject Classification ID: 05A05
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 68Q10
zbMATH DE Number: 2137017
zbMATH Keywords: Pattern matching on strings
zbMATH Keywords: Compact directed acyclic word graphs
zbMATH Keywords: Directed acyclic word graphs
zbMATH Keywords: Suffix trees
zbMATH Keywords: On-line and linear-time algorithms
MaRDI profile type: Publication
full work available at URL: j.dam.2004.04.012
OpenAlex ID: W2090957374
Wikidata QID: Q57518591
cites work: Q3690245
cites work: A speed-up for the commute between subword trees and DAWGs.
cites work: The smallest automaton recognizing the subwords of a text
cites work: Complete inverted files for efficient text retrieval and analysis
cites work: Q3690247
cites work: Transducers and repetitions
cites work: Reducing space for index implementation.
cites work: Q4849531
cites work: Jewels of Stringology
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: Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
cites work: Algorithms on Strings, Trees and Sequences
cites work: Approximate string matching using factor automata
cites work: Q4454549
cites work: Q4547748
cites work: Compact directed acyclic word graphs for a sliding window
cites work: Q4432981
cites work: Suffix Arrays: A New Method for On-Line String Searches
cites work: A Space-Economical Suffix Tree Construction Algorithm
cites work: Q4472515
cites work: Discovering characteristic expressions in literary works.
cites work: On-line construction of suffix trees
cites work: Approximate string matching with suffix automata
DOI: 10.1016/J.DAM.2004.04.012
description: scientific article; zbMATH DE number 2137017