Sentence examples for general hash index from inspiring English sources

SAWTooth uses a general hash index, perhaps the fastest data retrieval structure.

Although there are some limitations to general hash indexes, the nature of genomic data and the specialized task of mapping paired end reads to a reference genome, allows the use of hash indexes that circumvent these limitations.

Whereas, current state-of-the-art sequence aligner either generate (hash index based) or load (sorted index based) index for every task.

Thirdly, hash index is constructed.

In order to speed up SWA, we use hash index to store the location of each keyword and read rather than the keyword itself in hash index.

So each keyword is mapped to a unique location in hash index which stores the identification of unique processed reads.

Many of the short sequence mapping programs use k-mer and hash index table algorithm to accelerate alignment.

SWA runs in five key steps: preprocessing, unique processing), hash index, seed selection), and seed extension, 4, and 5).

The indirect hash index structures firstly transform the keywords to the quaternary integers and then index these integers rather than the strings directly.

It is worth noting that the proposed method is a general hashing method and can be applied to the general image retrieval task.

In this paper, we develop a Q-hash index structure to efficiently store the position of moving objects.