Results 11 to 20 of about 966 (158)
Methodologies for Sample Multiplexing and Computational Deconvolution in Single-Cell Sequencing. [PDF]
Sample multiplexing offers a critical solution for boosting throughput and minimizing batch effects in single‐cell sequencing. This review navigates the latest experimental methodologies and computational deconvolution algorithms, bridging the gap between wet‐lab design and analytical success.
Gao Y, Yin W, Hu W, Chen W.
europepmc +2 more sources
Designing small universal k-mer hitting sets for improved analysis of high-throughput sequencing. [PDF]
With the rapidly increasing volume of deep sequencing data, more efficient algorithms and data structures are needed. Minimizers are a central recent paradigm that has improved various sequence analysis tasks, including hashing for faster read overlap ...
Yaron Orenstein +4 more
doaj +1 more source
Universal Hashing for Information-Theoretic Security [PDF]
Corrected an error in the proof of Lemma ...
Tyagi, Himanshu, Vardy, Alexander
openaire +3 more sources
Lightweight MACs from Universal Hash Functions [PDF]
Lightweight cryptography is a topic of growing importance, with the goal to secure the communication of low-end devices that are not powerful enough to use conventional cryptography. There have been many recent proposals of lightweight block ciphers, but comparatively few results on lightweight Message Authentication Codes (MACs). Therefore, this paper
Duval, Sébastien, Leurent, Gaëtan
openaire +2 more sources
Strongly Universal String Hashing is Fast [PDF]
We present fast strongly universal string hashing families: they can process data at a rate of 0.2 CPU cycle per byte. Maybe surprisingly, we find that these families---though they require a large buffer of random numbers---are often faster than popular hash functions with weaker theoretical guarantees.
Lemire, Daniel, Kaser, Owen
openaire +3 more sources
A Fast Single-Key Two-Level Universal Hash Function
Universal hash functions based on univariate polynomials are well known, e.g. Poly1305 and GHASH. Using Horner’s rule to evaluate such hash functionsrequire l − 1 field multiplications for hashing a message consisting of l blocks where each block is one ...
Debrup Chakraborty +2 more
doaj +1 more source
COST BENEFIT ANALYSIS OF COMPROMISING LEDGER SYSTEM BASED ON BLOCKCHAIN TECHNOLOGY
Modern application of the blockchain technology is the center of attention of technology and economy sectors. Proper usage of blockchain is based on peer to peer (P2P) network to coordinate a worldwide, universal ledger where all transactions on the ...
Edis Mekić +2 more
doaj +1 more source
Enhancing Extractable Quantum Entropy in Vacuum-Based Quantum Random Number Generator
Information-theoretically provable unique true random numbers, which cannot be correlated or controlled by an attacker, can be generated based on quantum measurement of vacuum state and universal-hashing randomness extraction.
Xiaomin Guo +5 more
doaj +1 more source
Electronic records long term authenticity and integrity demonstration
Long term preservation of electronic data requires introduction of specific technology solutions and organizational measures in order to provide stable environment for electronic record preservation.
Helena Halas, Aljoša Jerman Blažič
doaj +1 more source
Term Spread Volatility as a Leading Indicator of Economic Activity
ABSTRACT In this paper, we examine the macroeconomic predictive power of the volatility of the US Treasury yield curve slope (term spread volatility). Our forecasting exercise shows that US term spread volatility has significant predictive power for US industrial production and employment growth.
Anastasios Megaritis +3 more
wiley +1 more source

