FM-index of alignment: A compressed index for similar strings
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Na, Joong Chae | - |
dc.contributor.author | Kim, Hyunjoon | - |
dc.contributor.author | Park, Heejin | - |
dc.contributor.author | Lecroq, Thierry | - |
dc.contributor.author | Leonard, Martine | - |
dc.contributor.author | Mouchard, Laurent | - |
dc.contributor.author | Park, Kunsoo | - |
dc.date.accessioned | 2022-07-15T15:29:59Z | - |
dc.date.available | 2022-07-15T15:29:59Z | - |
dc.date.created | 2021-05-12 | - |
dc.date.issued | 2016-07 | - |
dc.identifier.issn | 0304-3975 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/154336 | - |
dc.description.abstract | In this paper we propose the FM-index of alignment, a compressed index for similar strings with the functionalities of pattern search and random access. For this, we first design a new and improved version of the suffix array of alignment. The FM-index of alignment is an FM-index of this suffix array of alignment. The FM-index of alignment supports the LF-mapping and backward search, the key functionalities of the FM-index, but the LF-mapping and backward search of our index is significantly more involved than the original FM index. We implemented the FM-index of alignment and did experiments on 100 genome sequences from the 1000 Genomes Project. The index size of the FM-index of alignment is about a half of that of RLCSA due to Makinen et al. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | ELSEVIER SCIENCE BV | - |
dc.title | FM-index of alignment: A compressed index for similar strings | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Park, Heejin | - |
dc.identifier.doi | 10.1016/j.tcs.2015.08.008 | - |
dc.identifier.scopusid | 2-s2.0-84939818294 | - |
dc.identifier.wosid | 000378665900017 | - |
dc.identifier.bibliographicCitation | THEORETICAL COMPUTER SCIENCE, v.638, pp.159 - 170 | - |
dc.relation.isPartOf | THEORETICAL COMPUTER SCIENCE | - |
dc.citation.title | THEORETICAL COMPUTER SCIENCE | - |
dc.citation.volume | 638 | - |
dc.citation.startPage | 159 | - |
dc.citation.endPage | 170 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
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 | SUFFIX TREES | - |
dc.subject.keywordPlus | STORAGE | - |
dc.subject.keywordPlus | GENOMES | - |
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/S0304397515007288?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-1365
COPYRIGHT © 2021 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.