4 search results - page 1 / 1 » pFANGS: Parallel high speed sequence mapping for Next Genera... |
IPPS
2010
IEEE
13 years 5 months ago
2010
IEEE
Millions of DNA sequences (reads) are generated by Next Generation Sequencing machines everyday. There is a need for high performance algorithms to map these sequences to the refer...
SAC
2010
ACM
13 years 8 months ago
2010
ACM
Next Generation Sequencing machines are generating millions of short DNA sequences (reads) everyday. There is a need for efficient algorithms to map these sequences to the referen...
IPPS
2010
IEEE
13 years 5 months ago
2010
IEEE
Next-generation high throughput sequencing instruments are capable of generating hundreds of millions of reads in a single run. Mapping those reads to a reference genome is an ext...
BIBE
2008
IEEE
14 years 2 months ago
2008
IEEE
— The Smith-Waterman algorithm is a dynamic programming method for determining optimal local alignments between nucleotide or protein sequences. However, it suffers from quadrati...