Pages that link to "Item:Q5487881"
From MaRDI portal
The following pages link to On the sorting-complexity of suffix tree construction (Q5487881):
Displaying 50 items.
- A new efficient indexing algorithm for one-dimensional real scaled patterns (Q414881) (← links)
- On demand string sorting over unbounded alphabets (Q418735) (← links)
- Efficient retrieval of approximate palindromes in a run-length encoded string (Q428850) (← links)
- PSIST: a scalable approach to indexing protein structures using suffix trees (Q436643) (← links)
- Substring range reporting (Q517792) (← links)
- Linear-time construction of two-dimensional suffix trees (Q627547) (← links)
- Faster approximate string matching for short patterns (Q692899) (← links)
- On suffix extensions in suffix trees (Q714837) (← links)
- Efficient indexing algorithms for one-dimensional discretely-scaled strings (Q765528) (← links)
- Improving on-line construction of two-dimensional suffix trees for square matrices (Q987807) (← links)
- Linearized suffix tree: An efficient index data structure with the capabilities of suffix trees and suffix arrays (Q1006380) (← links)
- Real two dimensional scaled matching (Q1024780) (← links)
- Generalizations of suffix arrays to multi-dimensional matrices. (Q1401328) (← links)
- Suffix-sorting via Shannon-Fano-Elias codes (Q1662548) (← links)
- The suffix binary search tree and suffix AVL tree (Q1827266) (← links)
- On-line construction of parameterized suffix trees for large alphabets (Q1944073) (← links)
- The indexing for one-dimensional proportionally-scaled strings (Q1944891) (← links)
- Internal dictionary matching (Q2037109) (← links)
- Efficient computation of sequence mappability (Q2134748) (← links)
- Minimal unique palindromic substrings after single-character substitution (Q2146122) (← links)
- Grammar index by induced suffix sorting (Q2146128) (← links)
- Computing longest palindromic substring after single-character or block-wise edits (Q2227497) (← links)
- Efficient construction of maximal and minimal representations of motifs of a string (Q2271439) (← links)
- Indexing weighted sequences: neat and efficient (Q2288210) (← links)
- Efficient computation of longest single-arm-gapped palindromes in a string (Q2297859) (← links)
- Sliding suffix tree (Q2331636) (← links)
- Suffix trays and suffix trists: structures for faster text indexing (Q2354023) (← links)
- Efficient computation of substring equivalence classes with suffix arrays (Q2408913) (← links)
- Lightweight data indexing and compression in external memory (Q2429367) (← links)
- Alphabet-independent linear-time construction of compressed suffix arrays using \(o(n \log n)\)-bit working space (Q2456365) (← links)
- Linear time algorithm for the longest common repeat problem (Q2457296) (← links)
- Constructing suffix arrays in linear time (Q2569391) (← links)
- The parameterized suffix tray (Q2692728) (← links)
- Finding Gapped Palindromes Online (Q2819503) (← links)
- Orthogonal Range Searching for Text Indexing (Q2848980) (← links)
- The longest common substring problem (Q2971067) (← links)
- Computing Longest Single-arm-gapped Palindromes in a String (Q2971149) (← links)
- Substring Range Reporting (Q3011863) (← links)
- Self-indexed Text Compression Using Straight-Line Programs (Q3182928) (← links)
- Algorithms for Indexing Highly Similar DNA Sequences (Q3305514) (← links)
- Full-Text Indexes for High-Throughput Sequencing (Q3305517) (← links)
- ONLINE AND DYNAMIC RECOGNITION OF SQUAREFREE STRINGS (Q3434282) (← links)
- THE VIRTUAL SUFFIX TREE (Q3655540) (← links)
- Quasi-Linear-Time Algorithm for Longest Common Circular Factor (Q5088916) (← links)
- Faster queries for longest substring palindrome after block edit (Q5088918) (← links)
- Online algorithms for constructing linear-size suffix trie (Q5088922) (← links)
- Longest substring palindrome after edit (Q5140775) (← links)
- Inducing Suffix and LCP Arrays in External Memory (Q5266606) (← links)
- (Q5874481) (← links)
- Practical Performance of Space Efficient Data Structures for Longest Common Extensions. (Q5874509) (← links)
