Please use this identifier to cite or link to this item: doi:10.22028/D291-28702
Volltext verfügbar? / Dokumentlieferung
Title: Bit-parallel sequence-to-graph alignment
Author(s): Rautiainen, Mikko
Mäkinen, Veli
Marschall, Tobias
Language: English
Title: Bioinformatics
Publisher/Platform: Oxford University Press
Year of Publication: 2019
Publikation type: Journal Article
Abstract: Graphs are commonly used to represent sets of sequences. Either edges or nodes can be labeled by sequences, so that each path in the graph spells a concatenated sequence. Examples include graphs to represent genome assemblies, such as string graphs and de Bruijn graphs, and graphs to represent a pan-genome and hence the genetic variation present in a population. Being able to align sequencing reads to such graphs is a key step for many analyses and its applications include genome assembly, read error correction, and variant calling with respect to a variation graph.
DOI of the first publication: 10.1093/bioinformatics/btz162
Link to this record: hdl:20.500.11880/27705
http://dx.doi.org/10.22028/D291-28702
ISSN: 1367-4803
1460-2059
Date of registration: 7-Sep-2019
Faculty: MI - Fakultät für Mathematik und Informatik
Department: MI - Informatik
Professorship: MI - Prof. Dr. Tobias Marschall
Collections:UniBib – Die Universitätsbibliographie

Files for this record:
There are no files associated with this item.


Items in SciDok are protected by copyright, with all rights reserved, unless otherwise indicated.