|
|
Direct assembly of genome signals from nanopore sequencing
Karmazinová, Inna ; Maděránková, Denisa (referee) ; Sedlář, Karel (advisor)
The aim of this bachelor thesis is to search for overlaps between signals from nanopore sequencing using MinION device version R9. The theoretical part deals with methods used for genome assembly - greedy algorithm, overlap-layout-consensus (OLC) and de Bruijn graphs. Oxford Nanopore Technologies introduced the MinION device, which simplifies sequencing using the current change, which occurs while the DNA is passing through the nanopore. The error rate of the device is still high, the accuracy problem occurs during the base-calling. Using the difference signal, possibly also the dynamic time warping, it is possible to find overlaps between the individual signals. Signal analysis and genome assembly using the MinION signal could provide better accuracy.
|
|
|
Direct assembly of genome signals from nanopore sequencing
Karmazinová, Inna ; Maděránková, Denisa (referee) ; Sedlář, Karel (advisor)
The aim of this bachelor thesis is to search for overlaps between signals from nanopore sequencing using MinION device version R9. The theoretical part deals with methods used for genome assembly - greedy algorithm, overlap-layout-consensus (OLC) and de Bruijn graphs. Oxford Nanopore Technologies introduced the MinION device, which simplifies sequencing using the current change, which occurs while the DNA is passing through the nanopore. The error rate of the device is still high, the accuracy problem occurs during the base-calling. Using the difference signal, possibly also the dynamic time warping, it is possible to find overlaps between the individual signals. Signal analysis and genome assembly using the MinION signal could provide better accuracy.
|
|
|
Variant calling using local reference-helped assemblies
Dráb, Martin ; Daněček, Petr (advisor) ; Hoksza, David (referee)
Despite active development during past years, the task of sequencing a genome still remains a challenge. Our current technologies are not able to read the whole genome in one piece. Instead, we shatter the target genome into a large amounts of small pieces that are then sequenced separately. The process of assembling these small pieces together, in order to obtain sequence of the whole genome, is painful and rsource-consuming. Multiple algorithms to solve the assembly problem were developed. This thesis presents yet another assembly algorithm, based on the usage of de Bruijn graphs, and focusing on sequencing short genome regions. The algorithm is compared to well-known solutions in the field. 1
|
guest ::
