维普中文期刊产品整合服务

Review of General Algorithmic Features for Genome Assemblers for Next Generation Sequencers

查看全文 作  者:Bilal [1,2]Wajid;Erchin [2]Serpedin 高影响力作者 机构地区:[1]Department of Electrical Engineering,University of Engineering and Technology,Lahore 54890,Punjab,Pakistan;[2]Department of Electrical and Computer Engineering,Texas A & M University,College Station,TX 77843-3128,USA高影响力机构 出  处:《Genomics, Proteomics & Bioinformatics》索引2012年第10卷第2期,共16页高影响力期刊 基  金:funded by the University of Engineering and Technology,Lahore,Pakistan (Grant No. Estab/DBS/411);National Science Foundation(Grant No. 0915444) 摘  要:In the realm of bioinformatics and computational biology,the most rudimentary data upon which all the analysis is built is the sequence data of genes,proteins and RNA.The sequence data of the entire genome is the solution to the genome assembly problem.The scope of this contribution is to provide an overview on the art of problem-solving applied within the domain of genome assembly in the nextgeneration sequencing(NGS) platforms.This article discusses the major genome assemblers that were proposed in the literature during the past decade by outlining their basic working principles.It is intended to act as a qualitative,not a quantitative,tutorial to all working on genome assemblers pertaining to the next generation of sequencers.We discuss the theoretical aspects of various genome assemblers,identifying their working schemes.We also discuss briefly the direction in which the area is headed towards along with discussing core issues on software simplicity. 关 键 词:基因组 组装机 通用算法 排序 序列数据 生物学领域 生物信息学 工作原理
相关文献

参考文献(90)

引证文献(3)

网站首页 | 关于我们 | 联系我们 | 产品服务 | 客服中心 | 广告服务 | 版权声明 | 网站联盟 | 友情链接 | 售卡网点

版权所有© 渝B2-20050021-1 渝公网安备 50019002500403号 违法和不良信息举报中心

互联网出版许可证 新出网证(渝)字10号 全国400电话 - 免长途话费