Pages that link to "Item:Q3142586"
From MaRDI portal
The following pages link to Suffix Arrays: A New Method for On-Line String Searches (Q3142586):
Displayed 50 items.
- Lossless filter for multiple repetitions with Hamming distance (Q1018103) (← links)
- Real two dimensional scaled matching (Q1024780) (← links)
- Dynamic dictionary matching in external memory (Q1275745) (← links)
- Parallel construction and query of index data structures for pattern matching on square matrices (Q1288531) (← links)
- A time and space efficient data structure for string searching on large texts (Q1349954) (← links)
- Generalizations of suffix arrays to multi-dimensional matrices. (Q1401328) (← links)
- Text sparsification via local maxima. (Q1401406) (← links)
- Two-dimensional substring indexing. (Q1401971) (← links)
- Fast pattern matching in indexed texts (Q1566727) (← links)
- Extended suffix array construction using Lyndon factors (Q1615410) (← links)
- Lyndon array construction during Burrows-Wheeler inversion (Q1632505) (← links)
- Approximate string matching with compressed indexes (Q1662494) (← links)
- Suffix-sorting via Shannon-Fano-Elias codes (Q1662548) (← links)
- A fast algorithm for the all-pairs suffix-prefix problem (Q1676303) (← links)
- A framework for space-efficient string kernels (Q1679234) (← links)
- Position-restricted substring searching over small alphabets (Q1679612) (← links)
- Period recovery of strings over the Hamming and edit distances (Q1698696) (← links)
- Dictionary matching with a bounded gap in pattern or in text (Q1709592) (← links)
- Universal compressed text indexing (Q1729689) (← links)
- Practical compressed suffix trees (Q1736557) (← links)
- Computing regularities in strings: a survey (Q1761494) (← links)
- Computing the longest previous factor (Q1761495) (← links)
- On-line construction of compact directed acyclic word graphs (Q1764897) (← links)
- Alignment-free sequence comparison using absent words (Q1784946) (← links)
- Optimal data compression algorithm (Q1816650) (← links)
- The suffix binary search tree and suffix AVL tree (Q1827266) (← links)
- Time-space trade-offs for compressed suffix arrays. (Q1853020) (← links)
- Reducing space for index implementation. (Q1853739) (← links)
- A linear time lower bound on McCreight and general updating algorithms for suffix trees (Q1879368) (← links)
- Variations of the parameterized longest previous factor (Q1932360) (← links)
- \(p\)-suffix sorting as arithmetic coding (Q1932361) (← links)
- The indexing for one-dimensional proportionally-scaled strings (Q1944891) (← links)
- On the possible patterns of inputs for block sorting in the Burrows-Wheeler transformation (Q1944955) (← links)
- Fast compressed self-indexes with deterministic linear-time construction (Q1986963) (← links)
- Permuted pattern matching algorithms on multi-track strings (Q2003324) (← links)
- A simple algorithm for computing the document array (Q2011038) (← links)
- New space/time tradeoffs for top-\(k\) document retrieval on sequences (Q2015136) (← links)
- The exact multiple pattern matching problem solved by a reference tree approach (Q2044955) (← links)
- Wheeler languages (Q2051845) (← links)
- Faster online computation of the succinct longest previous factor array (Q2106621) (← links)
- String inference from longest-common-prefix array (Q2110373) (← links)
- Efficient computation of sequence mappability (Q2134748) (← links)
- r-indexing the eBWT (Q2146118) (← links)
- Grammar index by induced suffix sorting (Q2146128) (← links)
- Computing the original eBWT faster, simpler, and with less memory (Q2146134) (← links)
- Extracting the sparse longest common prefix array from the suffix binary search tree (Q2146135) (← links)
- Combinatorics of minimal absent words for a sliding window (Q2163388) (← links)
- All-pairs suffix/prefix in optimal time using Aho-Corasick space (Q2169425) (← links)
- Using compressed suffix-arrays for a compact representation of temporal-graphs (Q2200556) (← links)
- Efficient online string matching based on characters distance text sampling (Q2205639) (← links)