… Given nk-mers and c data sets, the color matrix is an n × c matrix of bits which describe the
presence or absence of each k-mer (in the rows) in each data set (in the columns). For an …

… b and c give respectively the dynamic programming functions for regular and large gaps
size. Anchors are shown as segments ending with green or blue dots with the same color code …

Motivation Nanopore long-read sequencing technology offers promising alternatives to high-throughput
short read sequencing, especially in the context of RNA-sequencing. However …

Evaluating metagenomic software is key for optimizing metagenome interpretation and focus
of the Initiative for the Critical Assessment of Metagenome Interpretation (CAMI). The CAMI …

… (C) A compressed de Bruijn graph can be obtained by merging nodes with a single outgoing
edge with nodes with a single incoming edge. This compression step is lossless. (D) The …

… , of size m  c where m ¼ L À k ş 1 is the number of k-mers in S and c the number of datasets.
… Thus the final query result for a given sequence S is a tuple containing c (possibly single-…

Motivation A plethora of methods and applications share the fundamental need to associate
information to words for high-throughput sequence analysis. Doing so for billions of k-mers …

… (C) Venn diagram of ASEs identified by the two pipelines after filtering out the poorly … in
the 3 categories defined in the Venn diagram of panel C: ASE identified only by FaRLine, ASE …

… On these three datasets, Daccord failed to run, as DALIGNER could not perform alignment,
for the same reason as for the simulated C. elegans datasets. For all the datasets, CONSENT …

… In this way, only one Bloom filter is stored in RAM at a given time (C if C threads are used to
… to be queried (C Bloom filters can be loaded simultaneously in RAM if C threads are used). …