SEARCH
ISTC-CC NEWSLETTER
RESEARCH HIGHLIGHTS
Ling Liu's SC13 paper "Large Graph Processing Without the Overhead" featured by HPCwire.
ISTC-CC provides a listing of useful benchmarks for cloud computing.
Another list highlighting Open Source Software Releases.
Second GraphLab workshop should be even bigger than the first! GraphLab is a new programming framework for graph-style data analytics.
ISTC-CC Abstract
Massively Parallel Mapping of Next Generation Sequence Reads Using GPUs
Short Student Research Competition Paper at the (ASPLOS) Student Research Competition, Istanbul, Turkey, March 2015..
Azita Nouri, Reha Oguz Selvitopi, Ozcan Ozturk, Onur Mutlu*, Can Alkan
Bilkent University, Ankara, Turkey
* Carnegie Mellon University
DNA sequence alignment problem can be broadly defined as the character-level comparison of DNA sequences obtained from one or more samples against a database of reference (i.e., consensus) genome sequence of the same or a similar species. High throughput sequencing (HTS) technologies were introduced in 2006 [6], and the latest iterations of HTS technologies are able to read the genome of a human individual in just three days for a cost of $1,000. However, they also present a computational problem since the analysis of the HTS data requires the comparison of >1 billion short (100 characters, or base pairs) “reads” against a very long (3 billion base pairs) reference genome. Since DNA molecules are composed of two opposing strands (i.e. two complementary strings), the number of required comparisons are doubled.
FULL PAPER: pdf
