Pairwise alignment of nucleotide sequences using maximal exact matches

Pairwise alignment of nucleotide sequences using maximal exact matches

Abstract Background Pairwise alignment of short DNA sequences with affine-gap scoring is a common processing step performed in a range of bioinformatics analyses. Dynamic programming (i.e. Smith-Waterman algorithm) is widely used for this purpose. Despite using data level parallelisation, pairwise a...

Full description

Bibliographic Details
Main Authors: Arash Bayat, Bruno Gaëta, Aleksandar Ignjatovic, Sri Parameswaran
Format: Article
Language:English
Published: BMC 2019-05-01
Series:BMC Bioinformatics
Subjects:
Sequence alignment
Dynamic programming
Affine-gap penalty
Online Access:http://link.springer.com/article/10.1186/s12859-019-2827-0

Internet

http://link.springer.com/article/10.1186/s12859-019-2827-0

Similar Items