Name
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 Mäkinen et al. and related indexes GCSA due to Sirén et al. and GCSA2 due to Sirén on genome sequences from the 1000 Genomes Project. The index size of our index is smaller than those of other indexes. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1016/j.tcs.2017.02.020 | Theoretical Computer Science |
Keywords | DocType | Volume |
Indexes for similar strings,FM-indexes,Suffix arrays,Alignments,Backward search | Journal | 710 |
ISSN | Citations | PageRank |
0304-3975 | 1 | 0.36 |
References | Authors | |
0 | 8 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Joong Chae Na | 1 | 162 | 18.21 |
| Hyun-joon Kim | 2 | 93 | 10.19 |
| Seunghwan Min | 3 | 1 | 0.69 |
| Heejin Park | 4 | 235 | 21.63 |
| Thierry Lecroq | 5 | 662 | 58.52 |
| Martine Léonard | 6 | 37 | 5.66 |
| Laurent Mouchard | 7 | 251 | 25.07 |
| Kunsoo Park | 8 | 1396 | 171.00 |