Linear time online algorithms for constructing linear-size suffix trie
type: Item
instance of: scholarly article
title: Linear time online algorithms for constructing linear-size suffix trie
author: Diptarama Hendrian
author: Takuya Takagi
author: Shunsuke Inenaga
author: Keisuke Goto
author: Mitsuru Funakoshi
published in: Theoretical Computer Science
publication date: 2024-10-07T00:00:00Z
Mathematics Subject Classification ID: 68W27
Mathematics Subject Classification ID: 68P05
zbMATH DE Number: 7921844
zbMATH Keywords: indexing structure
zbMATH Keywords: linear-size suffix trie
zbMATH Keywords: online algorithm
zbMATH Keywords: pattern matching
zbMATH Keywords: nearest marked ancestor
MaRDI profile type: Publication
cites work: Suffix Arrays: A New Method for On-Line String Searches
cites work: The smallest automaton recognizing the subwords of a text
cites work: Complete inverted files for efficient text retrieval and analysis
cites work: Position heaps: a simple and dynamic text indexing data structure
cites work: On the sorting-complexity of suffix tree construction
cites work: Q4608599
cites work: Faster Lyndon factorization algorithms for SLP and LZ78 compressed text
cites work: Linear work suffix array construction
cites work: Efficient computation of substring equivalence classes with suffix arrays
cites work: On-line construction of suffix trees
cites work: On-line construction of compact directed acyclic word graphs
cites work: On-line construction of position heaps
cites work: Linear-size suffix tries
cites work: Online algorithms for constructing linear-size suffix trie
cites work: A linear-time algorithm for a special case of disjoint set union
cites work: Dynamic orthogonal segment intersection search
cites work: Near real-time suffix tree construction via the fringe marked ancestor problem
cites work: Alphabet-Dependent String Searching with Wexponential Search Trees
cites work: Linear-Size CDAWG: New Repetition-Aware Indexing and Grammar Compression
cites work: Fast Label Extraction in the CDAWG
cites work: Random Access to Grammar-Compressed Strings and Trees
cites work: Q4607988
DOI: 10.1016/J.TCS.2024.114765
description: scientific article; zbMATH DE number 7921844