Minneapolis, MN, USA
Oct. 19, 2005 to Oct. 21, 2005
Abhijit Pol , University of Florida
Tamer Kahveci , University of Florida
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/BIBE.2005.37
We propose a method for finding seeds for the local alignment of two nucleotide sequences. Our method uses randomized algorithms to find approximate seeds. We present a dynamic index to store the fingerprints of k-grams and a highly scalable and accurate (HSA) algorithm to incorporate randomization into process of seed generation. Experimental results show that our method produces better quality seeds with improved running time and memory usage compared to traditional non-spaced and spaced seeds. The presented algorithm scales very well with higher seed lengths while maintaining the quality and performance.
Abhijit Pol, Tamer Kahveci, "Highly Scalable and Accurate Seeds for Subsequence Alignment", BIBE, 2005, BIBE 2005. 5th IEEE Symposium on Bioinformatics and Bioengineering, BIBE 2005. 5th IEEE Symposium on Bioinformatics and Bioengineering 2005, pp. 27-31, doi:10.1109/BIBE.2005.37