Near real-time suffix tree construction via the fringe marked ancestor problem-Reference-Cited by-同舟云学术

Near real-time suffix tree construction via the fringe marked ancestor problem

Published:2013-01 Issue: Volume:18 Page:32-48
ISSN:1570-8667
Container-title:Journal of Discrete Algorithms
language:en
Short-container-title:Journal of Discrete Algorithms

Author:

Breslauer Dany,Italiano Giuseppe F.

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science

Reference50 articles.

1. S. Alstrup, T. Husfeldt, T. Rauhe, Marked ancestor problems, in: FOCS, 1998, pp. 534–544.

2. Real-time indexing over fixed finite alphabets;Amir,2008

3. Improved dynamic dictionary-matching;Amir;Inform. and Comput.,1995

4. A. Amir, G. Franceschini, R. Grossi, T. Kopelowitz, M. Lewenstein, N. Lewenstein, Managing unbounded-length keys in comparison-driven data structures with applications to on-line indexing, Manuscript, 2011.

5. Towards real-time suffix tree construction;Amir,2005

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

1. Linear time online algorithms for constructing linear-size suffix trie;Theoretical Computer Science;2024-11

2. Non-Overlapping LZ77 Factorization and LZ78 Substring Compression Queries with Suffix Trees;Algorithms;2021-01-29

3. Suffix Trees, DAWGs and CDAWGs for Forward and Backward Tries;LATIN 2020: Theoretical Informatics;2020

4. Fully-Online Suffix Tree and Directed Acyclic Word Graph Construction for Multiple Texts;Algorithmica;2019-10-31

5. Dynamic Dictionary Matching in the Online Model;Lecture Notes in Computer Science;2019