Skip to content
2000
Volume 11, Issue 4
  • ISSN: 1574-8936
  • E-ISSN: 2212-392X

Abstract

Due to the NGS data deluge, sequence mapping has become an intensive task that, depending on the experiment, may demand high amounts of computing power or memory capacity. On the one hand, GPGPU architectures have become a cost-effective solution that outperforms common processors in specific tasks. On the other hand, out-of-core implementations allow to directly access data from secondary memory, which may be useful when mapping against big indexes in systems with low memory configurations. In this paper we discuss the implementation of backward search methods for inexact mapping in these two different study cases. A hybrid CPU-GPU implementation of a backward search algorithm capable of obtaining the pair-ends and the one error mappings of a read has been developed. This implementation can be used to increase the sensitivity and reduce the number of reads to be analysed with a dynamic programming approach. Also, a CPU out-of-core index using MMAP has been studied (provided by csalib). Such index can be used in memory limited scenarios, in which the time of loading many different big genomes into memory is greater than the time needed to map the reads.

Loading

Article metrics loading...

/content/journals/cbio/10.2174/1574893611666160212235359
2016-09-01
2025-06-18
Loading full text...

Full text loading...

/content/journals/cbio/10.2174/1574893611666160212235359
Loading

  • Article Type:
    Research Article
Keyword(s): Burrows-Wheeler; FM-Index; GPU; Inexact Mapping; MMAP; Suffix Array
This is a required field
Please enter a valid email address
Approval was a Success
Invalid data
An Error Occurred
Approval was partially successful, following selected items could not be processed due to error
Please enter a valid_number test