Present advances in sequencing technology make possible to generate large amounts of data in short time. However one major issue is represented by the fact that fragments produced by these high-throughput methods are short and in very high number, resulting in a difficult analytical task. Two different approaches are currently applied to genome assembly, overlap graph and sequence hashing. In particular SSAKE, one of the first and more popular implementation of the sequence hashing algorithm, was designed to leverage the information from short sequence reads by stringently assembling them into contiguous sequences that can be used to characterize novel sequencing targets. In this paper we present an implementation of this tool for the CUDA architecture.
A CUDA-based implementation of the SSAKE genomics application
D D'Agostino;A Clematis;L Milanesi;I Merelli
2012
Abstract
Present advances in sequencing technology make possible to generate large amounts of data in short time. However one major issue is represented by the fact that fragments produced by these high-throughput methods are short and in very high number, resulting in a difficult analytical task. Two different approaches are currently applied to genome assembly, overlap graph and sequence hashing. In particular SSAKE, one of the first and more popular implementation of the sequence hashing algorithm, was designed to leverage the information from short sequence reads by stringently assembling them into contiguous sequences that can be used to characterize novel sequencing targets. In this paper we present an implementation of this tool for the CUDA architecture.File | Dimensione | Formato | |
---|---|---|---|
prod_191035-doc_41032.pdf
non disponibili
Descrizione: A CUDA-based implementation of the SSAKE Genomics Application
Dimensione
138.97 kB
Formato
Adobe PDF
|
138.97 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.