计算机科学
可扩展性
计数数据
背景(考古学)
最大化
字错误率
数据挖掘
人工智能
统计
数据库
数学
生物
泊松分布
数学优化
古生物学
作者
Edward Wijaya,Martin C. Frith,Yutaka Suzuki,Paul Horton
出处
期刊:PubMed
日期:2009-10-01
卷期号:23 (1): 189-201
被引量:43
摘要
Next generation sequencing technologies enable rapid, large-scale production of sequence data sets. Unfortunately these technologies also have a non-neglible sequencing error rate, which biases their outputs by introducing false reads and reducing the quantity of the real reads. Although methods developed for SAGE data can reduce these false counts to a considerable degree, until now they have not been implemented in a scalable way. Recently, a program named FREC has been developed to address this problem for next generation sequencing data. In this paper, we introduce RECOUNT, our implementation of an Expectation Maximization algorithm for tag count correction and compare it to FREC. Using both the reference genome and simulated data, we find that RECOUNT performs as well or better than FREC, while using much less memory (e.g. 5GB vs. 75GB). Furthermore, we report the first analysis of tag count correction with real data in the context of gene expression analysis. Our results show that tag count correction not only increases the number of mappable tags, but can make a real difference in the biological interpretation of next generation sequencing data. RECOUNT is an open-source C++ program available at http://seq.cbrc.jp/recount.
科研通智能强力驱动
Strongly Powered by AbleSci AI