Next Article in Journal
Application of Genetic Control with Adaptive Scaling Scheme to Signal Acquisition in Global Navigation Satellite System Receiver
Next Article in Special Issue
Visualization, Band Ordering and Compression of Hyperspectral Images
Previous Article in Journal / Special Issue
Standard and Specific Compression Techniques for DNA Microarray Images
Open AccessArticle

A Note on Sequence Prediction over Large Alphabets

Department of Computer Science and Engineering, Aalto University, 00076 Aalto, Finland
Algorithms 2012, 5(1), 50-55;
Received: 14 November 2011 / Revised: 11 February 2012 / Accepted: 13 February 2012 / Published: 17 February 2012
(This article belongs to the Special Issue Data Compression, Communication and Processing)
Building on results from data compression, we prove nearly tight bounds on how well sequences of length n can be predicted in terms of the size σ of the alphabet and the length k of the context considered when making predictions. We compare the performance achievable by an adaptive predictor with no advance knowledge of the sequence, to the performance achievable by the optimal static predictor using a table listing the frequency of each (k + 1)-tuple in the sequence. We show that, if the elements of the sequence are chosen uniformly at random, then an adaptive predictor can compete in the expected case if k ≤ logσ n – 3 – ε, for a constant ε > 0, but not if k ≥ logσ n.
Keywords: sequence prediction; alphabet size; analysis sequence prediction; alphabet size; analysis
MDPI and ACS Style

Gagie, T. A Note on Sequence Prediction over Large Alphabets. Algorithms 2012, 5, 50-55.

Show more citation formats Show less citations formats

Article Access Map by Country/Region

Only visits after 24 November 2015 are recorded.
Back to TopTop