Variable order finite-context models in DNA sequence coding

0Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Being an essential key in biological research, the DNA sequences are often shared between researchers and digitally stored for future use. As these sequences grow in volume, it also grows the need to encode them, thus saving space for more sequences. Besides this, a better coding method corresponds to a better model of the sequence, allowing new insights about the DNA structure. In this paper, we present an algorithm capable of improving the encoding results of algorithms that depend of low-order finite-context models to encode DNA sequences. To do so, we implemented a variable order finite-context model, supported by a predictive function. The proposed algorithm allows using three finite-context models at once without requiring the inclusion of side information in the encoded sequence. Currently, the proposed method shows small improvements in the encoding results when compared with same order finite-context models. However, we also present results showing that there is space for further improvements regarding the use variable order finite-context models for DNA sequence coding. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Martins, D. A., Neves, A. J. R., & Pinho, A. J. (2009). Variable order finite-context models in DNA sequence coding. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5524 LNCS, pp. 457–464). https://doi.org/10.1007/978-3-642-02172-5_59

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free