Return
Singletrack: An Algorithm for Improving Memory Consumption and Performance of Gap-Affine Sequence Alignment
DOI:10.1093/bioinformatics/btag183.png)
Abstract
En 中文
Advances in DNA sequencing have outpaced advances in computation, making sequence alignment a major bottleneck in genome data analyses. Classical dynamic programming (DP) algorithms are particularly memory-intensive, especially when computing gap-affine and dual gap-affine alignments. Existing strategies to reduce memory consumption often sacrifice speed or alignment accuracy.
Keywords:
Sequence alignment
Gap-affine
Memory consumption
Dynamic programming
DNA sequencing
Journal
IF:
5.4
Papers:
1.1K
Citations:
17.9W

