Short Read Alignment Based on Maximal Approximate Match Seeds

• Main Authors: Wei Quan, Dengfeng Guan, Guangri Quan, Bo Liu, Yadong Wang
• Format: Article
• Language: English
• Published: Frontiers Media S.A. 2020-11-01
• Series: Frontiers in Molecular Biosciences
• Subjects: whole-genome resequencing; next-generation sequencing; repeats; sequence alignment; FM-index
• Online Access: https://www.frontiersin.org/articles/10.3389/fmolb.2020.572934/full

Sequence alignment is a critical step in many critical genomic studies, such as variant calling, quantitative transcriptome analysis (RNA-seq), and metagenomic sequence classification. However, the alignment performance is largely affected by repetitive sequences in the reference genome, which extensively exist in species from bacteria to mammals. Aligning repeating sequences might lead to tremendous candidate locations, bringing about a challenging computational burden. Thus, most alignment tools prefer to simply discard highly repetitive seeds, but this may cause the true alignment to be missed. Using maximal approximate matches (MAMs) as seeds is an option, but MEMs seeds may fail due to sequencing errors or genomic variations in MEMs seeds. Here, we propose a novel sequence alignment algorithm, named MAM, which can efficiently align short DNA sequences. MAM first builds a modified Burrows-Wheeler transform (BWT) structure of a reference genome to accelerate approximate seed matching. Then, MAM uses maximal approximate matches (MAMs) seeds to reduce the candidate locations. Finally, MAM applies an affine-gap-penalty dynamic programming to extend MAMs seeds. Experimental results on simulated and real sequencing datasets show that MAM achieves better performance in speed than other state-of-the-art alignment tools. The source code is available at https://github.com/weiquan/mam.