Ternary directed acyclic word graphs
From MaRDI portal
Publication:703500
DOI10.1016/J.TCS.2004.07.008zbMATH Open1071.68048OpenAlexW2154517803MaRDI QIDQ703500FDOQ703500
Authors: Satoru Miyamoto, Shunsuke Inenaga, Masayuki Takeda, Ayumi Shinohara
Publication date: 11 January 2005
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2004.07.008
Recommendations
- Ternary directed acyclic word graphs
- Compact morphic directed acyclic word graphs
- Implementation of directed acyclic word graph.
- Combinatorial Pattern Matching
- Structural properties of word representable graphs
- Compact directed acyclic word graphs for a sliding window
- Acyclic digraphs
- Trie structure for graph sequences
AVL treesDeterministic finite state automataDirected acyclic word graphsPattern matching on stringsTernary search trees
Cites Work
- Algorithms on Strings, Trees and Sequences
- Title not available (Why is that?)
- Jewels of Stringology
- A Space-Economical Suffix Tree Construction Algorithm
- Title not available (Why is that?)
- The smallest automaton recognizing the subwords of a text
- On-line construction of suffix trees
- Title not available (Why is that?)
- Transducers and repetitions
- Complete inverted files for efficient text retrieval and analysis
- Minimisation of acyclic deterministic automata in linear time
- Approximate string matching with suffix automata
Cited In (6)
This page was built for publication: Ternary directed acyclic word graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q703500)