FM-index of alignment with gapsopen access
- Authors
- Na, Joong Chae; Kim, Hyunjoon; Min, Seunghwan; Park, Heejin; Lecroq, Thierry; Leonard, Martine; Mouchard, Laurent; Park, Kunsoo
- Issue Date
- Feb-2018
- Publisher
- ELSEVIER SCIENCE BV
- Keywords
- Indexes for similar strings; FM-indexes; Suffix arrays; Alignments; Backward search
- Citation
- THEORETICAL COMPUTER SCIENCE, v.710, pp.148 - 157
- Indexed
- SCIE
SCOPUS
- Journal Title
- THEORETICAL COMPUTER SCIENCE
- Volume
- 710
- Start Page
- 148
- End Page
- 157
- URI
- https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/150607
- DOI
- 10.1016/j.tcs.2017.02.020
- ISSN
- 0304-3975
- Abstract
- 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.
- Files in This Item
-
- Appears in
Collections - 서울 공과대학 > 서울 컴퓨터소프트웨어학부 > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.