首页> 美国卫生研究院文献>Virulence >Bioinformatics analysis of large-scale viral sequences
【2h】

Bioinformatics analysis of large-scale viral sequences

机译:大规模病毒序列的生物信息学分析

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

Due to a significant decrease in the cost of DNA sequencing, the number of sequences submitted to the public databases has dramatically increased in recent years. Efficient analysis of these data sets may lead to a significant understanding of the nature of pathogens such as bacteria, viruses, parasites, etc. However, this has raised questions about the efficacy of currently available algorithms for the study of pathogen evolution and construction of phylogenetic trees. While the advanced algorithms and corresponding programs are being developed, it is crucial to optimize the available ones in order to cope with the current need. The protocol presented in this study is optimized using a number of strategies currently being proposed for handling large-scale DNA sequence data sets, and offers a highly efficacious and accurate method for computing phylogenetic trees with limited computer resources. The protocol may take up to 36 h for construction and annotation of a final tree of about 20,000 sequences.
机译:由于DNA测序成本的显着降低,近年来提交给公共数据库的序列数量急剧增加。对这些数据集的有效分析可能会导致对诸如细菌,病毒,寄生虫等病原体性质的深刻理解。然而,这引起了对目前可用的研究病原体进化和系统发育的算法的有效性的疑问。树木。在开发高级算法和相应程序的同时,至关重要的是优化可用算法以应对当前需求。这项研究中提出的协议已使用当前提出的用于处理大规模DNA序列数据集的多种策略进行了优化,并提供了一种高效且准确的方法来用有限的计算机资源来计算系统树。该协议最多可能需要36小时来构建和注释约20,000个序列的最终树。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号