The parameterized suffix tray

DOI10.1007/978-3-030-75242-2_18MaRDI QIDQ2692728zbMATH OpenOpenAlexFDO

Authors Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

Publication date 22 March 2023

Full work available at URL https://arxiv.org/abs/2012.10092

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• A brief history of parameterized matching problems
• A theory of parameterized pattern matching
• Complete inverted files for efficient text retrieval and analysis
• Constructing Efficient Dictionaries in Close to Sorting Time
• Constructing suffix arrays in linear time
• DAWGs for Parameterized Matching: Online Construction and Related Indexing Structures
• Generalization of a suffix tree for RNA structural pattern matching
• Linear work suffix array construction
• Linear-time suffix sorting -- a new approach for suffix array construction
• On the sorting-complexity of suffix tree construction
• On-line construction of position heaps
• Parameterized pattern matching: Algorithms and applications
• pBWT: achieving succinct data structures for parameterized pattern matching and related problems
• Position heaps: a simple and dynamic text indexing data structure
• Space efficient linear time construction of suffix arrays
• Suffix Arrays: A New Method for On-Line String Searches
• The parameterized position heap of a trie
• The smallest automaton recognizing the subwords of a text
• Two Efficient Algorithms for Linear Time Suffix Array Construction

Cited in

(1)

• Breaking a barrier in constructing compact indexes for parameterized pattern matching

This page was built for publication: The parameterized suffix tray

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2692728)