Name
Abstract | ||
|---|---|---|
Motivation: Hashing has been widely used for indexing, querying and rapid similarity search in many bioinformatics applications, including sequence alignment, genome and transcriptome assembly, k-mer counting and error correction. Hence, expediting hashing operations would have a substantial impact in the field, making bioinformatics applications faster and more efficient. Results: We present ntHash, a hashing algorithm tuned for processing DNA/RNA sequences. It performs the best when calculating hash values for adjacent k-mers in an input sequence, operating an order of magnitude faster than the best performing alternatives in typical use cases. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1093/bioinformatics/btw397 | BIOINFORMATICS |
Field | DocType | Volume |
Data mining,Use case,Computer science,Expediting,Search engine indexing,Error detection and correction,Software,Hash function,Recursion,Nearest neighbor search | Journal | 32 |
Issue | ISSN | Citations |
22 | 1367-4803 | 2 |
PageRank | References | Authors |
0.38 | 0 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hamid Mohamadi | 1 | 66 | 5.37 |
| Justin Chu | 2 | 11 | 4.70 |
| Benjamin Vandervalk | 3 | 121 | 9.60 |
| Inanc Birol | 4 | 78 | 9.34 |