Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
From MaRDI portal
Publication:3192007
Recommendations
- Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
- Space efficient suffix trees
- Combinatorial Pattern Matching
- A categorization theorem on suffix arrays with applications to space efficient text indexes
- New text indexing functionalities of the compressed suffix arrays
Cited in
(95)- Accessing the suffix array via \(\phi^{-1}\)-forest
- Algorithms and Computation
- Semi-dynamic compact index for short patterns and succinct van Emde Boas tree
- Improved and extended locating functionality on compressed suffix arrays
- Optimized binary search and text retrieval
- Succinct backward-DAWG-matching
- An artificial neural network based approach for online string matching/filtering of large databases
- Algorithms for indexing highly similar DNA sequences
- On the Structure of Consistent Partitions of Substring Set of a Word
- Improved characters distance sampling for online and offline text searching
- scientific article; zbMATH DE number 1893570 (Why is no real title available?)
- String Processing and Information Retrieval
- Tables
- Sliding suffix tree
- Suffix arrays for multiple strings: a method for on-line multiple string searches
- Reverse-safe text indexing
- scientific article; zbMATH DE number 3954313 (Why is no real title available?)
- The compressed permuterm index
- Byte-aligned pattern matching in encoded genomic sequences
- Linearized suffix tree: An efficient index data structure with the capabilities of suffix trees and suffix arrays
- Space efficient suffix trees
- Internal pattern matching queries in a text and applications
- Succinct Non-overlapping Indexing
- ESP-index: a compressed index based on edit-sensitive parsing
- The cell probe complexity of succinct data structures
- Improved approximate string matching using compressed suffix data structures
- Using compressed suffix-arrays for a compact representation of temporal-graphs
- Combinatorial Pattern Matching
- scientific article; zbMATH DE number 2080264 (Why is no real title available?)
- Wavelet trees for all
- scientific article; zbMATH DE number 2079421 (Why is no real title available?)
- Dynamic dictionary matching and compressed suffix trees
- Time-space trade-offs for Lempel-Ziv compressed indexing
- Reducing space for index implementation.
- Contracted Suffix Trees: A Simple and Dynamic Text Indexing Data Structure
- Fast matching statistics in small space
- A Compressed Enhanced Suffix Array Supporting Fast String Matching
- Opportunistic data structures for range queries
- Succincter text indexing with wildcards
- Self-indexing based on LZ77
- String matching with alphabet sampling
- scientific article; zbMATH DE number 2087050 (Why is no real title available?)
- Geometric BWT: compressed text indexing via sparse suffixes and range searching
- Distribution-aware compressed full-text indexes
- Orthogonal range searching for text indexing
- Fast compressed self-indexes with deterministic linear-time construction
- An index structure for spaced seed search
- Fully functional suffix trees and optimal text searching in BWT-runs bounded space
- Succinct non-overlapping indexing
- Faster compressed dictionary matching
- Wheeler graphs: a framework for BWT-based data structures
- Hybrid indexing revisited
- Compressed data structures for strings. On searching and extracting strings from compressed textual data
- Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
- Succinct representations of permutations and functions
- scientific article; zbMATH DE number 1998345 (Why is no real title available?)
- Indexing text using the Ziv--Lempel trie
- scientific article; zbMATH DE number 1786455 (Why is no real title available?)
- A framework for designing space-efficient dictionaries for parameterized and order-preserving matching
- Compressed indexes for approximate string matching
- Indexed multi-pattern matching
- Compressed property suffix trees
- Ranked document retrieval with forbidden pattern
- Locally compressed suffix arrays
- New text indexing functionalities of the compressed suffix arrays
- Constructing suffix arrays in linear time
- Linear Time Suffix Array Construction Using D-Critical Substrings
- On-line construction of compact directed acyclic word graphs
- Forty Years of Text Indexing
- Compressed indexes for text with wildcards
- On compressing and indexing repetitive sequences
- scientific article; zbMATH DE number 6469201 (Why is no real title available?)
- On building minimal automaton for subset matching queries
- A categorization theorem on suffix arrays with applications to space efficient text indexes
- Compressed data structures: Dictionaries and data-aware measures
- Time-space trade-offs for compressed suffix arrays.
- A linear lower bound on index size for text retrieval
- Indexing compressed text
- Replacing suffix trees with enhanced suffix arrays
- Compressed indexing with signature grammars
- An experimental study of a compressed index
- Text indexing with errors
- A self-index on block trees
- Compressed spaced suffix arrays
- Grammar-compressed indexes with logarithmic search time
- Ranked document retrieval for multiple patterns
- Online timestamped text indexing
- Approximate string matching using compressed suffix arrays
- An index data structure for matrices, with applications to fast two-dimensional pattern matching
- Suffix Arrays: A New Method for On-Line String Searches
- Combinatorial Pattern Matching
- Combinatorial Pattern Matching
- Using static suffix array in dynamic application: case of text compression by longest first substitution
- Counting suffix arrays and strings
- A linear lower bound on index size for text retrieval
This page was built for publication: Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3192007)
