• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • 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分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

世界竞赛(WCC)算法:一种用于解决生物和非生物问题的新型智能优化算法。

World Competitive Contests (WCC) algorithm: A novel intelligent optimization algorithm for biological and non-biological problems.

作者信息

Masoudi-Sobhanzadeh Yosef, Motieghader Habib

机构信息

Department of Computer Engineering, Payam Noor University, Tabriz, Iran.

Laboratory of Systems Biology and Bioinformatics (LBB), Institute of Biochemistry and Biophysics, University of Tehran, Tehran, Iran.

出版信息

Inform Med Unlocked. 2016;3:15-28. doi: 10.1016/j.imu.2016.06.002. Epub 2016 Jun 28.

DOI:10.1016/j.imu.2016.06.002
PMID:32363231
原文链接:https://pmc.ncbi.nlm.nih.gov/articles/PMC7185599/
Abstract

Since different sciences face lots of problems which cannot be solved in reasonable time order, we need new methods and algorithms for getting acceptable answers in proper time order. In the present study, a novel intelligent optimization algorithm, known as WCC (World Competitive Contests), has been proposed and applied to find the transcriptional factor binding sites (TFBS) and eight benchmark functions discovery processes. We recognize the need to introduce an intelligent optimization algorithm because the TFBS discovery is a biological and an NP-Hard problem. Although there are some intelligent algorithms for the purpose of solving the above-mentioned problems, an optimization algorithm with good and acceptable performance, which is based on the real parameters, is essential. Like the other optimization algorithms, the proposed algorithm starts with the first population of teams. After teams are put into different groups, they will begin competing against their rival teams. The highly qualified teams will ascend to the elimination stage and will play each other in the next rounds. The other teams will wait for a new season to start. In this paper, we're going to implement our proposed algorithm and compare it with five famous optimization algorithms from the perspective of the following the obtained results, stability, convergence, standard deviation and elapsed time, which are applied to the real and randomly created datasets with different motif sizes. According to our obtained results, in many cases, the WCC׳s performance is better than the other algorithms'.

摘要

由于不同学科面临许多无法按合理时间顺序解决的问题,我们需要新的方法和算法,以便能按适当的时间顺序获得可接受的答案。在本研究中,一种名为世界竞争竞赛(WCC)的新型智能优化算法被提出,并应用于寻找转录因子结合位点(TFBS)以及八个基准函数发现过程。我们认识到引入一种智能优化算法的必要性,因为TFBS发现是一个生物学问题且属于NP难问题。尽管有一些智能算法用于解决上述问题,但一种基于实参数且具有良好且可接受性能的优化算法至关重要。与其他优化算法一样,所提出的算法从第一批团队群体开始。团队被分成不同组后,它们将开始与对手团队竞争。高素质的团队将晋级淘汰赛阶段,并在下一轮中相互比赛。其他团队将等待新赛季开始。在本文中,我们将实现我们提出的算法,并从以下方面的结果、稳定性、收敛性、标准差和运行时间的角度,将其与五种著名的优化算法进行比较,这些算法应用于具有不同基序大小的真实和随机创建的数据集。根据我们获得的结果,在许多情况下,WCC的性能优于其他算法。

https://cdn.ncbi.nlm.nih.gov/pmc/blobs/7666/7185599/07ff90afffd3/gr11.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/7666/7185599/71e56d9621fb/gr1.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/7666/7185599/cfdf71336fca/gr2.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/7666/7185599/eeb67981c963/gr3.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/7666/7185599/68e906645326/gr4.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/7666/7185599/921ea0f59b46/gr5.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/7666/7185599/fe4d5f19f411/gr7.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/7666/7185599/02952ba71f71/gr6.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/7666/7185599/b158fd9a0c63/gr8.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/7666/7185599/a2d397663746/gr9.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/7666/7185599/3b6d55047926/gr10.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/7666/7185599/07ff90afffd3/gr11.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/7666/7185599/71e56d9621fb/gr1.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/7666/7185599/cfdf71336fca/gr2.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/7666/7185599/eeb67981c963/gr3.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/7666/7185599/68e906645326/gr4.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/7666/7185599/921ea0f59b46/gr5.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/7666/7185599/fe4d5f19f411/gr7.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/7666/7185599/02952ba71f71/gr6.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/7666/7185599/b158fd9a0c63/gr8.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/7666/7185599/a2d397663746/gr9.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/7666/7185599/3b6d55047926/gr10.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/7666/7185599/07ff90afffd3/gr11.jpg

相似文献

1
World Competitive Contests (WCC) algorithm: A novel intelligent optimization algorithm for biological and non-biological problems.世界竞赛(WCC)算法:一种用于解决生物和非生物问题的新型智能优化算法。
Inform Med Unlocked. 2016;3:15-28. doi: 10.1016/j.imu.2016.06.002. Epub 2016 Jun 28.
2
A new imperialist competitive algorithm with spiral rising mechanism for solving path optimization problems.一种具有螺旋上升机制的新型帝国主义竞争算法,用于解决路径优化问题。
PeerJ Comput Sci. 2022 Sep 7;8:e1075. doi: 10.7717/peerj-cs.1075. eCollection 2022.
3
A multi-objective imperialist competitive algorithm (MOICA) for finding motifs in DNA sequences.一种用于在DNA序列中寻找基序的多目标帝国主义竞争算法(MOICA)。
Math Biosci Eng. 2019 Feb 26;16(3):1575-1596. doi: 10.3934/mbe.2019075.
4
A New Two-Stage Algorithm for Solving Optimization Problems.一种求解优化问题的新型两阶段算法。
Entropy (Basel). 2021 Apr 20;23(4):491. doi: 10.3390/e23040491.
5
Differential Cloud Particles Evolution Algorithm Based on Data-Driven Mechanism for Applications of ANN.基于数据驱动机制的用于人工神经网络应用的差分云粒子进化算法
Comput Intell Neurosci. 2017;2017:8469103. doi: 10.1155/2017/8469103. Epub 2017 Jul 6.
6
Disruption-Based Multiobjective Equilibrium Optimization Algorithm.基于干扰的多目标均衡优化算法
Comput Intell Neurosci. 2020 Nov 30;2020:8846250. doi: 10.1155/2020/8846250. eCollection 2020.
7
A hybrid cuckoo search algorithm with Nelder Mead method for solving global optimization problems.一种结合Nelder Mead方法的布谷鸟搜索混合算法用于求解全局优化问题。
Springerplus. 2016 Apr 18;5:473. doi: 10.1186/s40064-016-2064-1. eCollection 2016.
8
A Novel Optimization Technique to Improve Gas Recognition by Electronic Noses Based on the Enhanced Krill Herd Algorithm.一种基于增强型磷虾群算法的用于提高电子鼻气体识别能力的新型优化技术。
Sensors (Basel). 2016 Aug 12;16(8):1275. doi: 10.3390/s16081275.
9
Enhanced intelligent water drops algorithm for multi-depot vehicle routing problem.增强型智能水滴算法求解多仓库车辆路径问题。
PLoS One. 2018 Mar 19;13(3):e0193751. doi: 10.1371/journal.pone.0193751. eCollection 2018.
10
An Opposition-Based Evolutionary Algorithm for Many-Objective Optimization with Adaptive Clustering Mechanism.基于反对派的具有自适应聚类机制的多目标优化进化算法。
Comput Intell Neurosci. 2019 May 2;2019:5126239. doi: 10.1155/2019/5126239. eCollection 2019.

引用本文的文献

1
A novel early stage drip irrigation system cost estimation model based on management and environmental variables.一种基于管理和环境变量的新型早期滴灌系统成本估算模型。
Sci Rep. 2025 Feb 3;15(1):4089. doi: 10.1038/s41598-025-88446-x.
2
A voting-based machine learning approach for classifying biological and clinical datasets.基于投票的机器学习方法在生物和临床数据集分类中的应用。
BMC Bioinformatics. 2023 Apr 11;24(1):140. doi: 10.1186/s12859-023-05274-4.
3
World competitive contest-based artificial neural network: A new class-specific method for classification of clinical and biological datasets.

本文引用的文献

1
An SH3 binding motif within the nucleocapsid protein of porcine reproductive and respiratory syndrome virus interacts with the host cellular signaling proteins STAMI, TXK, Fyn, Hck, and cortactin.猪繁殖与呼吸综合征病毒核衣壳蛋白内的一个SH3结合基序与宿主细胞信号蛋白STAMI、TXK、Fyn、Hck和皮质肌动蛋白相互作用。
Virus Res. 2015 Jun 2;204:31-9. doi: 10.1016/j.virusres.2015.04.004. Epub 2015 Apr 13.
2
A content and structural assessment of oxidative motifs across a diverse set of life forms.
Comput Biol Med. 2014 Oct;53:179-89. doi: 10.1016/j.compbiomed.2014.07.008. Epub 2014 Jul 27.
3
Cell adhesion as a novel approach to determining the cellular binding motif on the severe acute respiratory syndrome coronavirus spike protein.细胞黏附作为一种新方法,用于确定严重急性呼吸综合征冠状病毒刺突蛋白上的细胞结合基序。
基于世界竞赛的人工神经网络:一种用于临床和生物学数据集分类的新型特定类别方法。
Genomics. 2021 Jan;113(1 Pt 2):541-552. doi: 10.1016/j.ygeno.2020.09.047. Epub 2020 Sep 28.
4
Synthetic repurposing of drugs against hypertension: a datamining method based on association rules and a novel discrete algorithm.合成药物再利用治疗高血压:基于关联规则和新型离散算法的数据挖掘方法。
BMC Bioinformatics. 2020 Jul 16;21(1):313. doi: 10.1186/s12859-020-03644-w.
5
Trader as a new optimization algorithm predicts drug-target interactions efficiently.交易员算法作为一种新的优化算法能够有效地预测药物-靶标相互作用。
Sci Rep. 2019 Jun 27;9(1):9348. doi: 10.1038/s41598-019-45814-8.
6
FeatureSelect: a software for feature selection based on machine learning approaches.FeatureSelect:一款基于机器学习方法的特征选择软件。
BMC Bioinformatics. 2019 Apr 3;20(1):170. doi: 10.1186/s12859-019-2754-0.
7
Sequential and Mixed Genetic Algorithm and Learning Automata (SGALA, MGALA) for Feature Selection in QSAR.用于定量构效关系中特征选择的序列与混合遗传算法及学习自动机(SGALA、MGALA)
Iran J Pharm Res. 2017 Spring;16(2):533-553.
J Virol Methods. 2014 Jun;201:1-6. doi: 10.1016/j.jviromet.2014.01.022. Epub 2014 Feb 13.
4
Identification of the monocyte activating motif in Mycobacterium tuberculosis chaperonin 60.1.鉴定结核分枝杆菌伴侣蛋白 60.1 中的单核细胞激活基序。
Tuberculosis (Edinb). 2013 Jul;93(4):442-7. doi: 10.1016/j.tube.2013.04.001. Epub 2013 May 3.
5
Evolution of Bcl-2 homology motifs: homology versus homoplasy.Bcl-2 同源结构域的进化:同源性与同功性。
Trends Cell Biol. 2013 Mar;23(3):103-11. doi: 10.1016/j.tcb.2012.10.010. Epub 2012 Nov 27.
6
Identification of new human cadherin genes using a combination of protein motif search and gene finding methods.利用蛋白质基序搜索和基因发现方法相结合来鉴定新的人类钙黏蛋白基因。
J Mol Biol. 2004 Mar 19;337(2):307-17. doi: 10.1016/j.jmb.2004.01.026.