Sciweavers

6105 search results - page 68 / 1221
» A Parallel Algorithm for Bound-Smoothing
Sort
View
IPPS
2008
IEEE
15 years 4 months ago
Automatic generation of a parallel sorting algorithm
In this paper, we discuss a library generator for parallel sorting routines that examines the input characteristics (and the parameters they affect) to select the best performing ...
Brian A. Garber, Daniel Hoeflinger, Xiaoming Li, M...
IPPS
2010
IEEE
14 years 7 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...
IPPS
2010
IEEE
14 years 7 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...
IPPS
2005
IEEE
15 years 3 months ago
Provable Algorithms for Parallel Sweep Scheduling on Unstructured Meshes
V. S. Anil Kumar, Srinivasan Parthasarathy 0002, M...