[PDF][PDF] Computational pan-genomics: status, promises and challenges

Briefings in bioinformatics, 2018 - academic.oup.com
Many disciplines, from human genetics and oncology to plant breeding, microbiology and
virology, commonly face the challenge of analyzing rapidly increasing numbers of genomes …

SKESA: strategic k-mer extension for scrupulous assemblies

A Souvorov, R Agarwala, DJ Lipman - Genome biology, 2018 - Springer
SKESA is a DeBruijn graph-based de-novo assembler designed for assembling reads of
microbial genomes sequenced using Illumina. Comparison with SPAdes and MegaHit …

FEELnc: a tool for long non-coding RNA annotation and its application to the dog transcriptome

V Wucher, F Legeai, B Hédan, G Rizk… - Nucleic acids …, 2017 - academic.oup.com
Whole transcriptome sequencing (RNA-seq) has become a standard for cataloguing and
monitoring RNA populations. One of the main bottlenecks, however, is to correctly identify …

Critical assessment of metagenome interpretation: the second round of challenges

F Meyer, A Fritz, ZL Deng, D Koslicki, TR Lesker… - Nature …, 2022 - nature.com
Evaluating metagenomic software is key for optimizing metagenome interpretation and focus
of the Initiative for the Critical Assessment of Metagenome Interpretation (CAMI). The CAMI II …

Denoising DNA deep sequencing data—high-throughput sequencing errors and their correction

D Laehnemann, A Borkhardt… - Briefings in …, 2016 - academic.oup.com
Characterizing the errors generated by common high-throughput sequencing platforms and
telling true genetic variation from technical artefacts are two interdependent steps, essential …

A fast and agnostic method for bacterial genome-wide association studies: Bridging the gap between k-mers and genetic events

M Jaillard, L Lima, M Tournoud, P Mahé… - PLoS …, 2018 - journals.plos.org
Genome-wide association study (GWAS) methods applied to bacterial genomes have
shown promising results for genetic marker discovery or detailed assessment of marker …

Compacting de Bruijn graphs from sequencing data quickly and in low memory

R Chikhi, A Limasset, P Medvedev - Bioinformatics, 2016 - academic.oup.com
Motivation: As the quantity of data per sequencing experiment increases, the challenges of
fragment assembly are becoming increasingly computational. The de Bruijn graph is a …

Bifrost: highly parallel construction and indexing of colored and compacted de Bruijn graphs

G Holley, P Melsted - Genome biology, 2020 - Springer
Memory consumption of de Bruijn graphs is often prohibitive. Most de Bruijn graph-based
assemblers reduce the complexity by compacting paths into single vertices, but this is …

Introducing BASE: the Biomes of Australian Soil Environments soil microbial diversity database

A Bissett, A Fitzgerald, T Meintjes, PM Mele, F Reith… - GigaScience, 2016 - Springer
Background Microbial inhabitants of soils are important to ecosystem and planetary
functions, yet there are large gaps in our knowledge of their diversity and ecology. The …

BFC: correcting Illumina sequencing errors

H Li - Bioinformatics, 2015 - academic.oup.com
BFC is a free, fast and easy-to-use sequencing error corrector designed for Illumina short
reads. It uses a non-greedy algorithm but still maintains a speed comparable to …