FM-index of alignment with gaps

Citations

WEB OF SCIENCE

14
Citations

SCOPUS

20

초록

Recently a compressed index for similar strings, called the FM-index of alignment (FMA), has been proposed with the functionalities of pattern search and random access. The FMA is quite efficient in space requirement and pattern search time, but it is applicable only for an alignment of strings without gaps. In this paper we propose the FM-index of alignment with gaps, a realistic index for similar strings, which allows gaps in their alignment. For this, we design a new version of the suffix array of alignment by using an alignment transformation and a new definition of the alignment-suffix. The new suffix array of alignment enables us to support the LF-mapping and backward search, the key functionalities of the FM-index, regardless of gap existence in the alignment. We experimentally compared our index, with RLCSA due to Makinen et al. and related indexes GCSA due to Siren et al. and GCSA2 due to Siren on genome sequences from the 1000 Genomes Project. The index size of our index is smaller than those of other indexes.

키워드

Indexes for similar stringsFM-indexesSuffix arraysAlignmentsBackward searchSHORT READ ALIGNMENTSTORAGERETRIEVAL
제목
FM-index of alignment with gaps
저자
Na, Joong ChaeKim, HyunjoonMin, SeunghwanPark, Hee jinLecroq, ThierryLeonard, MartineMouchard, LaurentPark, Kunsoo
DOI
10.1016/j.tcs.2017.02.020
발행일
2018-02
저널명
Theoretical Computer Science
710
페이지
148 ~ 157