Compression and genetic sequence analysis
A novel approach to genetic sequence analysis is presented. This approach, based on compression of algorithms, has been launched simultaneously by Grumbach and Tahi, Milosavljevic and Rivals. To reduce the description of an object, a compression algorithm replaces some regularities in the descriptio...
Gespeichert in:
| Veröffentlicht in: | Biochimie 1996, Vol.78 (5), p.315-322 |
|---|---|
| Hauptverfasser: | , , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 322 |
|---|---|
| container_issue | 5 |
| container_start_page | 315 |
| container_title | Biochimie |
| container_volume | 78 |
| creator | Rivals, É. Dauchet, M. Delahaye, J.P. Delgrange, O. |
| description | A novel approach to genetic sequence analysis is presented. This approach, based on compression of algorithms, has been launched simultaneously by Grumbach and Tahi, Milosavljevic and Rivals. To reduce the description of an object, a compression algorithm replaces some regularities in the description by special codes. Thus a compression algorithm can be applied to a sequence in order to study the presence of those regularities all over the sequence. This paper explains this ability, gives examples of compression algorithms already developed and mentions their applications. Finally, the theoretical foundations of the approach are presented in an overview of the algorithmic theory of information. |
| doi_str_mv | 10.1016/0300-9084(96)84763-8 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_78510570</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>0300908496847638</els_id><sourcerecordid>20650350</sourcerecordid><originalsourceid>FETCH-LOGICAL-c388t-138ff6163d96fdd66ab8d5de0d2b646cfa95a2b036ba509af666853ab28b7c1f3</originalsourceid><addsrcrecordid>eNqFkEtLAzEUhYMotVb_gUJXYhejN5PJnWQjSPEFBTe6Dpk8JDKPmkyF_ntnbHGpqwv3nnPu4SPknMI1BYo3wAAyCaK4krgQRYksEwdkSpGJDKlgh2T6KzkmJyl9AACHXE7IREjglMOULJZds44updC1c93a-btrXR_MPLnPjWuNG5a63qaQTsmR13VyZ_s5I28P96_Lp2z18vi8vFtlhgnRZ5QJ73EoYSV6axF1JSy3DmxeYYHGa8l1XgHDSnOQ2iOi4ExXuahKQz2bkctd7jp2Q4XUqyYk4-pat67bJFUKToGX8K8wB-TA-CgsdkITu5Si82odQ6PjVlFQI0o1clIjJyVR_aBUYrBd7PM3VePsr2nPbrjf7u5uoPEVXFTJhBGZDdGZXtku_P3gG_pcgcM</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>20650350</pqid></control><display><type>article</type><title>Compression and genetic sequence analysis</title><source>MEDLINE</source><source>Access via ScienceDirect (Elsevier)</source><creator>Rivals, É. ; Dauchet, M. ; Delahaye, J.P. ; Delgrange, O.</creator><creatorcontrib>Rivals, É. ; Dauchet, M. ; Delahaye, J.P. ; Delgrange, O.</creatorcontrib><description>A novel approach to genetic sequence analysis is presented. This approach, based on compression of algorithms, has been launched simultaneously by Grumbach and Tahi, Milosavljevic and Rivals. To reduce the description of an object, a compression algorithm replaces some regularities in the description by special codes. Thus a compression algorithm can be applied to a sequence in order to study the presence of those regularities all over the sequence. This paper explains this ability, gives examples of compression algorithms already developed and mentions their applications. Finally, the theoretical foundations of the approach are presented in an overview of the algorithmic theory of information.</description><identifier>ISSN: 0300-9084</identifier><identifier>EISSN: 1638-6183</identifier><identifier>DOI: 10.1016/0300-9084(96)84763-8</identifier><identifier>PMID: 8905150</identifier><language>eng</language><publisher>France: Elsevier Masson SAS</publisher><subject>Algorithms ; compression algorithms ; Information Systems ; Information Theory ; Kolmogorov complexity ; regularity detection ; Repetitive Sequences, Nucleic Acid ; Sequence Analysis - methods ; sequence classification</subject><ispartof>Biochimie, 1996, Vol.78 (5), p.315-322</ispartof><rights>1996</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c388t-138ff6163d96fdd66ab8d5de0d2b646cfa95a2b036ba509af666853ab28b7c1f3</citedby><cites>FETCH-LOGICAL-c388t-138ff6163d96fdd66ab8d5de0d2b646cfa95a2b036ba509af666853ab28b7c1f3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://dx.doi.org/10.1016/0300-9084(96)84763-8$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,780,784,3550,4024,27923,27924,27925,45995</link.rule.ids><backlink>$$Uhttps://www.ncbi.nlm.nih.gov/pubmed/8905150$$D View this record in MEDLINE/PubMed$$Hfree_for_read</backlink></links><search><creatorcontrib>Rivals, É.</creatorcontrib><creatorcontrib>Dauchet, M.</creatorcontrib><creatorcontrib>Delahaye, J.P.</creatorcontrib><creatorcontrib>Delgrange, O.</creatorcontrib><title>Compression and genetic sequence analysis</title><title>Biochimie</title><addtitle>Biochimie</addtitle><description>A novel approach to genetic sequence analysis is presented. This approach, based on compression of algorithms, has been launched simultaneously by Grumbach and Tahi, Milosavljevic and Rivals. To reduce the description of an object, a compression algorithm replaces some regularities in the description by special codes. Thus a compression algorithm can be applied to a sequence in order to study the presence of those regularities all over the sequence. This paper explains this ability, gives examples of compression algorithms already developed and mentions their applications. Finally, the theoretical foundations of the approach are presented in an overview of the algorithmic theory of information.</description><subject>Algorithms</subject><subject>compression algorithms</subject><subject>Information Systems</subject><subject>Information Theory</subject><subject>Kolmogorov complexity</subject><subject>regularity detection</subject><subject>Repetitive Sequences, Nucleic Acid</subject><subject>Sequence Analysis - methods</subject><subject>sequence classification</subject><issn>0300-9084</issn><issn>1638-6183</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1996</creationdate><recordtype>article</recordtype><sourceid>EIF</sourceid><recordid>eNqFkEtLAzEUhYMotVb_gUJXYhejN5PJnWQjSPEFBTe6Dpk8JDKPmkyF_ntnbHGpqwv3nnPu4SPknMI1BYo3wAAyCaK4krgQRYksEwdkSpGJDKlgh2T6KzkmJyl9AACHXE7IREjglMOULJZds44updC1c93a-btrXR_MPLnPjWuNG5a63qaQTsmR13VyZ_s5I28P96_Lp2z18vi8vFtlhgnRZ5QJ73EoYSV6axF1JSy3DmxeYYHGa8l1XgHDSnOQ2iOi4ExXuahKQz2bkctd7jp2Q4XUqyYk4-pat67bJFUKToGX8K8wB-TA-CgsdkITu5Si82odQ6PjVlFQI0o1clIjJyVR_aBUYrBd7PM3VePsr2nPbrjf7u5uoPEVXFTJhBGZDdGZXtku_P3gG_pcgcM</recordid><startdate>1996</startdate><enddate>1996</enddate><creator>Rivals, É.</creator><creator>Dauchet, M.</creator><creator>Delahaye, J.P.</creator><creator>Delgrange, O.</creator><general>Elsevier Masson SAS</general><scope>CGR</scope><scope>CUY</scope><scope>CVF</scope><scope>ECM</scope><scope>EIF</scope><scope>NPM</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7QO</scope><scope>8FD</scope><scope>FR3</scope><scope>P64</scope><scope>RC3</scope><scope>7X8</scope></search><sort><creationdate>1996</creationdate><title>Compression and genetic sequence analysis</title><author>Rivals, É. ; Dauchet, M. ; Delahaye, J.P. ; Delgrange, O.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c388t-138ff6163d96fdd66ab8d5de0d2b646cfa95a2b036ba509af666853ab28b7c1f3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1996</creationdate><topic>Algorithms</topic><topic>compression algorithms</topic><topic>Information Systems</topic><topic>Information Theory</topic><topic>Kolmogorov complexity</topic><topic>regularity detection</topic><topic>Repetitive Sequences, Nucleic Acid</topic><topic>Sequence Analysis - methods</topic><topic>sequence classification</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Rivals, É.</creatorcontrib><creatorcontrib>Dauchet, M.</creatorcontrib><creatorcontrib>Delahaye, J.P.</creatorcontrib><creatorcontrib>Delgrange, O.</creatorcontrib><collection>Medline</collection><collection>MEDLINE</collection><collection>MEDLINE (Ovid)</collection><collection>MEDLINE</collection><collection>MEDLINE</collection><collection>PubMed</collection><collection>CrossRef</collection><collection>Biotechnology Research Abstracts</collection><collection>Technology Research Database</collection><collection>Engineering Research Database</collection><collection>Biotechnology and BioEngineering Abstracts</collection><collection>Genetics Abstracts</collection><collection>MEDLINE - Academic</collection><jtitle>Biochimie</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Rivals, É.</au><au>Dauchet, M.</au><au>Delahaye, J.P.</au><au>Delgrange, O.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Compression and genetic sequence analysis</atitle><jtitle>Biochimie</jtitle><addtitle>Biochimie</addtitle><date>1996</date><risdate>1996</risdate><volume>78</volume><issue>5</issue><spage>315</spage><epage>322</epage><pages>315-322</pages><issn>0300-9084</issn><eissn>1638-6183</eissn><abstract>A novel approach to genetic sequence analysis is presented. This approach, based on compression of algorithms, has been launched simultaneously by Grumbach and Tahi, Milosavljevic and Rivals. To reduce the description of an object, a compression algorithm replaces some regularities in the description by special codes. Thus a compression algorithm can be applied to a sequence in order to study the presence of those regularities all over the sequence. This paper explains this ability, gives examples of compression algorithms already developed and mentions their applications. Finally, the theoretical foundations of the approach are presented in an overview of the algorithmic theory of information.</abstract><cop>France</cop><pub>Elsevier Masson SAS</pub><pmid>8905150</pmid><doi>10.1016/0300-9084(96)84763-8</doi><tpages>8</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0300-9084 |
| ispartof | Biochimie, 1996, Vol.78 (5), p.315-322 |
| issn | 0300-9084 1638-6183 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_78510570 |
| source | MEDLINE; Access via ScienceDirect (Elsevier) |
| subjects | Algorithms compression algorithms Information Systems Information Theory Kolmogorov complexity regularity detection Repetitive Sequences, Nucleic Acid Sequence Analysis - methods sequence classification |
| title | Compression and genetic sequence analysis |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-25T03%3A51%3A07IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Compression%20and%20genetic%20sequence%20analysis&rft.jtitle=Biochimie&rft.au=Rivals,%20%C3%89.&rft.date=1996&rft.volume=78&rft.issue=5&rft.spage=315&rft.epage=322&rft.pages=315-322&rft.issn=0300-9084&rft.eissn=1638-6183&rft_id=info:doi/10.1016/0300-9084(96)84763-8&rft_dat=%3Cproquest_cross%3E20650350%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=20650350&rft_id=info:pmid/8905150&rft_els_id=0300908496847638&rfr_iscdi=true |