Bit-parallel sequence-to-graph alignment
Author(s) -
Mikko Rautiainen,
Veli Mäkinen,
Tobias Marschall
Publication year - 2019
Publication title -
bioinformatics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 3.599
H-Index - 390
eISSN - 1367-4811
pISSN - 1367-4803
DOI - 10.1093/bioinformatics/btz162
Subject(s) - speedup , computer science , de bruijn sequence , de bruijn graph , algorithm , sequence (biology) , cograph , time complexity , pathwidth , combinatorics , graph , theoretical computer science , mathematics , line graph , parallel computing , biology , genetics
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.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom