Title :

Querying Large Read Collections in Main Memory: A Versatile data Structure

Author(s) :

Philippe, Nicolas [Auteur]
Méthodes et Algorithmes pour la Bioinformatique [MAB]
Salson, Mikael [Auteur]
Bioinformatics and Sequence Analysis [BONSAI]
Lecroq, Thierry [Auteur]
Laboratoire d'Informatique, de Traitement de l'Information et des Systèmes [LITIS]
Léonard, Martine [Auteur]
Laboratoire d'Informatique, de Traitement de l'Information et des Systèmes [LITIS]
Commes, Thérèse [Auteur]
Centre de recherche en Biologie Cellulaire [CRBM]
Rivals, Eric [Auteur correspondant]
Méthodes et Algorithmes pour la Bioinformatique [MAB]

Journal title :

BMC Bioinformatics

Pages :

242-258

Publisher :

BioMed Central

Publication date :

2011-06-17

ISSN :

1471-2105

English keyword(s) :

NGS
algorithm
reads
indexation
structure
bioinformatic
transcriptomic
genomic

HAL domain(s) :

Informatique [cs]/Bio-informatique [q-bio.QM]
Sciences du Vivant [q-bio]/Bio-Informatique, Biologie Systémique [q-bio.QM]
Informatique [cs]/Algorithme et structure de données [cs.DS]

English abstract : [en]

Background High Throughput Sequencing (HTS) is now heavily exploited for genome (re-) sequencing, metagenomics, epigenomics, and transcriptomics and requires different, but computer intensive bioinformatic analyses. When ...
Show more >Background High Throughput Sequencing (HTS) is now heavily exploited for genome (re-) sequencing, metagenomics, epigenomics, and transcriptomics and requires different, but computer intensive bioinformatic analyses. When a reference genome is available, mapping reads on it is the first step of this analysis. Read mapping programs owe their efficiency to the use of involved genome indexing data structures, like the Burrows-Wheeler transform. Recent solutions index both the genome, and the k-mers of the reads using hash-tables to further increase efficiency and accuracy. In various contexts (e.g. assembly or transcriptome analysis), read processing requires to determine the sub-collection of reads that are related to a given sequence, which is done by searching for some k-mers in the reads. Currently, many developments have focused on genome indexing structures for read mapping, but the question of read indexing remains broadly unexplored. However, the increase in sequence throughput urges for new algorithmic solutions to query large read collections efficiently. Results Here, we present a solution, named Gk arrays, to index large collections of reads, an algorithm to build the structure, and procedures to query it. Once constructed, the index structure is kept in main memory and is repeatedly accessed to answer queries like "given a k-mer, get the reads containing this k-mer (once/at least once)". We compared our structure to other solutions that adapt uncompressed indexing structures designed for long texts and show that it processes queries fast, while requiring much less memory. Our structure can thus handle larger read collections. We provide examples where such queries are adapted to different types of read analysis (SNP detection, assembly, RNA-Seq). Conclusions Gk arrays constitute a versatile data structure that enables fast and more accurate read analysis in various contexts. The Gk arrays provide a flexible brick to design innovative programs that mine efficiently genomics, epigenomics, metagenomics, or transcriptomics reads. The Gk arrays library is available under Cecill (GPL compliant) license from http://www.atgc-montpellier.fr/ngs/ webcite.Show less >

Language :

Anglais

Peer reviewed article :

Oui

Audience :

Internationale

Popular science :

Non

Collections :

• Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189

Source :

Harvested from HAL