The parameterized suffix tray
From MaRDI portal
Publication:2692728
DOI10.1007/978-3-030-75242-2_18OpenAlexW3164205975MaRDI QIDQ2692728
Hideo Bannai, Yuto Nakashima, Noriki Fujisato, Shunsuke Inenaga, Masayuki Takeda
Publication date: 22 March 2023
Full work available at URL: https://arxiv.org/abs/2012.10092
Cites Work
- On-line construction of position heaps
- Position heaps: a simple and dynamic text indexing data structure
- The smallest automaton recognizing the subwords of a text
- Generalization of a suffix tree for RNA structural pattern matching
- Parameterized pattern matching: Algorithms and applications
- The parameterized position heap of a trie
- A brief history of parameterized matching problems
- Suffix trays and suffix trists: structures for faster text indexing
- Constructing suffix arrays in linear time
- Space efficient linear time construction of suffix arrays
- Suffix Arrays: A New Method for On-Line String Searches
- Linear work suffix array construction
- Constructing Efficient Dictionaries in Close to Sorting Time
- pBWT: Achieving Succinct Data Structures for Parameterized Pattern Matching and Related Problems
- Complete inverted files for efficient text retrieval and analysis
- A theory of parameterized pattern matching
- Two Efficient Algorithms for Linear Time Suffix Array Construction
- Linear-time Suffix Sorting - A New Approach for Suffix Array Construction.
- On the sorting-complexity of suffix tree construction
- DAWGs for Parameterized Matching: Online Construction and Related Indexing Structures
