A survey on disk-based genome sequence indexing
- Authors
- Loh, W.-K.; Park, Y.-H.
- Issue Date
- 2014
- Publisher
- Hikari Ltd.
- Keywords
- Genome sequences; Indexing; Suffix tree
- Citation
- Contemporary Engineering Sciences, v.7, no.13-16, pp.743 - 748
- Journal Title
- Contemporary Engineering Sciences
- Volume
- 7
- Number
- 13-16
- Start Page
- 743
- End Page
- 748
- URI
- https://scholarworks.bwise.kr/gachon/handle/2020.sw.gachon/13034
- DOI
- 10.12988/ces.2014.4684
- ISSN
- 1313-6569
- Abstract
- Due to recent remarkable advances in genome sequencing technologies, the DNA sequences of many living organisms including the human being have been collected in databases. To fully harness the genome databases, we should need the technologies for efficient indexing and searching the genome sequences, and the suffix tree has been adopted in many recent research papers. In this paper, we survey the most up-to-date indexing algorithms that construct the disk-based suffix trees for genome sequences and compare their strengths/weaknesses and performance. © 2014 Woong-Kee Loh and Young-Ho Park.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - IT융합대학 > 소프트웨어학과 > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.