The following pages link to Christina Boucher (Q2146116):
Displayed 12 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)
- (Q5090326) (← links)
- (Q5090339) (← links)
- (Q5111789) (← links)
- PFP Compressed Suffix Trees (Q5147525) (← links)
- Recoloring the colored de Bruijn graph (Q6109729) (← links)
- Computational graph pangenomics: a tutorial on data structures and their applications (Q6155034) (← links)
- Accessing the suffix array via \(\phi^{-1}\)-forest (Q6166975) (← links)