Pages that link to "Item:Q876707"
From MaRDI portal
The following pages link to Replacing suffix trees with enhanced suffix arrays (Q876707):
Displaying 50 items.
- On parsing optimality for dictionary-based text compression -- the \texttt{Zip} case (Q396650) (← links)
- String matching with alphabet sampling (Q414445) (← links)
- Searching for smallest grammars on large sequences and application to DNA (Q414452) (← links)
- Bidirectional search in a string with wavelet trees and bidirectional matching statistics (Q418161) (← links)
- Using static suffix array in dynamic application: case of text compression by longest first substitution (Q477617) (← links)
- Alphabet-independent algorithms for finding context-sensitive repeats in linear time (Q491149) (← links)
- Tighter bounds for the sum of irreducible LCP values (Q507409) (← links)
- Burrows-Wheeler transform and LCP array construction in constant space (Q511147) (← links)
- Engineering parallel string sorting (Q513306) (← links)
- Inducing enhanced suffix arrays for string collections (Q526901) (← links)
- Fast, practical algorithms for computing all the repeats in a string (Q626893) (← links)
- Finding range minima in the middle: approximations and applications (Q626956) (← links)
- On space efficient two dimensional range minimum data structures (Q692632) (← links)
- Construction of Aho Corasick automaton in linear time for integer alphabets (Q844159) (← links)
- Computing suffix links for suffix trees and arrays (Q845941) (← links)
- Fast profile matching algorithms - A survey (Q932308) (← links)
- Counting suffix arrays and strings (Q932319) (← links)
- DARN! A weighted constraint solver for RNA motif localization (Q941671) (← links)
- On-line construction of compact suffix vectors and maximal repeats (Q955004) (← links)
- Kernel-based machine learning for fast text mining in R (Q962255) (← links)
- Computing longest previous factor in linear time and applications (Q963336) (← links)
- Efficient algorithms for the all-pairs suffix-prefix problem and the all-pairs substring-prefix problem (Q990128) (← links)
- Wee LCP (Q991794) (← links)
- Linearized suffix tree: An efficient index data structure with the capabilities of suffix trees and suffix arrays (Q1006380) (← links)
- Faster entropy-bounded compressed suffix trees (Q1038474) (← links)
- Suffix-sorting via Shannon-Fano-Elias codes (Q1662548) (← links)
- A fast algorithm for the all-pairs suffix-prefix problem (Q1676303) (← links)
- The principles of informational genomics (Q1682867) (← links)
- Motif trie: an efficient text index for pattern discovery with don't cares (Q1698709) (← links)
- Practical compressed suffix trees (Q1736557) (← links)
- \(xkcd\)-repeats: a new taxonomy of repeats defined by their context diversity (Q1748195) (← links)
- Computing regularities in strings: a survey (Q1761494) (← links)
- Indexing and querying character sets in one- and two-dimensional words (Q1791759) (← links)
- The exact multiple pattern matching problem solved by a reference tree approach (Q2044955) (← links)
- Faster online computation of the succinct longest previous factor array (Q2106621) (← links)
- String inference from longest-common-prefix array (Q2110373) (← links)
- Spectral concepts in genome informational analysis (Q2243578) (← links)
- Succinct non-overlapping indexing (Q2285052) (← links)
- Sliding suffix tree (Q2331636) (← links)
- Suffix trays and suffix trists: structures for faster text indexing (Q2354023) (← links)
- An external-memory algorithm for string graph construction (Q2362353) (← links)
- Engineering a lightweight external memory suffix array construction algorithm (Q2363989) (← links)
- On succinct representations of binary trees (Q2363992) (← links)
- Locating maximal approximate runs in a string (Q2410363) (← links)
- Note on the greedy parsing optimality for dictionary-based text compression (Q2437746) (← links)
- The affix array data structure and its applications to RNA secondary structure analysis (Q2465645) (← links)
- Longest repeats with a block of \(k\) don't cares (Q2508981) (← links)
- Space efficient linear time construction of suffix arrays (Q2569393) (← links)
- Lightweight LCP construction for very large collections of strings (Q2628803) (← links)
- An improved algorithm for the all-pairs suffix-prefix problem (Q2628805) (← links)
