FISH – Fast Indexing for Spaced-seed Hashing

FISH

:: DESCRIPTION

FISH is a novel algorithm,which based on the indexing of small blocks that can be combined to obtain the hashing of spaced-seeds of any length. The method exploits the fast computation of the hashing of runs of consecutive 1 in the spaced seeds, that basically correspond to k-mer of the length of the run.

Advertisement

::DEVELOPER

Matteo Comin

:: SCREENSHOTS

N/A

:: REQUIREMENTS

  • Linux

:: DOWNLOAD

FISH

:: MORE INFORMATION

Citation

BMC Bioinformatics, 19 (Suppl 15), 441 2018 Nov 30
Efficient Computation of Spaced Seed Hashing With Block Indexing
Samuele Girotto , Matteo Comin , Cinzia Pizzi

Leave a Reply

Your email address will not be published. Required fields are marked *

This site uses Akismet to reduce spam. Learn how your comment data is processed.

Exit mobile version