Considering a set of intervals on the real line, an interval graph records these intervals as nodes and their intersections as edges. Identifying (i.e.
Nanopore long-read sequencing technology offers promising alternatives to high-throug
Summary: We implemented the Self-Organizing Maps algorithm running efficiently on GPUs, and also provide several clustering methods of the resulting maps.
Motivation: In this work we present REINDEER, a novel computational method that performs indexing of sequences and records their abund
K-mer based methods have become prevalent in many
Viral evolutionary analyses are confronted with increasingly large sequence data sets, both in terms of sequence length and number of sequences.
The analysis of biological sequencing data has been one of the biggest applications of string algorithms.
High-throughput sequencing data sets are usually deposited in public repositories (e.g., the European Nucleotide Archive) to ensure reproducibility.