The analysis of next-generation sequencing (NGS) data is a major topic in bioinfor- matics: short reads obtained from DNA, the molecule encoding the genome of living organisms, are processed to provide insight into biological or medical questions. This thesis provides novel solutions to major topics within the analysis of NGS data, focusing on parallelization, scalability and reproducibility. The read mapping problem is to find the origin of the short reads within a given reference genome. We contribute the q-group index, a novel data structure for read mapping with particularly small memory footprint. The q-group index comes with massively parallel build and query algorithms targeted towards modern graphics processing units (GPUs). On top, the read mapping software PEANUT is presented, which outperforms state of the art read mappers in speed while maintaining their accuracy. The variant calling problem is to infer (i.e., call) genetic variants of individuals compared to a reference genome using mapped reads. It is usually solved in a Bayesian way. In this work, we show how to integrate filtering of variants into the calling with an algebraic approach and provide an intuitive solution for controlling the false discovery rate along with solving other challenges of variant calling like scaling with a growing set of biological samples. Depending on the research question, the analysis of NGS data entails many other steps, typically involving diverse tools, data transformations and aggregation of results. These steps can be orchestrated by workflow management. We present the general purpose workflow system Snakemake, which provides an easy to read domain-specific language for defining and documenting workflows. Snakemake provides an execution environment that allows to scale a workflow to available resources, including parallelization across CPU cores or cluster nodes, restricting memory usage or the number of available coprocessors like GPUs.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Johannes Köster is a computer scientist with a focus on algorithm engineering and data analysis in bioinformatics. Currently, he works as a Postdoctoral Research Fellow in the groups of Shirley Liu, Department of Biostatistics and Computational Biology, Dana-Farber Cancer Institute, Harvard School of Public Health and Myles Brown, Division of Molecular and Cellular Oncology, Department of Medical Oncology, Dana-Farber Cancer Institute.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - The analysis of next-generation sequencing (NGS) data is a major topic in bioinfor-matics: short reads obtained from DNA, the molecule encoding the genome of livingorganisms, are processed to provide insight into biological or medical questions. Thisthesis provides novel solutions to major topics within the analysis of NGS data, focusingon parallelization, scalability and reproducibility.The read mapping problem is to find the origin of the short reads within a given referencegenome. We contribute the q-group index, a novel data structure for read mapping withparticularly small memory footprint. The q-group index comes with massively parallelbuild and query algorithms targeted towards modern graphics processing units (GPUs).On top, the read mapping software PEANUT is presented, which outperforms state ofthe art read mappers in speed while maintaining their accuracy.The variant calling problem is to infer (i.e., call) genetic variants of individuals comparedto a reference genome using mapped reads. It is usually solved in a Bayesian way. In this work, we show how to integrate filtering of variants into the calling with analgebraic approach and provide an intuitive solution for controlling the false discoveryrate along with solving other challenges of variant calling like scaling with a growingset of biological samples.Depending on the research question, the analysis of NGS data entails many other steps,typically involving diverse tools, data transformations and aggregation of results. Thesesteps can be orchestrated by workflow management. We present the general purposeworkflow system Snakemake, which provides an easy to read domain-specific languagefor defining and documenting workflows. Snakemake provides an execution environmentthat allows to scale a workflow to available resources, including parallelization acrossCPU cores or cluster nodes, restricting memory usage or the number of availablecoprocessors like GPUs. Bestandsnummer des Verkäufers 9783737537773
Anzahl: 2 verfügbar
Anbieter: preigu, Osnabrück, Deutschland
Taschenbuch. Zustand: Neu. Parallelization, Scalability, and Reproducibility in Next-Generation Sequencing Analysis | Dissertationsschrift | Johannes Köster | Taschenbuch | 132 S. | Englisch | 2015 | epubli | EAN 9783737537773 | Verantwortliche Person für die EU: Neopubli GmbH, Sebastian Stude, Köpenicker Str. 154a, 10997 Berlin, produktsicherheit[at]epubli[dot]com | Anbieter: preigu. Bestandsnummer des Verkäufers 112094315
Anzahl: 5 verfügbar