Optimal insertion in deterministic DAWGs-Reference-Cited by-同舟云学术

Optimal insertion in deterministic DAWGs

Published:2003-05 Issue:1-3 Volume:301 Page:103-117
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Sgarbas Kyriakos N.,Fakotakis Nikos D.,Kokkinakis George K.

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference23 articles.

1. The Design and Analysis of Computer Algorithms;Aho,1974

2. Compilers: Principles, Techniques and Tools;Aho,1988

3. J. Aoe, K. Morimoto, M. Hase, An algorithm for compressing common suffixes used in trie structures, Systems and Computers in Japan, 24(12) (1993) 31–42 (translated from Trans. IEICE J75-D-II(4) (1992) 770–779).

4. A trie compaction algorithm for a large set of keys;Aoe;IEEE Trans. Knowledge Data Eng.,1996

5. Building the minimal DFA for the set of all subwords of a word online in linear time;Blumer,1984

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Building Efficient and Compact Data Structures for Simplicial Complexes;Algorithmica;2016-09-08

2. An Incremental Fuzzy Approach to Finding Event Sequences;Information Processing and Management of Uncertainty in Knowledge-Based Systems;2016

3. Representation and Identification of Approximately Similar Event Sequences;Advances in Intelligent Systems and Computing;2015-10-21

4. ON-LINE CONSTRUCTION OF A SMALL AUTOMATON FOR A FINITE SET OF WORDS;International Journal of Foundations of Computer Science;2012-02

5. Bisociative Discovery in Business Process Models;Bisociative Knowledge Discovery;2012