The following pages link to Christina Boucher (Q2146116):
Displaying 15 items.
- r-indexing the eBWT (Q2146118) (← links)
- Computing the original eBWT faster, simpler, and with less memory (Q2146134) (← links)
- Efficient construction of a complete index for pan-genomics read alignment (Q2415261) (← links)
- The Bounded Search Tree Algorithm for the Closest String Problem Has Quadratic Smoothed Complexity (Q3088036) (← links)
- Consensus Patterns (Probably) Has no EPTAS (Q3452789) (← links)
- Prefix-Free Parsing for Building Big BWTs (Q5090326) (← links)
- A Succinct Solution to Rmap Alignment (Q5090339) (← links)
- Disentangled Long-Read De Bruijn Graphs via Optical Maps (Q5111789) (← links)
- PFP Compressed Suffix Trees (Q5147525) (← links)
- Computational graph pangenomics: a tutorial on data structures and their applications (Q6155034) (← links)
- Fast and efficient Rmap assembly using the bi-labelled de Bruijn graph (Q6487635) (← links)
- \(r\)-indexing the eBWT (Q6543261) (← links)
- LZ77 via prefix-free parsing (Q6543553) (← links)
- Data structures for SMEM-finding in the PBWT (Q6545416) (← links)
- Acceleration of FM-index queries through prefix-free parsing (Q6651039) (← links)
