The following pages link to (Q5397902):
Displaying 32 items.
- Optimal suffix sorting and LCP array construction for constant alphabets (Q344531) (← 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)
- Inducing enhanced suffix arrays for string collections (Q526901) (← links)
- A practical semi-external memory method for approximate pattern matching (Q529654) (← links)
- Lyndon array construction during Burrows-Wheeler inversion (Q1632505) (← links)
- On the string matching with \(k\) mismatches (Q1743717) (← links)
- A simple algorithm for computing the document array (Q2011038) (← links)
- Solving string problems on graphs using the labeled direct product (Q2088591) (← links)
- String inference from longest-common-prefix array (Q2110373) (← links)
- Computing the original eBWT faster, simpler, and with less memory (Q2146134) (← links)
- Parallel computation of the Burrows Wheeler transform in compact space (Q2297855) (← links)
- Engineering a lightweight external memory suffix array construction algorithm (Q2363989) (← links)
- Algorithms to compute the Burrows-Wheeler similarity distribution (Q2420649) (← links)
- Linking indexing data structures to de Bruijn graphs: construction and update (Q2424683) (← links)
- Lightweight LCP construction for very large collections of strings (Q2628803) (← links)
- An improved algorithm for the all-pairs suffix-prefix problem (Q2628805) (← links)
- Edge minimization in de Bruijn graphs (Q2672229) (← links)
- Efficient Construction of a Compressed de Bruijn Graph for Pan-Genome Analysis (Q2942244) (← links)
- Tighter Bounds for the Sum of Irreducible LCP Values (Q2942269) (← links)
- Reporting Consecutive Substring Occurrences Under Bounded Gap Constraints (Q2942274) (← links)
- The longest common substring problem (Q2971067) (← links)
- Full-Text Indexes for High-Throughput Sequencing (Q3305517) (← links)
- Better External Memory LCP Array Construction (Q4629538) (← links)
- Online LZ77 Parsing and Matching Statistics with RLBWTs (Q5140769) (← 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)
- Efficient construction of the BWT for repetitive text using string compression (Q6077847) (← links)
- Inducing the Lyndon array (Q6536249) (← links)
- Comparative genomics with succinct colored de Bruijn graphs (Q6658084) (← links)
