Pages that link to "Item:Q876707"

The following pages link to Replacing suffix trees with enhanced suffix arrays (Q876707):

Displaying 35 items.

• An improved algorithm for the all-pairs suffix-prefix problem (Q2628805) (← links)
• Faster repetition-aware compressed suffix trees based on block trees (Q2672222) (← links)
• Optimal in-place suffix sorting (Q2672235) (← links)
• Locally compressed suffix arrays (Q2828176) (← links)
• Crochemore's repetitions algorithm revisited: computing runs (Q2909203) (← links)
• Efficient Construction of a Compressed de Bruijn Graph for Pan-Genome Analysis (Q2942244) (← links)
• Succinct Non-overlapping Indexing (Q2942256) (← links)
• Tighter Bounds for the Sum of Irreducible LCP Values (Q2942269) (← links)
• Large-scale detection of repetitions (Q2955637) (← links)
• Indexing a sequence for mapping reads with a single mismatch (Q2955639) (← links)
• The longest common substring problem (Q2971067) (← links)
• Lempel-Ziv Factorization Revisited (Q3011840) (← links)
• Sparse and Truncated Suffix Trees on Variable-Length Codes (Q3011859) (← links)
• Full-Text Indexes for High-Throughput Sequencing (Q3305517) (← links)
• DNA-Seq Error Correction Based on Substring Indices (Q3305526) (← links)
• Kings, Name Days, Lazy Servants and Magic (Q3305728) (← links)
• From Suffix Trees to Suffix Vectors (Q3421852) (← links)
• An Online Algorithm for Finding the Longest Previous Factors (Q3541131) (← links)
• Online Suffix Tree Construction for Streaming Sequences (Q3628498) (← links)
• Permuted Longest-Common-Prefix Array (Q3637112) (← links)
• IN-PLACE UPDATE OF SUFFIX ARRAY WHILE RECODING WORDS (Q3655534) (← links)
• THE VIRTUAL SUFFIX TREE (Q3655540) (← links)
• Better External Memory LCP Array Construction (Q4629538) (← links)
• (Q5088917) (← links)
• Finding all maximal perfect haplotype blocks in linear time (Q5091735) (← links)
• LCP Array Construction in External Memory (Q5266615) (← links)
• Faster Compressed Suffix Trees for Repetitive Collections (Q5266617) (← links)
• Space-Efficient Parallel Construction of Succinct Representations of Suffix Tree Topologies (Q5270943) (← links)
• String Processing and Information Retrieval (Q5393949) (← links)
• Property Suffix Array with Applications in Indexing Weighted Sequences (Q6039923) (← links)
• String Covering: A Survey (Q6145625) (← links)
• Computational graph pangenomics: a tutorial on data structures and their applications (Q6155034) (← links)
• On the computation of longest previous non-overlapping factors (Q6536266) (← links)
• Faster repetition-aware compressed suffix trees based on block trees (Q6536270) (← links)
• Computing all-vs-all MEMs in grammar-compressed text (Q6545422) (← links)