A short note on dynamic programming in a band
Abstract Background Third generation sequencing technologies generate long reads that exhibit high error rates, in particular for insertions and deletions which are usually the most difficult errors to cope with. The only exact algorithm capable of aligning sequences with insertions and deletions is...
Main Author: | Jean-François Gibrat |
---|---|
Format: | Article |
Language: | English |
Published: |
BMC
2018-06-01
|
Series: | BMC Bioinformatics |
Subjects: | |
Online Access: | http://link.springer.com/article/10.1186/s12859-018-2228-9 |
Similar Items
-
A Review on Sequence Alignment Algorithms for Short Reads Based on Next-Generation Sequencing
by: Jeongkyu Kim, et al.
Published: (2020-01-01) -
Fast and SNP-aware short read alignment with SALT
by: Wei Quan, et al.
Published: (2021-08-01) -
GASAL2: a GPU accelerated sequence alignment library for high-throughput NGS data
by: Nauman Ahmed, et al.
Published: (2019-10-01) -
Separating metagenomic short reads into genomes via clustering
by: Tanaseichuk Olga, et al.
Published: (2012-09-01) -
On the use of algebraic topology concepts to check the consistency of genome assembly
by: Jean-François Gibrat
Published: (2019-11-01)