Parallel algorithms for mapping short degenerate and weighted DNA sequences to a reference genome

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F12%3A43915986" target="_blank" >RIV/49777513:23520/12:43915986 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1142/S0129054112400114" target="_blank" >http://dx.doi.org/10.1142/S0129054112400114</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1142/S0129054112400114" target="_blank" >10.1142/S0129054112400114</a>

Result language
angličtina
Original language name
Parallel algorithms for mapping short degenerate and weighted DNA sequences to a reference genome
Original language description
One of the most ambitious trends in current biomedical research is the large-scale genomic sequencing of patients' DNA. Novel high-throughput (or next-generation) sequencing technologies have redefined the way genome sequencing is performed. They are able to produce millions of short sequences (reads) in a single experiment, and with a much lower cost than previously possible. Due to this massive amount of data, efficient algorithms for mapping these sequences to a reference genome are in great demand.In this paper, we design parallel algorithms, to address this problem efficiently.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—

Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year
2012
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)