A Dynamic Approach to Weighted Suffix Tree Construction Algorithm
Electronics and Computer Engineering Department, Indian Institute of Technology, Roorkee, India
International Journal of Distributed and Parallel Systems, Volume 2, Issue 1, 2011
@article{pandey2011dynamic,
title={A Dynamic Approach to Weighted Suffix Tree Construction Algorithm},
author={Pandey, B.K. and Niyogi, R. and Mittal, A.},
journal={International Journal},
volume={2},
year={2011}
}
In present time weighted suffix tree is consider as a one of the most important existing data structure used for analyzing molecular weighted sequence. Although a static partitioning based parallel algorithm existed for the construction of weighted suffix tree, but for very long weighted DNA sequences it takes significant amount of time. However, in our implementation of dynamic partition based parallel weighted suffix tree construction algorithm on cluster computing makes it possible to significantly accelerate the construction of weighted suffix tree.
December 11, 2011 by hgpu
