Viral gene compression: Complexity and verification

4Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The smallest known biological organisms are, by far, the viruses. One of the unique adaptations that many viruses have aquired is the compression of the genes in their genomes. In this paper we study a formalized model of gene compression in viruses. Specifically, we define a set of constraints that describe viral gene compression strategies and investigate the properties of these constraints from the point of view of genomes as languages. We pay special attention to the finite case (representing real viral genomes) and describe a metric for measuring the level of compression in a real viral genome. An efficient algorithm for establishing this metric is given along with applications to real genomes including automated classification of viruses and prediction of horizontal gene transfer between host and virus. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Daley, M., & McQuillan, I. (2005). Viral gene compression: Complexity and verification. In Lecture Notes in Computer Science (Vol. 3317, pp. 102–112). Springer Verlag. https://doi.org/10.1007/978-3-540-30500-2_10

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