.png){kind=icon}
返回
Sequence squeeze: an open contest for sequence compression
.png){kind=icon}
OA
AI
DOI：10.1186/2047-217X-2-5.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Next-generation sequencing machines produce large quantities of data which are becoming increasingly difficult to move between collaborating organisations or even store within a single organisation. Compressing the data to assist with this is vital, but existing techniques do not perform as well as might be expected. The need for a new compression technique was identified by the Pistoia Alliance who commissioned an open innovation contest to find one. The dynamic and interactive nature of the contest led to some novel algorithms and a high level of competition between participants.
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.9
论文数:
1.6K
被引数:
1.2W
机构
暂无机构信息
引用论文
The sequence read archive: explosive growth of sequencing datasequence read archive: 测序数据的爆炸式增长.png)
NUCLEIC ACIDS RESEARCHOAAI
NUCLEIC ACIDS RESEARCHIF13.1
OAAI分享收藏Assemblathon 1: A competitive assessment of de novo short read assembly methodsGENOME RESEARCHOAAI
GENOME RESEARCHIF5.5
OAAI分享收藏Efficient storage of high throughput DNA sequencing data using reference-based compressionGENOME RESEARCHOAAI
GENOME RESEARCHIF5.5
OAAI分享收藏分享收藏