HPTree:通过NJ模型和Hadoop重建超大未对齐DNA序列的系统发育树

Q. Zou, Shixiang Wan, Xiangxiang Zeng
{"title":"HPTree:通过NJ模型和Hadoop重建超大未对齐DNA序列的系统发育树","authors":"Q. Zou, Shixiang Wan, Xiangxiang Zeng","doi":"10.1109/BIBM.2016.7822492","DOIUrl":null,"url":null,"abstract":"Constructing phylogenetic tree for ultra-large sequences (eg. Files more than 1GB) is quite difficult, especially for the unaligned DNA sequences. It is meaningless and impracticable to do multiple sequence alignment for large diverse DNA sequences. We try to do clustering firstly for the mounts of DNA sequences, and divide them into several clusters. Then each cluster is aligned and phylogenetic analysed in parallel. Hadoop, which is the most popular parallel platform in cloud computing, is employed for this process. Our software tool HPTree can handle the >1GB DNA sequence file or more than 1,000,000 DNA sequences in few hours. Users could try HPTree in the cloud computing platform (eg. Amazon) or their own clusters for the big data phylogenetic tree reconstruction. No super machine or large memory is required. HPTree could benefit the users who focus on population evolution or long common genes (eg. 16s rRNA) evolution. The software tool along with its codes and datasets are accessible at http://lab.malab.cn/soft/HPtree/.","PeriodicalId":345384,"journal":{"name":"2016 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)","volume":"318 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"HPTree: Reconstructing phylogenetic trees for ultra-large unaligned DNA sequences via NJ model and Hadoop\",\"authors\":\"Q. Zou, Shixiang Wan, Xiangxiang Zeng\",\"doi\":\"10.1109/BIBM.2016.7822492\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Constructing phylogenetic tree for ultra-large sequences (eg. Files more than 1GB) is quite difficult, especially for the unaligned DNA sequences. It is meaningless and impracticable to do multiple sequence alignment for large diverse DNA sequences. We try to do clustering firstly for the mounts of DNA sequences, and divide them into several clusters. Then each cluster is aligned and phylogenetic analysed in parallel. Hadoop, which is the most popular parallel platform in cloud computing, is employed for this process. Our software tool HPTree can handle the >1GB DNA sequence file or more than 1,000,000 DNA sequences in few hours. Users could try HPTree in the cloud computing platform (eg. Amazon) or their own clusters for the big data phylogenetic tree reconstruction. No super machine or large memory is required. HPTree could benefit the users who focus on population evolution or long common genes (eg. 16s rRNA) evolution. The software tool along with its codes and datasets are accessible at http://lab.malab.cn/soft/HPtree/.\",\"PeriodicalId\":345384,\"journal\":{\"name\":\"2016 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)\",\"volume\":\"318 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/BIBM.2016.7822492\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BIBM.2016.7822492","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

摘要

构建超大序列的系统发育树。文件超过1GB)是相当困难的,特别是对于未对齐的DNA序列。对大量不同的DNA序列进行多序列比对是没有意义和不可行的。我们首先尝试对DNA序列进行聚类,并将它们分成若干个聚类。然后对每个簇进行排列,并并行进行系统发育分析。Hadoop是云计算中最流行的并行平台,它被用于这个过程。我们的软件工具HPTree可以在几个小时内处理>1GB的DNA序列文件或超过1,000,000个DNA序列。用户可以在云计算平台(例如:Amazon)或自己的集群进行大数据系统发育树重建。不需要超级机器或大内存。HPTree可以使关注群体进化或长共同基因的用户受益。16s rRNA)进化。该软件工具及其代码和数据集可在http://lab.malab.cn/soft/HPtree/上访问。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
HPTree: Reconstructing phylogenetic trees for ultra-large unaligned DNA sequences via NJ model and Hadoop
Constructing phylogenetic tree for ultra-large sequences (eg. Files more than 1GB) is quite difficult, especially for the unaligned DNA sequences. It is meaningless and impracticable to do multiple sequence alignment for large diverse DNA sequences. We try to do clustering firstly for the mounts of DNA sequences, and divide them into several clusters. Then each cluster is aligned and phylogenetic analysed in parallel. Hadoop, which is the most popular parallel platform in cloud computing, is employed for this process. Our software tool HPTree can handle the >1GB DNA sequence file or more than 1,000,000 DNA sequences in few hours. Users could try HPTree in the cloud computing platform (eg. Amazon) or their own clusters for the big data phylogenetic tree reconstruction. No super machine or large memory is required. HPTree could benefit the users who focus on population evolution or long common genes (eg. 16s rRNA) evolution. The software tool along with its codes and datasets are accessible at http://lab.malab.cn/soft/HPtree/.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
The role of high performance, grid and cloud computing in high-throughput sequencing A novel algorithm for identifying essential proteins by integrating subcellular localization CNNsite: Prediction of DNA-binding residues in proteins using Convolutional Neural Network with sequence features Inferring Social Influence of anti-Tobacco mass media campaigns Emotion recognition from multi-channel EEG data through Convolutional Recurrent Neural Network
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1