DynMap : mapping short reads to multiple related genomes

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F11%3A00188300" target="_blank" >RIV/68407700:21240/11:00188300 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

DynMap : mapping short reads to multiple related genomes

Popis výsledku v původním jazyce

The constant advances in sequencing technology have redefined the way genome sequencing is performed. They are able to produce millions of short sequences (reads) during a single experiment, and with a much lower cost than previously possible. Due to thedramatic increase in the amount of data generated, efficient algorithms for aligning (mapping) these reads to reference genomes are in great demand, and recently, there has been ample work for publishing such algorithms. In this paper, we study a different version of this problem; mapping these reads to multiple related genomes (e.g. individuals of the same species). We present DynMap, a new practical algorithm, which employs a suitable data structure that takes into account potential inherent genomicvariability (replacements, insertions, deletions) between related genomes. Therefore, if a small number of differences occurs within a reference sequence, the already mapped reads can be altered dynamically. The presented experimental res

Název v anglickém jazyce

DynMap : mapping short reads to multiple related genomes

Popis výsledku anglicky

The constant advances in sequencing technology have redefined the way genome sequencing is performed. They are able to produce millions of short sequences (reads) during a single experiment, and with a much lower cost than previously possible. Due to thedramatic increase in the amount of data generated, efficient algorithms for aligning (mapping) these reads to reference genomes are in great demand, and recently, there has been ample work for publishing such algorithms. In this paper, we study a different version of this problem; mapping these reads to multiple related genomes (e.g. individuals of the same species). We present DynMap, a new practical algorithm, which employs a suitable data structure that takes into account potential inherent genomicvariability (replacements, insertions, deletions) between related genomes. Therefore, if a small number of differences occurs within a reference sequence, the already mapped reads can be altered dynamically. The presented experimental res

Druh

D - Stať ve sborníku

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

<a href="/cs/project/GA201%2F09%2F0807" target="_blank" >GA201/09/0807: Analýza a zpracování řetězců a stromů</a><br>

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2011

Kód důvěrnosti údajů

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

Název statě ve sborníku

ACM BCB 2011: ACM Conference on Bioinformatics, Computational Biology and Biomedicine

ISBN

978-1-4503-0796-3

ISSN

—

e-ISSN

—

Počet stran výsledku

5

Strana od-do

330-334

Název nakladatele

ACM

Místo vydání

New York

Místo konání akce

Chicago

Datum konání akce

1. 8. 2011

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—