18 papers · ranked by Valyu relevance
Xutan Peng, Yi Zhang, Dejia Peng, Jiafa Zhu
Run-Length Encoding (RLE) is one of the most fundamental tools in data compression. However, its compression power drops significantly if there lacks consecutive elements in the sequence. In extreme cases, the output of the encoder may require more space than the input (aka size inflation). To alleviate this issue…
Sven Fiergolla, Petra Wolf
The Run Length Encoding (RLE) compression method is a long standing simple lossless compression scheme which is easy to implement and achieves a good compression on input data which contains repeating consecutive symbols. In its pure form RLE is not applicable on natural text or other input data with short sequences of…
Meo Mespotine
Run Length Encoding(RLE) is one of the oldest algorithms for data-compression available, a method used for compression of large data into smaller and therefore more compact data. It compresses by looking at the data for repetitions of the same character in a row and storing the amount(called run) and the respective…
Jürgen Willms
We analyze the connection between the autocorrelation of a binary sequence and its run structure given by the run length encoding. We show that both the periodic and the aperiodic autocorrelation of a binary sequence can be formulated in terms of the run structure. The run structure is given by the consecutive runs of…
Ahmad Husseen, Shakik Mahmud, Rana Jassim Mohammed
In this paper, we will present proposed enhance process of image compression by using RLE algorithm. This proposed yield to decrease the size of compressing image, but the original method used primarily for compressing a binary images [1].Which will yield increasing the size of an original image mostly when used for…
Yongpeng Zhang, Linsen Li, Yanli Yang, Xiao Yang + 2 more
'Zexuan Zhu'] Background The exponential growth of next generation sequencing (NGS) data has posed big challenges to data storage, management and archive. Data compression is one of the effective solutions, where reference-based compression strategies can typically achieve superior compression ratios compared to the…
Yaohua Zhu, Ya Liu, Yanghang Zhu, Mingsheng Huang + 3 more
'Yong Zhang' 'Bogdan Smolka'] Infrared line-scanning images have high redundancy and large file sizes. In JPEG2000 compression, the MQ arithmetic encoder’s complexity slows down processing. Huffman coding can achieve O(1) complexity based on a code table, but its integer-bit encoding mechanism and ignorance of the…
Mukesh Mishra, Gourab Sen Gupta, Xiang Gui, Óscar García
The exponential growth in remote sensing, coupled with advancements in integrated circuits (IC) design and fabrication technology for communication, has prompted the progress of Wireless Sensor Networks (WSN). WSN comprises of sensor nodes and hubs fit for detecting, processing, and communicating remotely. Sensor nodes…
Tamar Pinhas, Shay Zakov, Dekel Tsur, Michal Ziv-Ukelson
We propose three algorithms for string edit distance with duplications and contractions. These include an efficient general algorithm and two improvements which apply under certain constraints on the cost function. The new algorithms solve a more general problem variant and obtain better time complexities with respect…
Fabian Müntefering, Yeremia Gunawan Adhisantoso, Shubham Chandak, Jörn Ostermann + 2 more
'Jörn Ostermann' 'Mikel Hernaez' 'Jan Voges'] For the last two decades, the amount of genomic data produced by scientific and medical applications has been growing at a rapid pace. To enable software solutions that analyze, process, and transmit these data in an efficient and interoperable way, ISO and IEC released the…
Fabio Cunial, Olgert Denas, Djamal Belazzougui, Yann Ponty
Even though $ms_{S,T}$ takes just $2|S|$ bits, storing the bitvector of every pair of genomes in a large dataset for later analysis and querying might still require too much space overall. Real $\text{ms}$ bitvectors, however, have several features that could be exploited for lossless compression. Specifically, if S…
Reona Takemoto, Takayuki Nozaki
—Maximum run-length limited codes are constraint codes used in communication and data storage systems. Insertion/deletion correcting codes correct insertion or deletion errors caused in transmitted sequences and are used for combating synchronization errors. This paper investigates the maximum runlength limited single…
Anas Al-okaily, Abdelghani Tbakhi
Data compression is a challenging and increasingly important problem. As the amount of data generated daily continues to increase, efficient transmission and storage has never been more critical. In this study, a novel encoding algorithm is proposed, motivated by the compression of DNA data and associated…
Fajia Sun, Long Qian
DNA has been pursued as a compelling medium for digital data storage during the past decade. While large-scale data storage and random access have been achieved in artificial DNA, the synthesis cost keeps hindering DNA data storage from popularizing into daily life. In this study, we proposed a more efficient paradigm…
Authors not listed
Sequence is the critical determinant of macromolecular function, yet current polymer design approaches often optimize monomer composition and ratios while ignoring sequence. This creates poorly defined design spaces for active learning that miss the vast combinatorial landscape of sequence possibilities. We introduce…
Roland Wittler
To index or compare sequences efficiently, often k-mers, i.e., substrings of fixed length k, are used. For efficient indexing or storage, k-mers are often encoded as integers, e.g., applying some bijective mapping between all possible σ^k^ k-mers and the interval [0, σ^k^ −1], where σ is the alphabet size. In many…
Guillermo Dufort y Álvarez, Gadiel Seroussi, Pablo Smircich, José Sotelo-Silveira + 2 more
Nanopore sequencing technologies are rapidly gaining popularity, in part, due to the massive amounts of genomic data they produce in short periods of time (up to 8.5 TB of data in less than 72 hours). In order to reduce the costs of transmission and storage, efficient compression methods for this type of data are…
Aliye Hazal Koyuncu, Jacopo Movilli, Sevil Sahin, Dmitrii V. Kriukov + 2 more
This work describes a competing activation network, which is regulated by chemical feedback at the liquid-surface interface. Feedback loops dynamically tune the concentration of chemical components in living systems, thereby controlling regulatory processes in neural, genetic, and metabolic networks. Advances in…