상세 보기
초록
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.
키워드
Genome sequences; Indexing; Suffix tree
- 제목
- A survey on disk-based genome sequence indexing
- 저자
- Loh, Woong-Kee; Park, Young-Ho
- 발행일
- 2014-05
- 유형
- Article
- 권
- 7
- 호
- 15
- 페이지
- 743 ~ 748
- 언어
- ENG
- 출판사
- Hikari Ltd.
- 발행국가
- 불가리아
- 분량
- 6 페이지
- ISSN
- E 1314-7641
P 1313-6569