Sciweavers

10 search results - page 1 / 2
» FANGS: high speed sequence mapping for next generation seque...
Sort
View
SAC
2010
ACM
13 years 4 months ago
FANGS: high speed sequence mapping for next generation sequencers
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...
Sanchit Misra, Ramanathan Narayanan, Simon Lin, Al...
IPPS
2010
IEEE
13 years 2 months ago
pFANGS: Parallel high speed sequence mapping for Next Generation 454-roche Sequencing reads
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...
Sanchit Misra, Ramanathan Narayanan, Wei-keng Liao...
BIBE
2008
IEEE
142views Bioinformatics» more  BIBE 2008»
13 years 11 months ago
Optimizing performance, cost, and sensitivity in pairwise sequence search on a cluster of PlayStations
— The Smith-Waterman algorithm is a dynamic programming method for determining optimal local alignments between nucleotide or protein sequences. However, it suffers from quadrati...
Ashwin M. Aji, Wu-chun Feng
IPPS
2010
IEEE
13 years 2 months ago
Exploring parallelism in short sequence mapping using Burrows-Wheeler Transform
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...
Doruk Bozdag, Ayat Hatem, Ümit V. Çata...
TII
2008
109views more  TII 2008»
13 years 4 months ago
Analysis and Simulation of Jitter Sequences for Testing Serial Data Channels
This paper presents a novel modeling analysis of jitter as applicable to testing of serial data channels. Jitter is analyzed by considering separate and combined components. The pr...
Kyung Ki Kim, Jing Huang, Yong-Bin Kim, Fabrizio L...