Rayan Chikhi

Orcid: 0000-0003-1099-8735

According to our database1, Rayan Chikhi authored at least 42 papers between 2007 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Processing-in-memory for genomics workloads.
CoRR, June, 2025

Statistical signature of subtle behavioral changes in large-scale assays.
PLoS Comput. Biol., 2025

2024
Indexing and real-time user-friendly queries in terabyte-sized complex genomic datasets with kmindex and ORA.
Nat. Comput. Sci., 2024

Reference-free structural variant detection in microbiomes via long-read co-assembly graphs.
Bioinform., 2024

2022
<tt>k</tt> <tt>mdiff</tt>, large-scale and user-friendly differential <i>k</i>-mer analyses.
Bioinform., December, 2022

Data Structures to Represent a Set of <i>k</i>-long DNA Sequences.
ACM Comput. Surv., 2022

The K-mer File Format: a standardized and compact disk representation of sets of <i>k</i>-mers.
Bioinform., 2022

2021
A Tale of Optimizing the Space Taken by de Bruijn Graphs.
Proceedings of the Connecting with Computability, 2021

2020
yacrd and fpa: upstream tools for long-read genome assembly.
Bioinform., 2020

REINDEER: efficient indexing of k-mer presence and abundance in sequencing datasets.
Bioinform., 2020

Comparative assessment of long-read error correction software applied to Nanopore RNA-sequencing data.
Briefings Bioinform., 2020

Disk Compression of k-mer Sets.
Proceedings of the 20th International Workshop on Algorithms in Bioinformatics, 2020

A Graph-Theoretic Barcode Ordering Model for Linked-Reads.
Proceedings of the 20th International Workshop on Algorithms in Bioinformatics, 2020

2019
Sparse Dynamic Programming on DAGs with Small Width.
ACM Trans. Algorithms, 2019

Data structures to represent sets of k-long DNA sequences.
CoRR, 2019

Graph analysis of fragmented long-read bacterial genome assemblies.
Bioinform., 2019

Parallel Decompression of Gzip-Compressed Files and Random Access to DNA Sequences.
Proceedings of the IEEE International Parallel and Distributed Processing Symposium Workshops, 2019

2018
RecoverY: k-mer-based read classification for Y-chromosome-specific sequencing and assembly.
Bioinform., 2018

Practical dynamic de Bruijn graphs.
Bioinform., 2018

Using Minimum Path Cover to Boost Dynamic Programming on DAGs: Co-linear Chaining Extended.
Proceedings of the Research in Computational Molecular Biology, 2018

Dualities in Tree Representations.
Proceedings of the Annual Symposium on Combinatorial Pattern Matching, 2018

Bipartite Graphs of Small Readability.
Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

2017
Speeding up Dynamic Programming on DAGs through a Fast Approximation of Path Cover.
CoRR, 2017

Fast and Scalable Minimal Perfect Hashing for Massive Key Sets.
Proceedings of the 16th International Symposium on Experimental Algorithms, 2017

AllSome Sequence Bloom Trees.
Proceedings of the Research in Computational Molecular Biology, 2017

2016
Assembly scaffolding with PE-contaminated mate-pair libraries.
Bioinform., 2016

Compacting de Bruijn graphs from sequencing data quickly and in low memory.
Bioinform., 2016

2015
On the Readability of Overlap Digraphs.
Proceedings of the Combinatorial Pattern Matching - 26th Annual Symposium, 2015

2014
MindTheGap: integrated detection and assembly of short and long insertions.
Bioinform., 2014

GATB: Genome Assembly & Analysis Tool Box.
Bioinform., 2014

Informed and automated <i>k</i>-mer size selection for genome assembly.
Bioinform., 2014

On the Representation of de Bruijn Graphs.
Proceedings of the Research in Computational Molecular Biology, 2014

2013
DSK: <i>k</i>-mer counting with very low memory usage.
Bioinform., 2013

2012
Computational methods for de novo assembly of next-generation genome sequencing data. (Méthodes de calcul pour assemblage de novo de nouvelle génération des techniques de séquençage du génome).
PhD thesis, 2012

KISSPLICE: de-novo calling alternative splicing events from RNA-seq data.
BMC Bioinform., 2012

Mapsembler, targeted and micro assembly of large NGS datasets on a desktop computer.
BMC Bioinform., 2012

Compareads: comparing huge metagenomic experiments.
BMC Bioinform., 2012

Space-Efficient and Exact de Bruijn Graph Representation Based on a Bloom Filter.
Proceedings of the Algorithms in Bioinformatics - 12th International Workshop, 2012

2011
Localized Genome Assembly from Reads to Scaffolds: Practical Traversal of the Paired String Graph.
Proceedings of the Algorithms in Bioinformatics - 11th International Workshop, 2011

Parallel and Memory-Efficient Reads Indexing for Genome Assembly.
Proceedings of the Parallel Processing and Applied Mathematics, 2011

2009
Paired-end read length lower bounds for genome re-sequencing.
BMC Bioinform., 2009

2007
Combining Flash Memory and FPGAs to Efficiently Implement a Massively Parallel Algorithm for Content-Based Image Retrieval.
Proceedings of the Reconfigurable Computing: Architectures, 2007


  Loading...