All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

An algorithm for mapping short reads to a dynamically changing genomic sequence

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F10%3A00177976" target="_blank" >RIV/68407700:21240/10:00177976 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.1109/BIBM.2010.5706551" target="_blank" >http://dx.doi.org/10.1109/BIBM.2010.5706551</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1109/BIBM.2010.5706551" target="_blank" >10.1109/BIBM.2010.5706551</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    An algorithm for mapping short reads to a dynamically changing genomic sequence

  • Original language description

    The constant advances in sequencing technology have redefined the way genome sequencing is performed. They are able to produce tens of millions of short sequences (reads), during a single experiment, and with a much lower cost than previously possible. Due to this massive amount of data, efficient algorithms for mapping these reads to reference sequences 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 a dynamically changing genomic sequence. We propose a new practical algorithm, which employs a suitable data structure that takes into account potential dynamic effects (replacements, insertions, deletions) on the genomic sequence. The presented experimental results demonstrate that the proposed approach can be applied to address the problem of mapping millions of reads to multiple genomic sequences.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

    <a href="/en/project/GA201%2F09%2F0807" target="_blank" >GA201/09/0807: String and tree analysis and processing</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2010

  • Confidentiality

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

Data specific for result type

  • Article name in the collection

    2010 IEEE International Conference on Bioinformatics and Biomedicine

  • ISBN

    978-1-4244-8305-1

  • ISSN

  • e-ISSN

  • Number of pages

    4

  • Pages from-to

    133-136

  • Publisher name

    IEEE Computer Society

  • Place of publication

    Los Alamitos

  • Event location

    Hong Kong

  • Event date

    Dec 18, 2010

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article