Results 1 to 10 of about 2,006,345 (293)

Universal Features for the Classification of Coding and Non-Coding DNA Sequences

open access: yesBioinformatics and Biology Insights, 2009
In this report, we revisited simple features that allow the classification of coding sequences (CDS) from non-coding DNA. The spectrum of codon usage of our sequence sample is large and suggests that these features are universal.
Nicolas Carels   +2 more
doaj   +3 more sources

Compression-Based Methods of Time Series Forecasting

open access: yesMathematics, 2021
Time series forecasting is an important research topic with many practical applications. As shown earlier, the problems of lossless data compression and prediction are very similar mathematically.
Konstantin Chirikhin, Boris Ryabko
doaj   +1 more source

Application of data compression methods to hypothesis testing for ergodic and stationary processes [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2005
We show that data compression methods (or universal codes) can be applied for hypotheses testing in a framework of classical mathematical statistics. Namely, we describe tests, which are based on data compression methods, for the three following problems:
Boris Ryabko, Jaakko Astola
doaj   +1 more source

Adaptive compression against a countable alphabet [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2012
This paper sheds light on universal coding with respect to classes of memoryless sources over a countable alphabet defined by an envelope function with finite and non-decreasing hazard rate.
Dominique Bontemps   +2 more
doaj   +1 more source

A Universal Random Coding Ensemble for Sample-Wise Lossy Compression

open access: yesEntropy, 2023
We propose a universal ensemble for the random selection of rate–distortion codes which is asymptotically optimal in a sample-wise sense. According to this ensemble, each reproduction vector, x^, is selected independently at random under the probability ...
Neri Merhav
doaj   +1 more source

A Lower-Bound for the Maximin Redundancy in Pattern Coding

open access: yesEntropy, 2009
We show that the maximin average redundancy in pattern coding is eventually larger than 1.84 (n/log n)1/3 for messages of length n. This improves recent results on pattern redundancy, although it does not fill the gap between known lower- and upper ...
Aurélien Garivier
doaj   +1 more source

NASCUP: Nucleic Acid Sequence Classification by Universal Probability

open access: yesIEEE Access, 2021
Nucleic acid sequence classification is a fundamental task in the field of bioinformatics. Due to the increasing amount of unlabeled nucleotide sequences, fast and accurate classification of them on a large scale has become crucial.
Sunyoung Kwon   +5 more
doaj   +1 more source

Time-Universal Data Compression

open access: yesAlgorithms, 2019
Nowadays, a variety of data-compressors (or archivers) is available, each of which has its merits, and it is impossible to single out the best ones. Thus, one faces the problem of choosing the best method to compress a given file, and this problem is ...
Boris Ryabko
doaj   +1 more source

An Improved Affine Motion Estimation Algorithm in H.266/VVC [PDF]

open access: yesJisuanji gongcheng, 2022
The universal video coding standard H.266/VVC introduces a variety of new coding technologies, such as affine motion compensation prediction and adaptive coding motion vector accuracy, multi-core transformation.It supports the encoding and decoding of ...
WANG Jiabo, YANG Jing
doaj   +1 more source

A Category-Specific Dictionary Learning Method Tailored for Reconstruction-Based Feature Coding

open access: yesIEEE Access, 2020
Bag-of-Visual-Words (BoVW) is still a useful image classification model when there is not enough data to use Deep Learning. In BoVW model, the practice of reducing the reconstruction errors of local features can improve the classification accuracy owing ...
Ye Xu   +4 more
doaj   +1 more source

Home - About - Disclaimer - Privacy