Search Results for "hash data"

...It implements many common and widely used algorithms for array manipulations: searching, sorting, arithmetic and vector operations, unit conversions; fast mathematical and statistic functions; numbers and time converting algorithms; finite impulse response (FIR) digital filters; spectrum analysis algorithms, Fast Hartley transformation; CPU cache friendly functions and extremely fast abstract data types (ADT) such as hash tables b-trees, and much more. LinAsm libraries are written on FASM assembly language. They are stable and have appropriate benchmarks for many units. All libraries are well documented and grouped by their functionality. To get more information about this library, please visit the official web site: http://linasm.sourceforge.net

...This was originally an extended re-implementation of the "front-end" part in the following paper: https://www.computer.org/csdl/proceedings/reconfig/2008/3474/00/3474a073-abs.html It has since grown to include conversion of a set of NFAs to a DFA; compilation of NFAs to instruction suitable for simulation; and compilation of a DFA to hash-based data structures for a simulator.

...As values get larger it uses up to two more Miller Rabin rounds, and at the end it uses BPSW (which is one rould of Miller Rabin and then one of Lucas). Compared to other codes that achieve the same I believe that the hash tables used here are compact, and both the programs and the intermediate data used to create them are provided. This may be of interest just to people wanting a C++ implementation of the Lucas test.

CryptoDock is free multi-platform application written in Java that hosts various hash and modern cryptographic algorithms you can use to protect your sensitive data on your computer. Available cryptographic algorithms: 1. NLSE-1 2. One Time Pad 3. AES Available hashing algorithms: 1. MD5 2. SHA-1 3. SHA-256 4. SHA-512 IMPORTANT: In order to run CryptoDock you need to have Java installed on your computer.

This program can be used to count or remove adapter dimers in fastq files. Using a provided adapter sequence, it generates variations of this sequence and stores them in a hash table. The reads can then be directly matched against the hash. It is far more time efficient than doing alignment.