On Sequence Overlaps Minimizing Post-normalized Edit Distance

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F18%3A00322804" target="_blank" >RIV/68407700:21230/18:00322804 - isvavai.cz</a>

Výsledek na webu

<a href="http://radio.feld.cvut.cz/conf/poster/proceedings/Poster_2018/Section_IC/IC_055_Rysavy.pdf" target="_blank" >http://radio.feld.cvut.cz/conf/poster/proceedings/Poster_2018/Section_IC/IC_055_Rysavy.pdf</a>

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

On Sequence Overlaps Minimizing Post-normalized Edit Distance

Popis výsledku v původním jazyce

Computational biology deals with processing of genetic sequences. Next-generation sequencing machines produce sets of short substrings of a DNA sequence, called reads, which are further assembled to contigs. Recently there has been proposed a method how to measure the distance between two sequences only from an assembly at the level of contigs. The original paper used a heuristic for finding a suitable overlap of two contigs. The heuristic was, however, not evaluated on its own in the original paper. Here, we address this issue, and our results show, that the relative error of the heuristic is small and that the heuristic provides the exact result in more than two-thirds of the cases.

Název v anglickém jazyce

On Sequence Overlaps Minimizing Post-normalized Edit Distance

Popis výsledku anglicky

Computational biology deals with processing of genetic sequences. Next-generation sequencing machines produce sets of short substrings of a DNA sequence, called reads, which are further assembled to contigs. Recently there has been proposed a method how to measure the distance between two sequences only from an assembly at the level of contigs. The original paper used a heuristic for finding a suitable overlap of two contigs. The heuristic was, however, not evaluated on its own in the original paper. Here, we address this issue, and our results show, that the relative error of the heuristic is small and that the heuristic provides the exact result in more than two-thirds of the cases.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2018

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

Proceedings of the International Student Scientific Conference Poster – 22/2018

ISBN

978-80-01-06428-3

ISSN

—

e-ISSN

—

Počet stran výsledku

5

Strana od-do

1-5

Název nakladatele

Czech Technical University in Prague

Místo vydání

Praha

Místo konání akce

Praha

Datum konání akce

10. 5. 2018

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

WRD - Celosvětová akce

Kód UT WoS článku

—