CMCamille Marchet

Camille Marchet

*This is an algorithmically generated author record based on publicly available information.

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Camille Marchet has a total of 136 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Extracting and Updating Compact Colored k -mer Indexes

    by Lore Depuydt, Jarno N. Alanko, Camille Marchet, Simon J. Puglisi

    Colored k -mer indexes record, for every k -mer of a collection of genomes, the genomes or species that contain it, and underpin pseudoalignment and sequence search against large collections. Construction of such an index is expensive, yet the collection it represents is rarely final: genomes are retracted or found to be contaminated, users need an index of a single species or clade, and new genomes keep arriving. Rebuilding the index after every such change requires the original sequences and repeats the costly construction. We show that colored indexes based on the spectral Burrows-Wheeler transform (SBWT) can instead be updated efficiently in batches, without the original sequences, and with a result equivalent to the index built from scratch. Given an SBWT and any subset of its k -mers, we first extract the SBWT of this subset directly from the input, in one linear pass and without building a new index. Removing genomes, intersection and difference all reduce to this operation. We then carry the colors through every operation, by finding from the inputs alone where the color sets of the result change, so that removing or extracting genomes, as well as the union, intersection and difference of two colored indexes, each directly yield a complete colored index. In our experiments, editing paid off for large results: removing a genome from an index of 3 682 E. coli genomes took 54 seconds instead of 13 minutes for a rebuild, and adding one took about a minute. On AllTheBacteria, with 192 billion k -mers and 12 733 species, extracting M. tuberculosis , with 180 094 genomes, took less than four hours, and set operations then traced contamination of its color, some of which the next release of AllTheBacteria still contains. Our work turns large colored k -mer indexes from static snapshots of a collection into resources that can be maintained as the collection evolves. Our implementation is available at https://github.com/LoreDepuydt/colored-sbwt-setops .

  • Open Access

    spearfish: ultrafast Δ-mapping of long reads to redundant transcriptomes

    by Hesham Abdelgawad, Igor Martayan, Camille Marchet, Rob Patro

    In a transcriptome, isoforms share most of their sequence, and gene families add further near-copies. Yet most long-read mappers treat each isoform as a separate target and repeat seeding, chaining and alignment for each. We introduce spearfish, a long-read mapper built for this redundancy. Its delta mapping (Δ-mapping) computes each target's alignment-score difference from the best candidate. It skips sequence that all candidates share, which cannot change the difference, and aligns where they differ once per distinct sequence rather than once per target. Seeds come from locally consistent parsing (LCP), so every isoform that contains an exon receives the same seeds in its interior. Collapsing them gives a core graph, a de Bruijn-like graph whose size is bounded by the distinct exonic sequence plus a small term per splice junction, independent of the number of isoforms. Over this graph, spearfish computes the exact colinear chaining score of every candidate transcript, sharing dynamic-programming state among transcripts via a procedure which we prove is equivalent to chaining on each transcript separately. Across RNA-seq experiments, using 32 threads, spearfish maps reads 24–102× faster than minimap2 in under a quarter of the memory, and 2.5–11.5× faster than lr-kallisto's pseudoalignment. On simulated reads it ranks the true transcript first more often than minimap2 on HiFi reads and at least as often on ONT reads. When using spearfish's Δ-mapping with oarfish for abundance estimation, the abundance estimates match or improve on those that make use of minimap2's alignments on both simulated reads (with or without primers and poly(A) tails) and on seven SG-NEx runs with spike-ins, and quantification is 4.1–8.8× faster than lr-kallisto in going from reads to abundances.

  • The Vizitig pangenome and pantranscriptome explorer

    by Bastien Degardins, Charles Paperman, Camille Marchet

    Vizitig is the first platform for real-time exploration and querying of DNA and RNA sequence de Bruijn graphs across many samples, unifying visualization, metadata, and flexible search. It constructs compacted colored de Bruijn graphs from raw sequencing reads and reference sequences and then provides an interactive web interface for graph exploration. It integrates raw and reference-based data, handles complex variation, and provides a human-readable feature-based (also referred to as metadata) query language with scalable graph loading. Its domain-specific query language supports composable searches combining sequences of arbitrary size, genomic features such as gene or exon identifiers, and experimental factors such as sample identifiers or abundance thresholds. On-demand subgraph loading retrieves only regions of interest, enabling interactive exploration of large data sets in the graphical user interface without loading the entire graph into memory. We demonstrate Vizitig's capabilities through case studies in pantranscriptomics and pangenomics. In pantranscriptomics, we recover fusion transcript breakpoints on long and short reads. In pangenomics, we explore sequence variations across yeast, rice, nematode, and human pangenomes. Vizitig scales from small virus genomes to human-scale pangenomes (our largest experiment comprises up to 20 assembled human haplotypes, on a laptop). Vizitig enables fast, reproducible analysis in both pangenomics and pantranscriptomics while providing a deployable and user-friendly working environment.

  • Open Access

    Fast Set Operations for Compact k -mer Sets

    by Jarno N. Alanko, Lore Depuydt, Camille Marchet, Simon J. Puglisi

    The k -mer spectrum of a set of sequences is the set of k -length substrings the sequences contain. This lossy representation of sequence content pervades modern genomics. Recently, the spectral Burrows-Wheeler transform (SBWT) has emerged as a space-efficient representation of k -spectra that also supports efficient k -mer lookup queries and, more generally, easy navigation of the de Bruijn graph of the k -spectrum. In this paper, we examine primitive set operations, such as intersection, union, and set difference, on SBWT-encoded k -spectra and show that these operations can be supported efficiently. Moreover, efficient merging leads directly to a new memory-efficient algorithm for SBWT construction, which was able to build the SBWT for the 661K bacterial dataset containing 88 billion distinct k -mers in 50 hours using 186 GiB of RAM and 112 GiB of disk space. Given the pervasiveness of k -mer sets in genomics and the continued rapid growth of genomic databases, our work opens the door to a wide array of future applications that manipulate and reason about genomic data by dealing directly with simultaneously compact and searchable k -mer set representations offered by the SBWT. 2012 ACM Subject Classification: Theory of computation → Design and analysis of algorithms Digital Object Identifier: 10.4230/LIPIcs.WABI.2026. Supplementary Material: Software (Source Code) : https://github.com/LoreDepuydt/sbwt-set-operations Funding: This work has benefited from funding from the French State under the France 2030 program, reference ANR-21-IDES-0006. The European Metropolis of Lille and the University of Lille are also acknowledged for their funding and support of the project WILL-CHAIRES-25-001-BOSSA.


  • Open Access

    KaryoScope: rapid, alignment-free sequence annotation for the pangenome era

    by Timothy Rhyker Ranallo-Benavidez, Yi-An Chen, Tamara Potapova, Jarno N Alanko, Hailey Loucks, Julian Lucas, Human Pangenome Reference Consortium (HPRC), Andrea Guarracino, Simon J. Puglisi, Camille Marchet, et al.

    The pangenome era is producing long-read sequencing data and complete genome assemblies at a pace that current annotation methods cannot match. Existing tools were each built for a single feature class (repeats, centromeric satellites, or genes) and falter precisely where the genome is most variable and harbours clinically important variation: the centromeres, subtelomeres, and acrocentric short arms. Here we present KaryoScope, an alignment-free method to annotate an assembly at base resolution across any desired feature classes in a single pass, completing in minutes on a standard workstation. Applied to the Human Pangenome Reference Consortium Release 2 assemblies, KaryoScope identifies the SST1 macrosatellite as the recurrent sequence at Robertsonian translocation fusion points, delivers the first pangenome-wide census of D4Z4 macrosatellite structural diversity at the 4q and 10q subtelomeres relevant to facioscapulohumeral muscular dystrophy, and reveals previously uncharacterized centromere structural polymorphism, including chromosome-specific satellite loss and megabase-scale rearrangement validated by fluorescence in situ hybridization. A pre-built KaryoScope database for the human genome is distributed alongside the tool, and additional databases can be built for any reference genome or annotation source. Together, these capabilities bring the most variable regions of the genome within reach for comparative, clinical, and pangenome-scale analysis. KaryoScope is available at https://github.com/barthel-lab/KaryoScope.


  • Open Access

    Metappuccino: large language model-driven reconstruction of sequence read archive metadata for cancer research

    by Fiona Hak, Camille Marchet, Daniel Gautheret, Mélina Gallopin

    Motivation: High-throughput RNA sequencing has significantly advanced transcriptomic profiling in oncology. Millions of RNA-seq datasets have accumulated in public databases such as the Sequence Read Archive (SRA). However, fragmented, ambiguous, or missing metadata can severely limit accurate cohort selection, introduce bias, and delay discoveries. Results: To address these issues, we introduce ‘Metappuccino’, a hybrid metadata enrichment tool built on Mistral-7B-Instruct and specialized via low-rank adaptation (LoRA). Metappuccino reconstructs 19 metadata classes (e.g. organ, disease, cell type) by combining deterministic extraction/normalization with model-based completion: 4 submission-mandatory fields are read directly from SRA/API records, while the remaining 15 classes are obtained through validated rule-based extraction when explicitly supported by the context and otherwise predicted by the LoRA-specialized model when information is missing or ambiguous. To promote robust, context-aware inference rather than memorization, we designed training and data partitioning to minimize leakage and preserve generalization. When applicable, predicted values are mapped to standardized ontologies to ensure consistent, interoperable annotations. Across our benchmarks, Metappuccino substantially improves accuracy over the base model, matches or exceeds recent larger open-source LLMs, and reduces inference time by up to two-fold relative to these baselines. By enriching under-annotated public RNA-seq records, Metappuccino increases the usability of SRA datasets for large-scale reuse, with applications that extend beyond oncology transcriptomics. Availability and implementation: Metappuccino source code is available on: github.com/chumphati/Metappuccino. The fine-tuned LLM, MetappuccinoLLModel, is available on: huggingface.co/chumphati/MetappuccinoLLModel. Both repositories are released under Apache-2.0 license.


  • From reads to transcripts : de novo methods for the analysis of transcriptome second and third generation sequencing

    by Camille Marchet

    Des lectures aux transcrits : méthodes de novo pour l'analyse du séquençage des transcriptomes de deuxième et troisième génération: Le but de ce travail de thèse est de permettre le traitement de données issues du séquençage de transcriptomes, c'est-à-dire les séquences d'ARN messager, qui reflètent l’expression des gènes. Plus précisément, il s’agit mettre à profit les caractéristiques des données produites par les nouvelles technologies de séquençage, dites de troisième génération (TGS). Ces technologies produisent des séquences de grande taille, qui peuvent couvrir la longueur totale des molécules d'ARN. Ceci présente l’avantage d’éviter la phase d’assemblage des séquences, une étape source de difficultés et d'erreurs mais nécessaire avec les données générées par les précédentes technologies de séquençage appelées NGS. En revanche, les données TGS sont bruitées (jusqu’à 15% d’erreurs de séquençage), nécessitant le développement de nouveaux algorithmes pour analyser ces données. Les travaux de cette thèse ont essentiellement consisté au développement méthodologique et à l’implémentation de nouveaux algorithmes permettant le regroupement des séquences TGS par gène, puis à leur correction et enfin à la détection des différents isoformes de chaque gène.

  • Open Access

    Helicase: Vectorized parsing and bitpacking of genomic sequences

    by Igor Martayan, Loup Lobet, Camille Marchet, Charles Paperman

    Modern sequencing pipelines routinely produce billions of reads, yet the dominant storage formats (FASTQ and FASTA) are text-based and sequential, making high-throughput parsing a persistent bottleneck in bioinformatics. Their regular, line-oriented structure makes them well-suited to SIMD vectorization, but existing libraries do not fully exploit it. We present vectorized algorithms for high-throughput FASTA/Q parsing, with on-the-fly handling of non-ACTG characters and built-in bitpacking of DNA sequences into multiple compact representations. The parsing logic is expressed as a finite state machine, compiled into efficient SIMD programs targeting both x86 and ARM CPUs. These algorithms are implemented in Helicase , a Rust library exposing a tunable interface that retrieves only caller-requested fields, minimizing unnecessary work. Exhaustive benchmarks across a wide range of CPUs show that Helicase meets or exceeds the throughput of all evaluated state-of-the-art libraries, making it the fastest general-purpose FASTA/Q parser to our knowledge. Availability: https://github.com/imartayan/helicase .


  • Open Access

    Minimizer Density revisited: Models and Multiminimizers

    by Florian Ingels, Lucas Robidou, Igor Martayan, Camille Marchet, Antoine Limasset

    High-throughput sequence analysis commonly relies on k -mers (words of fixed length k ) to remain tractable at modern scales. These k -mer-based pipelines can employ a sampling step, which in turn allows grouping consecutive k -mers into larger strings to improve data locality. Although other sampling strategies exist, local schemes have become standard: such schemes map each k -mer to the position of one of its characters. A key performance measure of these schemes is their density, defined as the expected fraction of selected positions. The most widely used local scheme is the minimizer scheme: given an integer m ≤ k , a minimizer scheme associates each k -mer to the starting position of one of its m -mers, called its minimizer . Being a local scheme, the minimizer scheme guarantees covering all k -mers of a sequence, with a maximal distance between selected positions of w = k − m + 1. Recent works have established near-tight lower bounds on achievable density under standard assumptions for local schemes, and state-of-the-art schemes now operate close to these limits, suggesting that further improvements under the classical notion of density will face diminishing returns. Hence, in this work, we aim to revisit the notion of density and broaden its scope. As a first contribution, we draw a link between density and the distance between consecutive selected positions. We propose a probabilistic model allowing us to establish that the density of a local scheme is exactly the inverse of the expected distance between the positions it selects, under the minimal and only assumption that said distances are somehow equally distributed. We emphasize here that our model makes no assumptions about how positions are selected, unlike the classical models in the literature. Our result introduces a novel method for computing the density of a local scheme, extending beyond classical settings. Based on this analysis, we introduce a novel technique, named multiminimizers, by associating each k -mer with a bounded set of candidate minimizers rather than a single one. The candidate furthest away (in a precise sense defined in the article) is selected. Since the decision is made by taking advantage of a context beyond a single k -mer, this technique is not a local scheme — and belong to a novel category of meta schemes. Using the multiminimizer trick on a local scheme reduces its density at the expense of a controlled increase in computation time. We show that this method, when applied to random (hash-based) minimizers and to open-closed mod-minimizers, approaches a density of , representing, to our knowledge, the first construction converging to this limit. Our third contribution is the introduction of the deduplicated density , which measures the fraction of distinct minimizers used to cover all k -mers of a set of sequences. While this problem has gained traction in applications such as assembly, filtering, and pattern matching, standard minimizer schemes are often used as a proxy, blurring the distinction between the two objectives (minimizing the number of selected positions or the number of selected minimizers). Although related to the classical notion of density, deduplicated density differs in both definition and suitable constructions, and must be analyzed in its own right, together with its precise connections to standard density. We show that multiminimizers can also improve this metric, but that globally minimizing deduplicated density in this setting is NP-complete, and we instead propose a local heuristic with strong empirical behavior. Finally, we show that multiminimizers can be computed efficiently, and provide a SIMD-accelerated Rust implementation together with proofs of concept demonstrating reduced memory footprints on core sequence-analysis tasks. We conclude with open theoretical and practical questions that remain to be addressed in the area of density.

  • Open Access

    Metappuccino: Large Language Model-driven Reconstruction of Sequence Read Archive Metadata for Cancer Research

    by Fiona Hak, Camille Marchet, Daniel Gautheret, Mélina Gallopin

    Motivation: High-throughput RNA-sequencing has significantly advanced transcriptomic profiling in on-cology. Millions of RNA-seq datasets have accumulated in public databases such as the Sequence Read Archive-SRA. However, fragmented, ambiguous or missing metadata can severely limit accurate cohort selection, introduce bias and delay discoveries. Results: To address these issues, we introduce Metappuccino : a metadata enrichment tool based on a fine-tuned Mistral-7B-Instruct large language model with low-rank-adaptation (LoRA). Metappuccino can extract or infer 19 key metadata classes (e.g. organ, disease, cell type) from unstructured text. Fine-tuning was conducted with careful partitioning and training design to preserve the model’s generalisation capacity, reduce data leakage, and ensure robust, context-aware inference rather than memorisation. When possible, the inferred outputs are mapped to standardised ontologies, such as Cellosaurus, Disease Ontology and Uberon, to produce consistent metadata. As a result, the fine-tuned model achieves significantly improved class prediction accuracy over the base model, performing at least as well as recent large open-source models. Furthermore, it reduces inference time by up to at least two compared to the baseline models. As a pipeline, Metappuccino complements the LLM with well-established Natural Language Processing techniques from the literature to further improve performance. By enriching the metadata of under-annotated sequences, Metappuccino creates greater value from public RNA-seq datasets, with potential applications extending beyond oncology transcriptomics. Availability and Implementation: The source code of Metappuccino is available on GitHub : github. com/chumphati/Metappuccino. The fine-tuned LLM, MetappuccinoLLModel, is available on Hugging Face : huggingface.co/chumphati/MetappuccinoLLModel. Both repositories are released under Apache-2.0 license. Contact: fiona.hak@i2bc.paris-saclay.fr , daniel.gautheret@universite-paris-saclay.fr , melina.gallopin@i2bc.paris-saclay.fr