Suffix Arrays: A New Method for On-Line String Searches
From MaRDI portal
Recommendations
- On-line construction of suffix trees
- Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
- Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
- A time and space efficient data structure for string searching on large texts
- Space efficient suffix trees
Cited in
(only showing first 100 items - show all)- Linearized suffix tree: An efficient index data structure with the capabilities of suffix trees and suffix arrays
- Lossless filter for multiple repetitions with Hamming distance
- Real two dimensional scaled matching
- Dynamic dictionary matching in external memory
- Parallel construction and query of index data structures for pattern matching on square matrices
- A time and space efficient data structure for string searching on large texts
- Generalizations of suffix arrays to multi-dimensional matrices.
- Text sparsification via local maxima.
- Two-dimensional substring indexing.
- Fast pattern matching in indexed texts
- Extended suffix array construction using Lyndon factors
- Lyndon array construction during Burrows-Wheeler inversion
- Approximate string matching with compressed indexes
- Suffix-sorting via Shannon-Fano-Elias codes
- A fast algorithm for the all-pairs suffix-prefix problem
- Position-restricted substring searching over small alphabets
- Period recovery of strings over the Hamming and edit distances
- Dictionary matching with a bounded gap in pattern or in text
- Universal compressed text indexing
- Practical compressed suffix trees
- Computing regularities in strings: a survey
- Computing the longest previous factor
- On-line construction of compact directed acyclic word graphs
- Alignment-free sequence comparison using absent words
- Optimal data compression algorithm
- The suffix binary search tree and suffix AVL tree
- Time-space trade-offs for compressed suffix arrays.
- Reducing space for index implementation.
- A linear time lower bound on McCreight and general updating algorithms for suffix trees
- On-line construction of suffix trees
- Data structures and algorithms for the string statistics problem
- Variations of the parameterized longest previous factor
- p-suffix sorting as arithmetic coding
- The indexing for one-dimensional proportionally-scaled strings
- On the possible patterns of inputs for block sorting in the Burrows-Wheeler transformation
- Fast compressed self-indexes with deterministic linear-time construction
- Permuted pattern matching algorithms on multi-track strings
- A simple algorithm for computing the document array
- New space/time tradeoffs for top-\(k\) document retrieval on sequences
- The exact multiple pattern matching problem solved by a reference tree approach
- Wheeler languages
- Faster online computation of the succinct longest previous factor array
- String inference from longest-common-prefix array
- Efficient computation of sequence mappability
- r-indexing the eBWT
- Grammar index by induced suffix sorting
- Computing the original eBWT faster, simpler, and with less memory
- Extracting the sparse longest common prefix array from the suffix binary search tree
- Combinatorics of minimal absent words for a sliding window
- All-pairs suffix/prefix in optimal time using Aho-Corasick space
- Using compressed suffix-arrays for a compact representation of temporal-graphs
- Efficient online string matching based on characters distance text sampling
- Space-efficient algorithms for computing minimal/shortest unique substrings
- Space-efficient construction of compressed suffix trees
- Computing longest palindromic substring after single-character or block-wise edits
- Lempel-Ziv compressed structures for document retrieval
- Succinct non-overlapping indexing
- A brief history of parameterized matching problems
- Refining the \(r\)-index
- Parallel computation of the Burrows Wheeler transform in compact space
- Efficient computation of longest single-arm-gapped palindromes in a string
- On the size of the smallest alphabet for Lyndon trees
- Computing the Burrows-Wheeler transform in place and in small space
- Improved and extended locating functionality on compressed suffix arrays
- Bottom-\(k\) document retrieval
- Geometric BWT: compressed text indexing via sparse suffixes and range searching
- Compressing dictionary matching index via sparsification technique
- Top-k term-proximity in succinct space
- Engineering a lightweight external memory suffix array construction algorithm
- Faster average case low memory semi-external construction of the Burrows-Wheeler transform
- On position restricted substring searching in succinct space
- Faster index for property matching
- Indexing factors with gaps
- Parallel lightweight wavelet tree, suffix array and FM-index construction
- Efficient computation of substring equivalence classes with suffix arrays
- Space-time trade-offs for finding shortest unique substrings and maximal unique matches
- Algorithms to compute the Burrows-Wheeler similarity distribution
- Linking indexing data structures to de Bruijn graphs: construction and update
- Stronger Lempel-Ziv based compressed text indexing
- Compressed text indexing with wildcards
- Wavelet trees for all
- On the combinatorics of suffix arrays
- Alphabet-independent linear-time construction of compressed suffix arrays using \(o(n \log n)\)-bit working space
- Fast BWT in small space by blockwise suffix sorting
- Faster suffix sorting
- Rank and select revisited and extended
- Freeness of partial words
- The affix array data structure and its applications to RNA secondary structure analysis
- GAME: A simple and efficient whole genome alignment method using maximal exact match filtering
- Constructing suffix arrays in linear time
- Space efficient linear time construction of suffix arrays
- Indexing text with approximate \(q\)-grams
- Lightweight LCP construction for very large collections of strings
- An improved algorithm for the all-pairs suffix-prefix problem
- Faster repetition-aware compressed suffix trees based on block trees
- LZRR: LZ77 parsing with right reference
- Improved characters distance sampling for online and offline text searching
- The parameterized suffix tray
- Popping superbubbles and discovering clumps: recent developments in biological sequence analysis
- Locally compressed suffix arrays
This page was built for publication: Suffix Arrays: A New Method for On-Line String Searches
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3142586)
