Cited 0 time in
FM-index of alignment with gaps
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Na, Joong Chae | - |
| dc.contributor.author | Kim, Hyunjoon | - |
| dc.contributor.author | Min, Seunghwan | - |
| dc.contributor.author | Park, Hee jin | - |
| dc.contributor.author | Lecroq, Thierry | - |
| dc.contributor.author | Leonard, Martine | - |
| dc.contributor.author | Mouchard, Laurent | - |
| dc.contributor.author | Park, Kunsoo | - |
| dc.date.accessioned | 2025-06-12T06:01:30Z | - |
| dc.date.available | 2025-06-12T06:01:30Z | - |
| dc.date.issued | 2018-02 | - |
| dc.identifier.issn | 0304-3975 | - |
| dc.identifier.issn | 1879-2294 | - |
| dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/207483 | - |
| dc.description.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. | - |
| dc.format.extent | 10 | - |
| dc.publisher | Elsevier BV | - |
| dc.title | FM-index of alignment with gaps | - |
| dc.type | Article | - |
| dc.publisher.location | 네델란드 | - |
| dc.identifier.doi | 10.1016/j.tcs.2017.02.020 | - |
| dc.identifier.scopusid | 2-s2.0-85014564754 | - |
| dc.identifier.wosid | 000424958900015 | - |
| dc.identifier.bibliographicCitation | Theoretical Computer Science, v.710, pp 148 - 157 | - |
| dc.citation.title | Theoretical Computer Science | - |
| dc.citation.volume | 710 | - |
| dc.citation.startPage | 148 | - |
| dc.citation.endPage | 157 | - |
| dc.description.isOpenAccess | N | - |
| dc.description.journalRegisteredClass | scie | - |
| dc.description.journalRegisteredClass | scopus | - |
| dc.relation.journalResearchArea | Computer Science | - |
| dc.relation.journalWebOfScienceCategory | Computer Science, Theory & Methods | - |
| dc.subject.keywordPlus | SHORT READ ALIGNMENT | - |
| dc.subject.keywordPlus | STORAGE | - |
| dc.subject.keywordPlus | RETRIEVAL | - |
| dc.subject.keywordAuthor | Indexes for similar strings | - |
| dc.subject.keywordAuthor | FM-indexes | - |
| dc.subject.keywordAuthor | Suffix arrays | - |
| dc.subject.keywordAuthor | Alignments | - |
| dc.subject.keywordAuthor | Backward search | - |
| dc.identifier.url | https://www.sciencedirect.com/science/article/pii/S0304397517301536?via%3Dihub | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
222, Wangsimni-ro, Seongdong-gu, Seoul, 04763, Korea+82-2-2220-1366
COPYRIGHT © 2024 HANYANG UNIVERSITY.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.
