Results 51 to 60 of about 28,330 (190)

Data structures and compression algorithms for high-throughput sequencing technologies

BMC Bioinformatics, 2010
Background High-throughput sequencing (HTS) technologies play important roles in the life sciences by allowing the rapid parallel sequencing of very large numbers of relatively short nucleotide sequences, in applications ranging from genome sequencing ...
Christley Scott, Rigor Paul, Daily Kenny, Xie Xiaohui, Baldi Pierre   +4 more
doaj   +1 more source

Optimal Prefix Codes with Fewer Distinct Codeword Lengths are Faster to Construct [PDF]

, 2016
A new method for constructing minimum-redundancy binary prefix codes is described. Our method does not explicitly build a Huffman tree; instead it uses a property of optimal prefix codes to compute the codeword lengths corresponding to the input weights.
Belal, Ahmed, Elmasry, Amr
core  

Variable‐Rate Texture Compression: Real‐Time Rendering with JPEG

Computer Graphics Forum, EarlyView.
Abstract Although variable‐rate compressed image formats such as JPEG are widely used to efficiently encode images, they have not found their way into real‐time rendering due to special requirements such as random access to individual texels. In this paper, we investigate the feasibility of variable‐rate texture compression on modern GPUs using the ...
Elias Kristmann, Michael Wimmer, Markus Schütz   +2 more
wiley   +1 more source

Modified HuffBit Compress Algorithm – An Application of R

Journal of Integrative Bioinformatics, 2018
The databases of genomic sequences are growing at an explicative rate because of the increasing growth of living organisms. Compressing deoxyribonucleic acid (DNA) sequences is a momentous task as the databases are getting closest to its threshold ...
Habib Nahida, Ahmed Kawsar, Jabin Iffat, Rahman Mohammad Motiur   +3 more
doaj   +1 more source

Tight Bounds on the Rényi Entropy via Majorization with Applications to Guessing and Compression

Entropy, 2018
This paper provides tight bounds on the Rényi entropy of a function of a discrete random variable with a finite number of possible values, where the considered function is not one to one. To that end, a tight lower bound on the Rényi entropy of
Igal Sason
doaj   +1 more source

STUDI BANDING ALGORITMA KOMPRESI HUFFMAN CODING DAN ADAPTIVE HUFFMAN CODING [PDF]

, 2017
ABSTRAK Algoritma kompresi menurut David Solomon (2007:2) adalah proses mengkonversikan sebuah input data stream (streamsumber, atau data mentah asli) menjadi data stream lainnya (bitstream hasil, atau stream yang telah terkompresi) yang ...
Mellia Liyanthy, Ds, METARIANA ADITYA, 103040047   +1 more
core  

NAADF: Globally Illuminated Voxel Worlds Accelerated with Nested Axis‐Aligned Distance Fields

Computer Graphics Forum, EarlyView.
Abstract Achieving realistic rendering of 3D scenes in real time using path tracing is challenging due to the high sample count required, with ray tracing as the bottleneck. Focusing on voxels as a geometry representation offers significant opportunities for optimizations, especially for tracing the rays, but also for computing the samples.
A. Ulschmid, M. Ott, J. Macho, M. Wimmer, S. Ohrhallinger   +4 more
wiley   +1 more source

Effects of parachute science on local research capacity 降落伞科学对当地研究能力的影响

Conservation Biology, EarlyView.
Abstract Strengthening research capacity is essential to address the global biodiversity crisis. Yet, parachute science often undermines this goal, and its prevalence, costs, and benefits are unclear. We analyzed 13,502 publications on primate research that we extracted from Scopus (1960–2022) to evaluate the effects of parachute science on local ...
Li Yang, Tao Chen, Colin A. Chapman, Paul A. Garber, Yu Xuan Fan, Tien Ming Lee, Michael Huffman, Juan Carlos Serio Silva, Carlos Peres, Onja H. Razafindratsima, Lwin Ngwe, Peng Fei Fan   +11 more
wiley   +1 more source

Tradeoff Between Speed and Memory Requirements for Decoding of Prefix-Free Codes

Algorithms
For the decoding of prefix-free codes such as Huffman code, we present a tradeoff between the decoding speed and memory requirements that results in an adapted decoding algorithm.
Jörg Keller, Christina Kahle
doaj   +1 more source

Running the Gauntlet: Experiences of Transgender and Gender‐Diverse People in the Recruitment Process

Gender, Work &Organization, EarlyView.
ABSTRACT This study focuses on the recruitment experiences of transgender and gender‐diverse (T&GD) individuals. Reporting on semi‐structured interviews with 22 T&GD individuals from Australia, the study suggests critical moments occur during the recruitment process for T&GD candidates, contributing to both theory and practice.
Robin C. Ladwig, Michael James Walsh, Raechel Johns   +2 more
wiley   +1 more source