Christina Boucher

Orcid: 0000-0001-9509-9725

Affiliations:
  • University of Florida, Department of Computer and Information Science and Engineering, Gainesville, FL, USA


According to our database1, Christina Boucher authored at least 81 papers between 2007 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Pfp-fm: an accelerated FM-index.
Algorithms Mol. Biol., December, 2024

r-indexing the eBWT.
Inf. Comput., 2024

The Elephant in the Room: Software and Hardware Security Vulnerabilities of Portable Sequencing Devices.
CoRR, 2024

Prediction of A. Baumannii Amikacin Resistance in Clinical Metagenomics.
Proceedings of the Digital Health and Informatics Innovations for Sustainable Health Care Systems, 2024

An Average-Case Efficient Two-Stage Algorithm for Enumerating All Longest Common Substrings of Minimum Length $k$ Between Genome Pairs.
Proceedings of the 12th IEEE International Conference on Healthcare Informatics, 2024

Re²Pair: Increasing the Scalability of RePair by Decreasing Memory Usage.
Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

Another virtue of wavelet forests.
Proceedings of the Data Compression Conference, 2024

Solving the Minimal Positional Substring Cover Problem in Sublinear Space.
Proceedings of the 35th Annual Symposium on Combinatorial Pattern Matching, 2024

2023
μ- PBWT: a lightweight r-indexing of the PBWT for storing and querying UK Biobank data.
Bioinform., September, 2023

MEGARes and AMR++, v3.0: an updated comprehensive database of antimicrobial resistance determinants and an improved software pipeline for classification using high-throughput sequencing.
Nucleic Acids Res., January, 2023

Special Issue: Algorithms in Bioinformatics.
Algorithms, January, 2023

Acceleration of FM-Index Queries Through Prefix-Free Parsing.
Proceedings of the 23rd International Workshop on Algorithms in Bioinformatics, 2023

Data Structures for SMEM-Finding in the PBWT.
Proceedings of the String Processing and Information Retrieval, 2023

Recursive Prefix-Free Parsing for Building Big BWTs.
Proceedings of the Data Compression Conference, 2023

LZ77 via Prefix-Free Parsing.
Proceedings of the Symposium on Algorithm Engineering and Experiments, 2023

2022
Finding Overlapping Rmaps via Clustering.
IEEE ACM Trans. Comput. Biol. Bioinform., 2022

Computational graph pangenomics: a tutorial on data structures and their applications.
Nat. Comput., 2022

MONI: A Pangenomic Index for Finding Maximal Exact Matches.
J. Comput. Biol., 2022

Finding Maximal Exact Matches Using the r-Index.
J. Comput. Biol., 2022

Joint Application of the Target Trial Causal Framework and Machine Learning Modeling to Optimize Antibiotic Therapy: Use Case on Acute Bacterial Skin and Skin Structure Infections due to Methicillin-resistant Staphylococcus aureus.
CoRR, 2022

Towards routine employment of computational tools for antimicrobial resistance determination via high-throughput sequencing.
Briefings Bioinform., 2022

Assessing putative bias in prediction of anti-microbial resistance from real-world genotyping data under explicit causal assumptions.
Artif. Intell. Medicine, 2022

Accessing the Suffix Array via φ <sup>-1</sup>-Forest.
Proceedings of the String Processing and Information Retrieval, 2022

Building scalable indexes that can be efficiently queried.
Proceedings of the IEEE International Parallel and Distributed Processing Symposium, 2022

CSTs for Terabyte-Sized Data.
Proceedings of the Data Compression Conference, 2022

2021
Succinct dynamic de Bruijn graphs.
Bioinform., August, 2021

Fast and exact quantification of motif occurrences in biological sequences.
BMC Bioinform., 2021

Metagenome SNP calling via read-colored de Bruijn graphs.
Bioinform., 2021

Fast and efficient Rmap assembly using the Bi-labelled de Bruijn graph.
Algorithms Mol. Biol., 2021

Computing the Original eBWT Faster, Simpler, and with Less Memory.
Proceedings of the String Processing and Information Retrieval, 2021

Efficiently Merging r-indexes.
Proceedings of the 31st Data Compression Conference, 2021

PHONI: Streamed Matching Statistics with Multi-Genome References.
Proceedings of the 31st Data Compression Conference, 2021

PFP Compressed Suffix Trees.
Proceedings of the Symposium on Algorithm Engineering and Experiments, 2021

2020
MEGARes 2.0: a database for classification of antimicrobial drug, biocide and metal resistance determinants in metagenomic sequence data.
Nucleic Acids Res., 2020

Matching Reads to Many Genomes with the r-Index.
J. Comput. Biol., 2020

Efficient Construction of a Complete Index for Pan-Genomics Read Alignment.
J. Comput. Biol., 2020

PFP Data Structures.
CoRR, 2020

Fast and accurate correction of optical mapping data via spaced seeds.
Bioinform., 2020

Portable nanopore analytics: are we there yet?
Bioinform., 2020

2019
Aligning optical maps to de Bruijn graphs.
Bioinform., 2019

Building large updatable colored de Bruijn graphs via merging.
Bioinform., 2019

Kohdista: an efficient method to index and query possible Rmap alignments.
Algorithms Mol. Biol., 2019

Prefix-free parsing for building big BWTs.
Algorithms Mol. Biol., 2019

Co-evolving Patterns in Temporal Networks of Varying Evolution.
Proceedings of the 10th ACM International Conference on Bioinformatics, 2019

2018
Counting motifs in dynamic networks.
BMC Syst. Biol., 2018

Practical dynamic de Bruijn graphs.
Bioinform., 2018

A Succinct Solution to Rmap Alignment.
Proceedings of the 18th International Workshop on Algorithms in Bioinformatics, 2018

Prefix-Free Parsing for Building Big BWTs.
Proceedings of the 18th International Workshop on Algorithms in Bioinformatics, 2018

Recoloring the Colored de Bruijn Graph.
Proceedings of the String Processing and Information Retrieval, 2018

Third-generation sequencing data analytics on mobile devices: cache oblivious and out-of-core approaches as a proof-of-concept.
Proceedings of the 15th International Conference on Mobile Systems and Pervasive Computing (MobiSPC 2018) / The 13th International Conference on Future Networks and Communications (FNC-2018) / Affiliated Workshops, 2018

Identification of Co-evolving Temporal Networks.
Proceedings of the 2018 ACM International Conference on Bioinformatics, 2018

2017
MEGARes: an antimicrobial resistance database for high throughput sequencing.
Nucleic Acids Res., 2017

Succinct colored de Bruijn graphs.
Bioinform., 2017

Disentangled Long-Read De Bruijn Graphs via Optical Maps.
Proceedings of the 17th International Workshop on Algorithms in Bioinformatics, 2017

2016
Exploring Non-touchscreen Gestures for Smartwatches.
Proceedings of the 2016 CHI Conference on Human Factors in Computing Systems, 2016

2015
The Generating Function Approach for Peptide Identification in Spectral Networks.
J. Comput. Biol., 2015

Misassembly detection using paired-end sequence reads and optical mapping data.
Bioinform., 2015

Relative Select.
Proceedings of the String Processing and Information Retrieval, 2015

Consensus Patterns (Probably) Has no EPTAS.
Proceedings of the Algorithms - ESA 2015, 2015

Variable-Order de Bruijn Graphs.
Proceedings of the 2015 Data Compression Conference, 2015

Elucidating the role and use of bioinformatics software in life science research.
Proceedings of the 2015 British HCI Conference, Lincoln, United Kingdom, July 13-17, 2015, 2015

Fast and efficient compression of high-throughput sequencing reads.
Proceedings of the 6th ACM Conference on Bioinformatics, 2015

2014
SeeSite: Characterizing Relationships between Splice Junctions and Splicing Enhancers.
IEEE ACM Trans. Comput. Biol. Bioinform., 2014

HyDA-Vista: Towards Optimal Guided Selection of k-mer Size for Sequence Assembly.
CoRR, 2014

Efficient Indexed Alignment of Contigs to Optical Maps.
Proceedings of the Algorithms in Bioinformatics - 14th International Workshop, 2014

2013
On approximating string selection problems with outliers.
Theor. Comput. Sci., 2013

SpliceGrapherXT: From Splice Graphs to Transcripts Using RNA-Seq.
Proceedings of the ACM Conference on Bioinformatics, 2013

2012
On the Hardness of Counting and Sampling Center Strings.
IEEE ACM Trans. Comput. Biol. Bioinform., 2012

SEQuel: improving the accuracy of genome assemblies.
Bioinform., 2012

2011
Outlier Detection for DNA Fragment Assembly
CoRR, 2011

Closest string with outliers.
BMC Bioinform., 2011

The Bounded Search Tree Algorithm for the Closest String Problem Has Quadratic Smoothed Complexity.
Proceedings of the Mathematical Foundations of Computer Science 2011, 2011

2010
Combinatorial and Probabilistic Approaches to Motif Recognition.
PhD thesis, 2010

Fast motif recognition via application of statistical thresholds.
BMC Bioinform., 2010

Why Large Closest String Instances Are Easy to Solve in Practice.
Proceedings of the String Processing and Information Retrieval, 2010

2009
Faster Algorithms for Sampling and Counting Biological Sequences.
Proceedings of the String Processing and Information Retrieval, 2009

Detecting Motifs in a Large Data Set: Applying Probabilistic Insights to Motif Finding.
Proceedings of the Bioinformatics and Computational Biology, 2009

2008
On the Structure of Small Motif Recognition Instances.
Proceedings of the String Processing and Information Retrieval, 2008

2007
A Graph Clustering Approach to Weak Motif Recognition.
Proceedings of the Algorithms in Bioinformatics, 7th International Workshop, 2007

An Ant Colony Optimization Heuristic for the Combinatorial Auction Problem.
Proceedings of the 2007 International Conference on Artificial Intelligence, 2007

A Graphical Game Model of Drug Binding.
Proceedings of the 2007 International Conference on Artificial Intelligence, 2007


  Loading...