Compact directed acyclic word graphs for a sliding window
DOI10.1016/S1570-8667(03)00064-9zbMATH Open1118.68755DBLPjournals/jda/InenagaSTA04OpenAlexW2074018443WikidataQ90345535 ScholiaQ90345535MaRDI QIDQ876704FDOQ876704
Authors: Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, S. Arikawa 
Publication date: 26 April 2007
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s1570-8667(03)00064-9
Recommendations
linear-time algorithmsliding windowauthor keywords: on-line text compressioncompact directed acyclic word graphs
Data structures (68P05) Nonnumerical algorithms (68W05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)
Cites Work
- Algorithms on Strings, Trees and Sequences
- Title not available (Why is that?)
- A Space-Economical Suffix Tree Construction Algorithm
- Title not available (Why is that?)
- On-line construction of suffix trees
- Title not available (Why is that?)
- Complete inverted files for efficient text retrieval and analysis
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (11)
- On the Structure of Consistent Partitions of Substring Set of a Word
- Sliding suffix tree
- On-line suffix tree construction with reduced branching
- Ternary directed acyclic word graphs
- Title not available (Why is that?)
- Compact morphic directed acyclic word graphs
- Weighted automata for full-text indexing
- On-line construction of compact directed acyclic word graphs
- Truncated suffix trees and their application to data compression.
- Compressed directed acyclic word graph with application in local alignment
- How much is that DAWG in the window? a moving window algorithm for the directed acyclic word graph
This page was built for publication: Compact directed acyclic word graphs for a sliding window
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q876704)
