A Scalable Indexing Solution to Mine Huge Genomic Sequence Collections - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Journal Articles ERCIM News Year : 2012

A Scalable Indexing Solution to Mine Huge Genomic Sequence Collections

Abstract

With High Throughput Sequencing (HTS) technologies, biology is experiencing a sequence data deluge. A single sequencing experiment currently yields 100 million short sequences, or reads, the analysis of which demands efficient and scalable sequence analysis algorithms. Diverse kinds of applications repeatedly need to query the sequence collection for the occurrence positions of a subword. Time can be saved by building an index of all subwords present in the sequences before performing huge numbers of queries. However, both the scalability and the memory requirement of the chosen data structure must suit the data volume. Here, we introduce a novel indexing data structure, called Gk arrays, and related algorithms that improve on classical indexes and state of the art hash tables.
Fichier principal
Vignette du fichier
Rivals-etal-ERCIM-News-89-5p.pdf (1.05 Mo) Télécharger le fichier
Origin Publisher files allowed on an open archive

Dates and versions

lirmm-00712653 , version 1 (27-06-2012)

Identifiers

  • HAL Id : lirmm-00712653 , version 1

Cite

Eric Rivals, Nicolas Philippe, Mikael Salson, Martine Léonard, Thérèse Commes, et al.. A Scalable Indexing Solution to Mine Huge Genomic Sequence Collections. ERCIM News, 2012, 2012 (89), pp.20-21. ⟨lirmm-00712653⟩
385 View
1771 Download

Share

Gmail Mastodon Facebook X LinkedIn More