• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

生物序列比对算法组件组装平台研究

Research on Components Assembly Platform of Biological Sequences Alignment Algorithm.

作者信息

Shi Haihe, Wu Gang, Zhang Xuchu, Wang Jun, Shi Haipeng, Xu Shenghua

机构信息

School of Computer and Information Engineering, Jiangxi Normal University, Nanchang, China.

School of Information Management, Jiangxi University of Finance and Economics, Nanchang, China.

出版信息

Front Genet. 2021 Jan 21;11:630923. doi: 10.3389/fgene.2020.630923. eCollection 2020.

DOI:10.3389/fgene.2020.630923
PMID:33552143
原文链接:https://pmc.ncbi.nlm.nih.gov/articles/PMC7859483/
Abstract

After years of development, the complexity of the biological sequence alignment algorithm is gradually increasing, and the lack of high abstract level domain research leads to the complexity of its algorithm development and improvement. By applying the idea of software components to the design and development of algorithms, the development efficiency and reliability of biological sequence alignment algorithms can be effectively improved. The component assembly platform applies related assembly technology, which simplifies the operation difficulty of component assembly and facilitates the maintenance and optimization of the algorithm. At the same time, a friendly visual interface is used to intuitively complete the assembly of algorithm components, and an executable sequence alignment algorithm program is obtained, which can directly carry out alignment computing.

摘要

经过多年发展,生物序列比对算法的复杂度逐渐增加,而缺乏高抽象层次的领域研究导致其算法开发与改进的复杂性。通过将软件组件的思想应用于算法的设计与开发,可有效提高生物序列比对算法的开发效率与可靠性。组件组装平台应用相关组装技术,简化了组件组装的操作难度,便于算法的维护与优化。同时,使用友好的可视化界面直观地完成算法组件的组装,得到可直接进行比对计算的可执行序列比对算法程序。

https://cdn.ncbi.nlm.nih.gov/pmc/blobs/800f/7859483/84887333ea09/fgene-11-630923-g0007.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/800f/7859483/7fd2df7e1728/fgene-11-630923-g0001.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/800f/7859483/4a5811a37aa4/fgene-11-630923-g0002.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/800f/7859483/fcaae13f3d95/fgene-11-630923-g0003.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/800f/7859483/bfbdd3e2ba9f/fgene-11-630923-g0004.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/800f/7859483/2b02a78e3b40/fgene-11-630923-g0005.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/800f/7859483/b736ce2eed85/fgene-11-630923-g0006.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/800f/7859483/84887333ea09/fgene-11-630923-g0007.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/800f/7859483/7fd2df7e1728/fgene-11-630923-g0001.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/800f/7859483/4a5811a37aa4/fgene-11-630923-g0002.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/800f/7859483/fcaae13f3d95/fgene-11-630923-g0003.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/800f/7859483/bfbdd3e2ba9f/fgene-11-630923-g0004.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/800f/7859483/2b02a78e3b40/fgene-11-630923-g0005.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/800f/7859483/b736ce2eed85/fgene-11-630923-g0006.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/800f/7859483/84887333ea09/fgene-11-630923-g0007.jpg

相似文献

1
Research on Components Assembly Platform of Biological Sequences Alignment Algorithm.生物序列比对算法组件组装平台研究
Front Genet. 2021 Jan 21;11:630923. doi: 10.3389/fgene.2020.630923. eCollection 2020.
2
Efficient Multiple Sequences Alignment Algorithm Generation Components Assembly Under PAR Framework.并行架构下高效多序列比对算法生成组件装配
Front Genet. 2021 Feb 4;11:628175. doi: 10.3389/fgene.2020.628175. eCollection 2020.
3
Component-Based Design and Assembly of Heuristic Multiple Sequence Alignment Algorithms.基于组件的启发式多序列比对算法设计与组装
Front Genet. 2020 Feb 27;11:105. doi: 10.3389/fgene.2020.00105. eCollection 2020.
4
Computational complexity of algorithms for sequence comparison, short-read assembly and genome alignment.用于序列比较、短读长拼接和基因组比对的算法的计算复杂性。
Biosystems. 2017 Jun-Jul;156-157:72-85. doi: 10.1016/j.biosystems.2017.03.003. Epub 2017 Apr 6.
5
CMSA: a heterogeneous CPU/GPU computing system for multiple similar RNA/DNA sequence alignment.CMSA:一种用于多个相似RNA/DNA序列比对的异构CPU/GPU计算系统。
BMC Bioinformatics. 2017 Jun 24;18(1):315. doi: 10.1186/s12859-017-1725-6.
6
Genomic multiple sequence alignments: refinement using a genetic algorithm.基因组多序列比对:使用遗传算法进行优化
BMC Bioinformatics. 2005 Aug 8;6:200. doi: 10.1186/1471-2105-6-200.
7
Sequence alignment with an appropriate substitution matrix.使用合适的替换矩阵进行序列比对。
J Comput Biol. 2008 Mar;15(2):129-38. doi: 10.1089/cmb.2007.0155.
8
Accelerating the Smith-Waterman algorithm with interpair pruning and band optimization for the all-pairs comparison of base sequences.通过配对间剪枝和带优化加速史密斯-沃特曼算法以进行碱基序列的全配对比较。
BMC Bioinformatics. 2015 Oct 6;16:321. doi: 10.1186/s12859-015-0744-4.
9
Constrained multiple sequence alignment tool development and its application to RNase family alignment.受限多序列比对工具的开发及其在核糖核酸酶家族比对中的应用。
Proc IEEE Comput Soc Bioinform Conf. 2002;1:127-37.
10
Constrained multiple sequence alignment tool development and its application to RNase family alignment.受限多序列比对工具的开发及其在核糖核酸酶家族比对中的应用。
J Bioinform Comput Biol. 2003 Jul;1(2):267-87. doi: 10.1142/s0219720003000095.

引用本文的文献

1
Bioinformatic Characterization of Whole Blood Neutrophils in Pelvic Inflammatory Disease: A Potential Prognostic Indicator for Transumbilical Single-Port Laparoscopic Pelvic Abscess Surgery.全血中性粒细胞的生物信息学特征在盆腔炎中的研究:经脐单孔腹腔镜盆腔脓肿手术的潜在预后指标。
Comput Math Methods Med. 2022 Apr 1;2022:2555603. doi: 10.1155/2022/2555603. eCollection 2022.
2
Exploration of the Effect on Genome-Wide DNA Methylation by Knock-Out in Liver.敲除对肝脏全基因组 DNA 甲基化的影响探索。
Int J Mol Sci. 2021 Dec 3;22(23):13075. doi: 10.3390/ijms222313075.

本文引用的文献

1
ProbPFP: a multiple sequence alignment algorithm combining hidden Markov model optimized by particle swarm optimization with partition function.ProbPFP:一种通过粒子群优化算法优化的隐马尔可夫模型与分区函数相结合的多序列比对算法。
BMC Bioinformatics. 2019 Nov 25;20(Suppl 18):573. doi: 10.1186/s12859-019-3132-7.
2
SpliVert: A Protein Multiple Sequence Alignment Refinement Method Based on Splitting-Splicing Vertically.SpliVert:一种基于垂直拆分-拼接的蛋白质多序列比对优化方法。
Protein Pept Lett. 2020;27(4):295-302. doi: 10.2174/0929866526666190806143959.
3
Bioinformatics Methods and Biological Interpretation for Next-Generation Sequencing Data.
下一代测序数据的生物信息学方法与生物学解读
Biomed Res Int. 2015;2015:690873. doi: 10.1155/2015/690873. Epub 2015 Sep 7.
4
COFFEE: an objective function for multiple sequence alignments.COFFEE:一种用于多序列比对的目标函数。
Bioinformatics. 1998 Jun;14(5):407-22. doi: 10.1093/bioinformatics/14.5.407.
5
On the complexity of multiple sequence alignment.论多序列比对的复杂性。
J Comput Biol. 1994 Winter;1(4):337-48. doi: 10.1089/cmb.1994.1.337.
6
CLUSTAL W: improving the sensitivity of progressive multiple sequence alignment through sequence weighting, position-specific gap penalties and weight matrix choice.CLUSTAL W:通过序列加权、位置特异性空位罚分和权重矩阵选择提高渐进多序列比对的灵敏度。
Nucleic Acids Res. 1994 Nov 11;22(22):4673-80. doi: 10.1093/nar/22.22.4673.
7
The neighbor-joining method: a new method for reconstructing phylogenetic trees.邻接法:一种重建系统发育树的新方法。
Mol Biol Evol. 1987 Jul;4(4):406-25. doi: 10.1093/oxfordjournals.molbev.a040454.