DLDominique Lavenier

Dominique Lavenier

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

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Dominique Lavenier has a total of 125 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Evaluating Energy Efficiency of Genomics Algorithms on Processing-in-Memory Architectures

    by Meven Mognol, Florestan De Moor, Erwan Drezen, Yann Falevoz, Dominique Lavenier

  • Open Access

    De-Bruijn graph partitioning for scalable and accurate DNA storage processing

    by Florestan De Moor, Olivier Boullé, Dominique Lavenier

    Motivation: DNA-based data storage offers a compelling solution for long-term, high-density archiving. In this framework, accurately reconstructing high-quality encoded sequences after sequencing is critical, as it directly impacts the design of error-correcting codes optimized for DNA storage. Furthermore, efficient and scalable processing is essential to manage the large volumes of data expected in such applications. Results: We introduce a novel method based on de-Bruijn graph partitioning, enabling fast and accurate processing of sequencing data regardless of the underlying sequencing technology and without requiring prior knowledge of the information encoded in the oligonucleotides. Evaluated on both synthetic and real datasets, the method achieves excellent precision and recall. It is implemented in C++ within the software ConCluD and optimized for multi-core servers. Our experiments show that a dataset of 89 million reads, corresponding to a 10 GB fasta file, can be fully processed in less than a minute on a standard 32-cores server. Availability and implementation: The ConCluD software and the scripts to reproduce the experiments from this paper are available at https://gitlab.inria.fr/pim/org.pim.dnarxiv under the GNU AGPLv3 licence. An archival snapshot of the repository is also provided at https://doi.org/10.5281/zenodo.17160067.

  • Open Access

    Comprehensive Annotation of Olfactory and Gustatory Receptor Genes and Transposable Elements Revealed Their Evolutionary Dynamics in Aphids

    by Sergio Gabriel Olvera-Vazquez, Xilong Chen, Aurélie Mesnil, Camille Meslin, Fabricio Almeida-Silva, Johann Confais, Yann Bourgeois, Gianluca Lombardi, Célia Lougmani, Karine Alix, et al.

    Gene duplication and transposable elements (TEs) are major drivers of genomic innovation that can fuel adaptation. While the roles of duplication and TE-driven diversification are documented in plant pathogens, they remain insufficiently explored in insect pests such as aphids, where olfactory (OR) and gustatory receptor (GR) genes are key to host recognition. We analyzed 521 OR and 399 GR genes, alongside TEs, across 12 aphid genomes with varying host ranges. Aphid lineages with broader host ranges exhibited higher evolutionary rates, driven by gene family expansions linked to host interaction, including lipid metabolism, immune function, and transposase activity. OR and GR genes evolved through proximal and tandem duplications and were shaped by diversifying selection, with bursts of positive selection followed by prolonged purifying selection, consistent with adaptation to novel hosts. Younger TEs were significantly enriched near OR genes compared to GRs and other genomic regions, suggesting a catalytic role of TEs in their diversification. However, OR proteins encoded by TE-associated ORs exhibited reduced functional potential. In contrast, GR proteins encoded by TE-associated GRs retained signatures of adaptation, as inferred from deep learning models predicting functionally important protein regions. These findings suggest that TE activity may facilitate functional innovation in GRs while alleviating constraints or pseudogenization in ORs. This study reveals how duplication, selection, and TE dynamics shape gene evolution in insect pests. It also provides the first chromosome-scale genome assembly of Dysaphis plantaginea, with comprehensive annotations and functional predictions of OR/GR genes, bridging adaptive evolution with mechanistic insights.


  • Open Access

    De Bruijn Graph Partitioning for Scalable and Accurate DNA Storage Processing

    by Florestan De Moor, Olivier Boullé, Dominique Lavenier

    Motivation DNA-based data storage offers a compelling solution for long-term, high-density archiving. In this framework, accurately reconstructing high-quality encoded sequences after sequencing is critical, as it has a direct impact on the design of error-correcting codes optimized for DNA storage. Furthermore, efficient and scalable processing is essential to manage the large volumes of data expected in such applications. Results We introduce a novel method based on de Bruijn graph partitioning, enabling fast and accurate processing of sequencing data regardless of the underlying sequencing technology and without requiring prior knowledge of the information encoded in the oligonucleotides. Evaluated on both synthetic and real datasets, the method achieves excellent precision and recall. It is implemented in C++ within the software ConCluD and optimized for multi-core servers. Our experiments demonstrated that a dataset of 55 million reads, corresponding to a 135 MB binary file, can be processed in less than 10 minutes on a 16 hyper-threaded core server.

  • Open Access

    A Dynamic Sliding Window Encoding for Secured DNA Data Storage Compliant With Biological and Indexing Constraints

    by Chloé Berton, Gouenou Coatrieux, Héléne Gasnier, Sahar Haddad, Reda Bellafqira, Dominique Lavenier

    In this paper, we propose a novel dynamic sliding window encoding for storing encrypted data in a DNA form taking into account biological constraints (G-C content and homopolymers) and prohibited nucleotide motifs used for data indexing. Its originality is twofold. First, it stands on a new dynamic encoding (DE) which takes advantage of variable length DNA codewords to encode binary data and to avoid homopolymers longer than N bases. Second, DE is combined with a sliding window strategy to detect whether a prohibited motif is about to appear. In this case, our proposal will add a non-coding base to the sequence to prevent the encoding of this motif. Unlike existing schemes, its scaling for high values of N and of prohibited motifs is extremely simple. It is furthermore independent of the cryptosystem. We provide the theoretical information rate of our proposal for a given number of prohibited motifs and a maximum homopolymer length. In general, it offers much higher performances, particularly in terms of information rate, than existing schemes while controlling G-C content with an extremely high probability. Moreover, experiments conducted with a recent DNA storage chain simulator show that our proposal does not require more copies than other encoding strategies for the correct reading of DNA sequences.


  • Open Access

    Parallelization of the Banded Needleman & Wunsch Algorithm on UPMEM PiM Architecture for Long DNA Sequence Alignment

    by Meven Mognol, Dominique Lavenier, Julien Legriel

    Sequence alignment is an ubiquitous task in genomics analysis whose performance can be affected by the memory-wall on a processor-centric architecture. Processing-in-Memory (PiM) architectures provide a memory system with integrated computing capabilities to alleviate this bottleneck. In this paper, we present a long read optimized version of the Needleman and Wunsch (N&W) algorithm based on PiM devices developed by the UPMEM company. Such memories add 128 computing units to a standard 16GB DIMM. On a server equipped with 20 UPMEM PiMs, our N&W implementation outperforms standard alignment tools by an order of magnitude compared to a traditional multicore server. Code available at https://github.com/upmem/usecase_dpu_alignment.


  • Open Access

    Fully in vitro iterative construction of a 24 kb-long artificial DNA sequence to store digital information

    by Julien Leblanc, Olivier Boulle, Emeline Roux, Jacques Nicolas, Dominique Lavenier, Yann Audic

    In the absence of a DNA template, the ab initio production of long double-stranded DNA molecules of predefined sequences is particularly challenging. The DNA synthesis step remains a bottleneck for... Tweetable abstract Minion-controlled ab initio production of long DNA molecules of predefined sequences from commercially available short DNA blocks in less than 3 days. Multidisciplinary abstract DNA molecules are easily copied from pre-existing DNA molecules. However, in the absence of a pre-existing DNA template, the ab initio production of long DNA molecules of... Method summary We developed, using Golden gate assembly, an iterative DNA assembly pipeline to produce long double-stranded DNA molecules of predefined sequences. This pipeline relies on the orderl...


  • Open Access

    “In vitro construction and long read sequencing analysis of a 24 kb long artificial DNA sequence encoding the Universal Declaration of the Rights of Man and of the Citizen ”

    by Julien Leblanc, Olivier Boulle, Emeline Roux, Jacques Nicolas, Dominique Lavenier, Yann Audic

    In absence of DNA template, the ab initio production of long double-stranded DNA molecules of predefined sequences is particularly challenging. The DNA synthesis step remains a bottleneck for many applications such as functional assessment of ancestral genes, analysis of alternative splicing or DNA-based data storage. We propose in this report a fully in vitro protocol to generate very long double-stranded DNA molecule starting from commercially available short DNA blocks in less than 3 days. This innovative application of Golden Gate assembly allowed us to streamline the assembly process to produce a 24 kb long DNA molecule storing part of the Universal Declaration of Human rights and citizens. The DNA molecule produced can be readily cloned into suitable host/vector system for amplification and selection.


  • Open Access

    Variant Calling Parallelization on Processor-in-Memory Architecture

    by Dominique Lavenier, Remy Cimadomo, Romaric Jodin

    In this paper, we introduce a new combination of software and hardware PIM (Process-in-Memory) architecture to accelerate the variant calling genomic process. PIM translates into bringing data intensive calculations directly where the data is: within the DRAM, enhanced with thousands of processing units. The energy consumption, in large part due to data movement, is significantly lowered at a marginal additional hardware cost. Such design allows an unprecedented level of parallelism to process billions of short reads. Experiments on real PIM devices developed by the UPMEM company show significant speed-up compared to pure software implementation. The PIM solution also compared nicely to FPGA or GPU based acceleration bringing similar to twice the processing speed but most importantly being 5 to 8 times cheaper to deploy with up to 6 times less power consumption.


  • Open Access

    SVJedi: Genotyping structural variations with long reads

    by Lolita Lecompte, Pierre Peterlongo, Dominique Lavenier, Claire Lemaitre

    Motivation Studies on structural variants (SV) are expanding rapidly. As a result, and thanks to third generation sequencing technologies, the number of discovered SVs is increasing, especially in the human genome. At the same time, for several applications such as clinical diagnoses, it is important to genotype newly sequenced individuals on well defined and characterized SVs. Whereas several SV genotypers have been developed for short read data, there is a lack of such dedicated tool to assess whether known SVs are present or not in a new long read sequenced sample, such as the one produced by Pacific Biosciences or Oxford Nanopore Technologies. Results We present a novel method to genotype known SVs from long read sequencing data. The method is based on the generation of a set of reference sequences that represent the two alleles of each structural variant. Long reads are aligned to these reference sequences. Alignments are then analyzed and filtered out to keep only informative ones, to quantify and estimate the presence of each SV allele and the allele frequencies. We provide an implementation of the method, SVJedi, to genotype insertions and deletions with long reads. The tool has been applied to both simulated and real human datasets and achieves high genotyping accuracy. We also demonstrate that SV genotyping is considerably improved with SVJedi compared to other approaches, namely SV discovery and short read SV genotyping approaches. Availability https://github.com/llecompte/SVJedi.git Contact lolita.lecompte{at}inria.fr