activity
20132019
most citedInformed and Automated k-Mer Size Selection for Genome Assembly

30 citations · 32 across the 2 of their papers we have counts for

collaborators

7 papers

cs.DS20192 cited

Parallel decompression of gzip-compressed files and random access to DNA sequences

Maël Kerbiriou, Rayan Chikhi

Decompressing a file made by the gzip program at an arbitrary location is in principle impossible, due to the nature of the DEFLATE compression algorithm. Consequently, no existing…

cs.DS2019

Data structures to represent a set of k-long DNA sequences

Rayan Chikhi, Jan Holub, Paul Medvedev

The analysis of biological sequencing data has been one of the biggest applications of string algorithms. The approaches used in many such applications are based on the analysis of…

cs.DM2018

Bipartite Graphs of Small Readability

Rayan Chikhi, Vladan Jovicic, Stefan Kratsch +4

We study a parameter of bipartite graphs called readability, introduced by Chikhi et al. (Discrete Applied Mathematics, 2016) and motivated by applications of overlap graphs in bio…

cs.DS2018

Dualities in Tree Representations

Rayan Chikhi, Alexander Schönhuth

A characterization of the tree such that , the reversal of is given. An immediate consequence is…

cs.DS2017

Using Minimum Path Cover to Boost Dynamic Programming on DAGs: Co-Linear Chaining Extended

Anna Kuosmanen, Topi Paavilainen, Travis Gagie +3

Aligning sequencing reads on graph representations of genomes is an important ingredient of pan-genomics. Such approaches typically find a set of local anchors that indicate plausi…

cs.DM2015

On the readability of overlap digraphs

Rayan Chikhi, Paul Medvedev, Martin Milanic +1

We introduce the graph parameter readability and study it as a function of the number of vertices in a graph. Given a digraph D, an injective overlap labeling assigns a unique stri…