Pages that link to "Item:Q1897476"
From MaRDI portal
The following pages link to On-line construction of suffix trees (Q1897476):
Displaying 50 items.
- Space-efficient representation of truncated suffix trees, with applications to Markov order estimation (Q2354764) (← links)
- On representations of ternary order relations in numeric strings (Q2363988) (← links)
- Near real-time suffix tree construction via the fringe marked ancestor problem (Q2376800) (← links)
- Faster index for property matching (Q2380078) (← links)
- Indexing factors with gaps (Q2391183) (← links)
- Succinct 2D dictionary matching (Q2392930) (← links)
- Efficient computation of substring equivalence classes with suffix arrays (Q2408913) (← links)
- Space-time trade-offs for finding shortest unique substrings and maximal unique matches (Q2410365) (← links)
- Linking indexing data structures to de Bruijn graphs: construction and update (Q2424683) (← links)
- Generalized substring compression (Q2437745) (← links)
- Dynamic construction of an antidictionary with linear complexity (Q2437769) (← links)
- Linear time algorithm for the longest common repeat problem (Q2457296) (← links)
- Computational aspects of mining maximal frequent patterns (Q2508965) (← links)
- Constructing suffix arrays in linear time (Q2569391) (← links)
- Space efficient linear time construction of suffix arrays (Q2569393) (← links)
- Distributed suffix trees (Q2569396) (← links)
- Adaptive learning of compressible strings (Q2664947) (← links)
- Faster repetition-aware compressed suffix trees based on block trees (Q2672222) (← links)
- c-trie++: a dynamic trie tailored for fast prefix searches (Q2672225) (← links)
- Double string tandem repeats (Q2700385) (← links)
- Finding Gapped Palindromes Online (Q2819503) (← links)
- Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing (Q2819506) (← links)
- Orthogonal Range Searching for Text Indexing (Q2848980) (← links)
- On-line construction of a small automaton for a finite set of words (Q2909196) (← links)
- Managing unbounded-length keys in comparison-driven data structures with applications to online indexing (Q2929702) (← links)
- Succinct Non-overlapping Indexing (Q2942256) (← links)
- LZD Factorization: Simple and Practical Online Grammar Compression with Variable-to-Fixed Encoding (Q2942259) (← links)
- Semi-dynamic Compact Index for Short Patterns and Succinct van Emde Boas Tree (Q2942273) (← links)
- Accurate and Efficient Methods to Improve Multiple Circular Sequence Alignment (Q2948308) (← links)
- A Faster Algorithm for Computing Maximal $$\alpha $$-gapped Repeats in a String (Q2949836) (← links)
- On the relationship between histogram indexing and block-mass indexing (Q2955626) (← links)
- Large-scale detection of repetitions (Q2955637) (← links)
- Indexing a sequence for mapping reads with a single mismatch (Q2955639) (← links)
- Time-Optimal Top-$k$ Document Retrieval (Q2963583) (← links)
- The longest common substring problem (Q2971067) (← links)
- Palindrome Pattern Matching (Q3011857) (← links)
- Sparse and Truncated Suffix Trees on Variable-Length Codes (Q3011859) (← links)
- Quick Greedy Computation for Minimum Common String Partitions (Q3011861) (← links)
- WEIGHTED AUTOMATA FOR FULL-TEXT INDEXING (Q3016225) (← links)
- FINDING ALL APPROXIMATE GAPPED PALINDROMES (Q3069733) (← links)
- Suffix Arrays: A New Method for On-Line String Searches (Q3142586) (← links)
- Minimal Unique Substrings and Minimal Absent Words in a Sliding Window (Q3297764) (← 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)
- DNA-Seq Error Correction Based on Substring Indices (Q3305526) (← links)
- String-Matching and Alignment Algorithms for Finding Motifs in NGS Data (Q3305534) (← links)
- From Suffix Trees to Suffix Vectors (Q3421852) (← links)
- Approximating LZ77 via Small-Space Multiple-Pattern Matching (Q3452816) (← links)
- Efficient Algorithms for SNP Haplotype Block Selection Problems (Q3511342) (← links)
