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):
Displaying 50 items.
- Popping Superbubbles and Discovering Clumps: Recent Developments in Biological Sequence Analysis (Q2803803) (← links)
- Locally compressed suffix arrays (Q2828176) (← links)
- General document retrieval in compact space (Q2828189) (← links)
- Orthogonal Range Searching for Text Indexing (Q2848980) (← links)
- Crochemore's repetitions algorithm revisited: computing runs (Q2909203) (← links)
- Alphabet-Dependent String Searching with Wexponential Search Trees (Q2942254) (← links)
- Lempel Ziv Computation in Small Space (LZ-CISS) (Q2942255) (← links)
- Succinct Non-overlapping Indexing (Q2942256) (← links)
- Dictionary Matching with Uneven Gaps (Q2942261) (← links)
- Tighter Bounds for the Sum of Irreducible LCP Values (Q2942269) (← links)
- Semi-dynamic Compact Index for Short Patterns and Succinct van Emde Boas Tree (Q2942273) (← links)
- A Probabilistic Analysis of the Reduction Ratio in the Suffix-Array IS-Algorithm (Q2942275) (← links)
- An Opportunistic Text Indexing Structure Based on Run Length Encoding (Q2947038) (← links)
- A Faster Algorithm for Computing Maximal $$\alpha $$-gapped Repeats in a String (Q2949836) (← links)
- Longest Common Prefix with Mismatches (Q2949838) (← links)
- Large-scale detection of repetitions (Q2955637) (← links)
- Indexing a sequence for mapping reads with a single mismatch (Q2955639) (← links)
- Fast circular dictionary-matching algorithm (Q2971059) (← links)
- The longest common substring problem (Q2971067) (← links)
- Computing Longest Single-arm-gapped Palindromes in a String (Q2971149) (← links)
- Worst Case Efficient Single and Multiple String Matching in the RAM Model (Q3000497) (← links)
- PSAEC: An Improved Algorithm for Short Read Error Correction Using Partial Suffix Arrays (Q3004672) (← links)
- WEIGHTED AUTOMATA FOR FULL-TEXT INDEXING (Q3016225) (← links)
- Space-Efficient Frameworks for Top- <i>k</i> String Retrieval (Q3189644) (← links)
- Algorithms for Indexing Highly Similar DNA Sequences (Q3305514) (← links)
- Full-Text Indexes for High-Throughput Sequencing (Q3305517) (← links)
- Searching and Indexing Circular Patterns (Q3305518) (← links)
- Kings, Name Days, Lazy Servants and Magic (Q3305728) (← links)
- RECONSTRUCTING A SUFFIX ARRAY (Q3421844) (← links)
- A SIMPLE ALPHABET-INDEPENDENT FM-INDEX (Q3421851) (← links)
- A Fast Suffix-Sorting Algorithm (Q3439227) (← links)
- An Online Algorithm for Finding the Longest Previous Factors (Q3541131) (← links)
- HPRD: a high performance RDF database (Q3557558) (← links)
- An artificial neural network based approach for online string matching/filtering of large databases (Q3563649) (← links)
- Counting Parameterized Border Arrays for a Binary Alphabet (Q3618600) (← links)
- Online Suffix Tree Construction for Streaming Sequences (Q3628498) (← links)
- Contracted Suffix Trees: A Simple and Dynamic Text Indexing Data Structure (Q3637103) (← links)
- Permuted Longest-Common-Prefix Array (Q3637112) (← links)
- THE VIRTUAL SUFFIX TREE (Q3655540) (← links)
- Better External Memory LCP Array Construction (Q4629538) (← links)
- On the construction of classes of suffix trees for square matrices: Algorithms and applications (Q4645171) (← links)
- Improvements to Burrows-Wheeler compression algorithm (Q4791703) (← links)
- Forty Years of Text Indexing (Q4928554) (← links)
- (Q5009616) (← links)
- Bidirectional Text Compression in External Memory (Q5075783) (← links)
- (Q5088897) (← links)
- Indexing the bijective BWT (Q5088907) (← links)
- Dichotomic Selection on Words: A Probabilistic Analysis (Q5088910) (← links)
- (Q5088915) (← links)
- Quasi-Linear-Time Algorithm for Longest Common Circular Factor (Q5088916) (← links)
