A fast divide-and-conquer algorithm for indexing human genome sequences

Details A fast divide-and-conquer algorithm for indexing human genome sequences A fast divide-and-conquer algorithm for indexing human genome sequences

2010-12-18

arxiv.org/abs/1012.4074v1

Computer Science

Databases

8 pages, 9 figures

Scientific paper

Since the release of human genome sequences, one of the most important research issues is about indexing the genome sequences, and the suffix tree is most widely adopted for that purpose. The traditional suffix tree construction algorithms have severe performance degradation due to the memory bottleneck problem. The recent disk-based algorithms also have limited performance improvement due to random disk accesses. Moreover, they do not fully utilize the recent CPUs with multiple cores. In this paper, we propose a fast algorithm based on 'divide-and-conquer' strategy for indexing the human genome sequences. Our algorithm almost eliminates random disk accesses by accessing the disk in the unit of contiguous chunks. In addition, our algorithm fully utilizes the multi-core CPUs by dividing the genome sequences into multiple partitions and then assigning each partition to a different core for parallel processing. Experimental results show that our algorithm outperforms the previous fastest DIGEST algorithm by up to 3.5 times.

Affiliated with

Also associated with

No associations

Rating

A fast divide-and-conquer algorithm for indexing human genome sequences does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A fast divide-and-conquer algorithm for indexing human genome sequences, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A fast divide-and-conquer algorithm for indexing human genome sequences will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-157009