Cargando…

Viral Gene Compression: Complexity and Verification

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...

Descripción completa

Detalles Bibliográficos
Autores principales: Daley, Mark, McQuillan, Ian
Formato: Online Artículo Texto
Lenguaje:English
Publicado: 2005
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7120839/
http://dx.doi.org/10.1007/978-3-540-30500-2_10
_version_ 1783515065423495168
author Daley, Mark
McQuillan, Ian
author_facet Daley, Mark
McQuillan, Ian
author_sort Daley, Mark
collection PubMed
description 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.
format Online
Article
Text
id pubmed-7120839
institution National Center for Biotechnology Information
language English
publishDate 2005
record_format MEDLINE/PubMed
spelling pubmed-71208392020-04-06 Viral Gene Compression: Complexity and Verification Daley, Mark McQuillan, Ian Implementation and Application of Automata Article 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. 2005 /pmc/articles/PMC7120839/ http://dx.doi.org/10.1007/978-3-540-30500-2_10 Text en © Springer-Verlag Berlin Heidelberg 2005 This article is made available via the PMC Open Access Subset for unrestricted research re-use and secondary analysis in any form or by any means with acknowledgement of the original source. These permissions are granted for the duration of the World Health Organization (WHO) declaration of COVID-19 as a global pandemic.
spellingShingle Article
Daley, Mark
McQuillan, Ian
Viral Gene Compression: Complexity and Verification
title Viral Gene Compression: Complexity and Verification
title_full Viral Gene Compression: Complexity and Verification
title_fullStr Viral Gene Compression: Complexity and Verification
title_full_unstemmed Viral Gene Compression: Complexity and Verification
title_short Viral Gene Compression: Complexity and Verification
title_sort viral gene compression: complexity and verification
topic Article
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7120839/
http://dx.doi.org/10.1007/978-3-540-30500-2_10
work_keys_str_mv AT daleymark viralgenecompressioncomplexityandverification
AT mcquillanian viralgenecompressioncomplexityandverification