Decomposing Genomics Algorithms: Core Computations for Accelerating Genomics
Athreya, Arjun P.; Banerjee, Subho S.; Jongeneel, C. Victor; Kalbarczyk, Zbigniew T.; Iyer, Ravishankar K.
Loading…
Permalink
https://hdl.handle.net/2142/90442
Description
Title
Decomposing Genomics Algorithms: Core Computations for Accelerating Genomics
Author(s)
Athreya, Arjun P.
Banerjee, Subho S.
Jongeneel, C. Victor
Kalbarczyk, Zbigniew T.
Iyer, Ravishankar K.
Issue Date
2014-02
Keyword(s)
Bioinformatics
Genomic analyses
Algorithms
Abstract
Technological advances in genomic analyses and computing sciences has led to a burst in genomics data. With those advances, there has also been parallel growth in dedicated accelerators for specific genomic analyses. However, biologists are in need of a reconfigurable machine that can allow them to perform multiple analyses without needing to go for dedicated compute platforms for each analysis. This work addresses the first steps in the design of such a reconfigurable machine. We hypothesize that this machine design can consist of some accelerators of computations common across various genomic analyses. This work studies a subset of genomic analyses and identifies such core computations. We further investigate the possibility of further accelerating through a deeper analysis of the computation primitives.
Publisher
Coordinated Science Laboratory, University of Illinois at Urbana-Champaign
National Science Foundation (NSF CNS 13-37732); Infosys; IBM Faculty Award; Office of the Vice Chancellor for Research, University of Illinois at Urbana-Champaign
Use this login method if you
don't
have an
@illinois.edu
email address.
(Oops, I do have one)
IDEALS migrated to a new platform on June 23, 2022. If you created
your account prior to this date, you will have to reset your password
using the forgot-password link below.