A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
International Journal of Bioinformatics Research
DNA sequence search is a fundamental topic in bioinformatics. The Smith-Waterman algorithm achieved highest accuracy among various sequence alignment tools, but it usually spends much computational time to search on large DNA sequence database. On the contrary, BLAST and FASTA have improved the search speed by using heuristic approaches, by there is a possibility of missing an alignment or giving inaccurate output. This paper presents an efficient hierarchical method to improve the search speeddoi:10.9735/0975-3087.3.1.161-166 fatcat:2yegrsul7nfqvlempmrmiofxly