Christina Boucher

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Acceleration of FM-index queries through prefix-free parsing	2024-12-09	Paper
Data structures for SMEM-finding in the PBWT	2024-05-29	Paper
\(r\)-indexing the eBWT Information and Computation	2024-05-24	Paper
LZ77 via prefix-free parsing	2024-05-24	Paper
Computational graph pangenomics: a tutorial on data structures and their applications Natural Computing	2024-02-16	Paper
Accessing the suffix array via \(\phi^{-1}\)-forest String Processing and Information Retrieval	2023-08-04	Paper
Recoloring the colored de Bruijn graph String Processing and Information Retrieval	2023-07-28	Paper
Fast and efficient Rmap assembly using the bi-labelled de Bruijn graph	2023-02-07	Paper
Prefix-free parsing for building big BWTs	2022-07-18	Paper
A succinct solution to Rmap alignment	2022-07-18	Paper
r-indexing the eBWT	2022-06-15	Paper
Computing the original eBWT faster, simpler, and with less memory	2022-06-15	Paper
PFP Compressed Suffix Trees 2021 Proceedings of the Workshop on Algorithm Engineering and Experiments (ALENEX)	2021-01-27	Paper
Disentangled long-read de Bruijn graphs via optical maps	2020-05-27	Paper
Efficient construction of a complete index for pan-genomics read alignment	2019-05-21	Paper
Consensus patterns (probably) has no EPTAS Algorithms - ESA 2015	2015-11-19	Paper
On approximating string selection problems with outliers Theoretical Computer Science	2014-01-10	Paper
On approximating string selection problems with outliers Combinatorial Pattern Matching	2012-08-14	Paper
The bounded search tree algorithm for the closest string problem has quadratic smoothed complexity Mathematical Foundations of Computer Science 2011	2011-08-17	Paper

Research outcomes over time

This page was built for person: Christina Boucher