Abstract
We present a local alignment search tool not based on the usual strategy of seed and grow often employed for these tools. Instead, we just find regions in the database sequences having a high density of seed matches and then we perform a Smith-Waterman local alignment of the query sequence into these regions. This approach has some advantages for some use cases.
Copyright
The copyright holder for this preprint is the author/funder, who has granted bioRxiv a license to display the preprint in perpetuity. It is made available under a CC-BY-NC-ND 4.0 International license.