|
|
Abstract
DNA sequences are large data which requires much computational power for
processing and searching them. One of the best method for indexing
sequences is suffix tree data structure. However, suffix tree is rather
large data structure which required much storage in computer. In the
situation of DNA sequences, the suffix tree cannot fit into the main
memory of a computer. So, secondary storage is used but reduces the
performance due to IO on hard-disks. Therefore, we propose 3 algorithms
for suffix tree indexing in PC clusters such that it can improve the DNA
searching time and tree building time. In the talk, I will introduce the
some background information and discuss the algorithms for DNA indexing.
Read the Presentation
Slides...
Referred Papers
|
