Backyard Cuckoo Hashing: Constant Worst-Case Operations with a Succinct Representation [PDF]
arXiv, 2009 The performance of a dynamic dictionary is measured mainly by its update time, lookup time, and space consumption. In terms of update time and lookup time there are known constructions that guarantee constant-time operations in the worst case with high probability, and in terms of space consumption there are known constructions that use essentially ...
arxiv
Distortion-Resistant Hashing for rapid search of similar DNA subsequence [PDF]
arXiv, 2016 One of the basic tasks in bioinformatics is localizing a short subsequence $S$, read while sequencing, in a long reference sequence $R$, like the human geneome. A natural rapid approach would be finding a hash value for $S$ and compare it with a prepared database of hash values for each of length $|S|$ subsequences of $R$.
arxiv
An online algorithm for generating fractal hash chains applied to digital chains of custody [PDF]
arXiv, 2007 This paper gives an online algorithm for generating Jakobsson's fractal hash chains. Our new algorithm compliments Jakobsson's fractal hash chain algorithm for preimage traversal since his algorithm assumes the entire hash chain is precomputed and a particular list of Ceiling(log n) hash elements or pebbles are saved.
arxiv
PHORMA: Perfectly Hashable Order Restricted Multidimensional Arrays [PDF]
arXiv, 2003 In this paper we propose a simple and efficient data structure yielding a perfect hashing of quite general arrays. The data structure is named phorma, which is an acronym for perfectly hashable order restricted multidimensional array. Keywords: Perfect hash function, Digraph, Implicit enumeration, Nijenhuis-Wilf combinatorial family.
arxiv
Improving Anonymity in Shared Key Primitives Based on Perfect Hash Families [PDF]
arXiv, 2011 We propose a new scheme for sharing symmetric key operations among a set of participants according to a (t,n) threshold access structure. We focus on anonymity properties of this scheme and show that this scheme provides improved values of anonymity measures than the existing ones. In particular, the scheme can provide optimal and equitable participant
arxiv
Classification of Malicious URLs Using Machine Learning. [PDF]
Sensors (Basel), 2023 Abad S, Gholamy H, Aslani M.
europepmc +1 more source
2FAST2Q: a general-purpose sequence search and counting program for FASTQ files. [PDF]
PeerJ, 2022 Bravo AM, Typas A, Veening JW.
europepmc +1 more source
A survey of mapping algorithms in the long-reads era. [PDF]
Genome Biol, 2023 Sahlin K +3 more
europepmc +1 more source
A Critical Cybersecurity Analysis and Future Research Directions for the Internet of Things: A Comprehensive Review. [PDF]
Sensors (Basel), 2023 Tariq U, Ahmed I, Bashir AK, Shaukat K.
europepmc +1 more source