输入: X=5′–x1x2⋯xn–3′ |
输出: Y=5′–y1y2⋯yn–3′ |
1: for j=1 to n |
2: List.add(j) |
3: end for |
4: k=random(n) |
5: for j=1 to k |
6: i = random(List.count) |
7: yi=(xi+random(3)+1) mod 4 |
8: List.delete(i) |
9: end for |
Citation: | QI Donglian, HAN Yifeng, ZHOU Ziqiang, YAN Yunfeng. Review of Defect Detection Technology of Power Equipment Based on Video Images[J]. Journal of Electronics & Information Technology, 2022, 44(11): 3709-3720. doi: 10.11999/JEIT211588 |
DNA计算是一种基于DNA分子的新型计算模型,由于具有大规模并行性,低能耗,海量存储等能力,DNA计算技术对求解NP完全问题的展现出极大潜力。1994年,Adleman[1]通过DNA分子成功求解7个顶点的哈密尔顿路问题。随后,DNA计算被用于求解各种NP完全问题[2],如满意度问题(SATisfaction problem, SAT)[3],旅行商问题(Traveling Salesman Problem, TSP)[4]和图着色问题[5]。在DNA计算过程中,待求解的问题被编码在DNA序列中,利用DNA分子的特异性杂交生成代表问题解的DNA分子。然而,低质量的DNA序列设计会导致非特异性杂交、不一致的解链温度,甚至DNA计算的失败。高可靠的DNA分子集合设计是提高DNA计算效率的关键。DNA分子设计需要从4n的海量解空间中挑选出满足热力学约束、相似度约束、GC含量约束等条件的DNA分子集合,DNA序列设计问题也被证明是一个NP完全问题[6]。
近年来,进化计算被广泛的应用于求解DNA序列设计问题,通过模仿自然界各种生物的进化过程,高效的搜索4n的指数级解空间。国内外研究人员已提出多种进化算法求解DNA序列设计问题,如微遗传算法(Micro-Genetic Algorithm, MGA)[7]、杂草入侵优化(Invasive Weed Optimization, IWO)算法[8]、改进的非支配排序遗传算法(Improved the Nondominated Sorting Genetic Algorithm, INSGA-II)[9]、并行多目标进化算法(parallel Multi-Objective evolutionary algorithm, pMO-ABC)[10]等。然而,目前的群智能算法需要从整个种群中选择最优个体进行下一次迭代,虽然扩大了搜索空间,但也极大地增加了时间复杂度。当目标函数较多时,种群的候选解相互非支配,也会因此缺少选择压力导致算法难以收敛。进化策略(Evolutionary Strategy, ES)也是一种进化算法,种群中的个体不需要像遗传算法进行交叉,只通过变异实现解空间的探索和开发,利用较少的计算资源找到全局最优解。ES在多目标优化问题[11]、带噪声的优化问题[12]、离散优化问题[13]和约束优化问题[14]中均表现出良好的性能。
本文提出一种多目标进化策略(MOES)算法求解DNA序列设计问题,设计的随机碱基变异算子可以兼顾局部搜索和全局搜索能力。此外,改进的评价函数综合考虑冲突指标相似度和H-measure的平衡性,可以有效地减少DNA分子集合中的非特异性杂交,可有效地提高DNA计算的可靠性。最后,通过实验跟几种最先进的DNA核酸编码算法进行比较,结果表明本文算法设计的DNA序列分子集合具有更高的质量。
DNA编码问题可表示为:设X=
minf(X)=min[f1(X),f2(X),···,fM(X)]T,f(X)∈RM | (1) |
其中,f (X)由M个目标函数 fm(x)组成, m =1, 2, ···, M。通常DNA序列设计需要满足6个编码目标函数,如相似度、H-measure、解链温度、连续性、GC含量、发卡结构。
相似度约束(similarity)可以描述两个DNA序列Xi和Xj碱基组成的相似程度[15]。满足相似度约束的两条DNA链的同向序列尽可能唯一,且序列滑动后也尽量不会重复[16]。相似度可以通过计算序列Xi和Xj之间移动后取最大相似距离得到,其计算公式如式(2)所示
fSi(X)=n∑i=1n∑j=1Si(Xi,Xj)=n∑i=1n∑j=1max−n<k<nE(Xi,σk(Xj)) | (2) |
其中,E(*,*)表示相似距离,即当对应位点碱基相等时结果为1,当k>0时,σk表示右移;当k<0时,σk表示左移,k表示移动的位数。如果Xi和Xj经过距离为k的移动后相似距离减小,那么相似度约束的值也随之减小。相似度约束值较大时序列Xi和Xj就非常相似,序列Xi和Xj的补链XjC之间互补的碱基就多,容易出现非特异性杂交;当相似度约束值较小时序列Xi和Xj相同的碱基则很少,Xi和XjC之间互补碱基就很少,从而Xi和XjC之间不会出现非特异性杂交[17]。
文献[18]将核酸碱基互补的信息扩充到汉明距离中,提出了H-measure约束以限制两条DNA序列之间的碱基互补。给定两条DNA序列Xi和Xj,通过计算Xi和Xj互补碱基的个数,H-measure可以防止Xi和Xj之间的交叉杂交[19]。H-measure可以通过计算序列Xi和Xj之间的最大滑动汉明距离得到,其公式如式(3)所示
fHm(X)=n∑i=1n∑j=1Hm(Xi,Xj)=n∑i=1n∑j=1max−n<k<nH(X,σk(Xj))H(X,Y)=∑ni=1bp(xi,yi)bp(xi,yi)={1,xi=¯yi0,xi≠¯yi,xi,yi∈{A,C,G,T}} | (3) |
如果一个DNA序列中出现连续相同的碱基,则在碱基分子氢键力作用下出现不期望的2级结构,碱基连续性的评价函数,其公式如式(4)所示
fcon(X)=n∑i=1Continuity(Xi)=n∑i=1l−t+1∑i=1(j−1)C(i)j | (4) |
其中,
DNA序列的GC含量影响该序列的化学性质,例如解链温度可以由GC含量计算得到。GC含量即为DNA序列中碱基G和碱基C的个数或者百分比,其公式如式(5)所示
fGC(X)=maxi{GC(Xi)}−minj{GC(Xj)}GC=n∑i=1l∑i=1gc(xi)gc(xi)={1,xi=G或xi=C0,xi=A或xi=T} | (5) |
单链DNA分子产生2级结构通常由自身反向折叠而形成,发卡结构(Hairpin, Hp)为典型的自身折叠结构,许多以特异性杂交反应为基础的DNA计算模型,都要求避免单链DNA形成2级结构,这样单链DNA分子才能和自身的补链充分有效地发生特异性杂交,其公式如式(6)所示
fHp(X)=n∑i=1Hp(Xi)=n∑i=1(l/Rmin)/2∑s=Sminl−2s∑r=Rminl−2s−r∑i=1T⋅(s∑j=1bp(xs+i−j,xs+i+r+j),s2) | (6) |
其中,Xi表示DNA序列X中的第i个碱基,s为发卡结构茎长,Smin为设定的最小茎长,r表示环的长度,Rmin为设定的最小环长,本文中Smin和Rmin均被设置为6。
解链温度(melting Temperature, Tm)是双链DNA分子在加温变性过程中,有50%的DNA分子打开双链变成单链时的温度。解链温度它是评价DNA分子化学热力学稳定性的一个重要参数。DNA计算要求DNA分子具有一致的解链温度。影响解链温度Tm的因素为:DNA分子组成、DNA分子浓度、溶液PH值等。根据Nearest-Neighbors热力学模型,其公式如式(7)所示
fTm(X)=maxi{Tm(Xi)}−minj{Tm(Xj)}Tm(Xi)=n∑i=1ΔH∘ΔS∘+Rln(|C|/4)} | (7) |
其中,H°是相邻碱基的总焓,S°是相邻碱基的总熵,R为气体常数(1.987 cal/kmol), C为DNA分子浓度。根据上面3个Tm值计算式可以看出,GC含量高,Tm值大;DNA分子浓度大,Tm值大;溶液PH值大,Tm值大。
Shin等人[20]通过仿真实验证明了DNA编码约束函数中存在相互冲突的目标函数,并且它们都是具有很多局部最优解的不连续的函数,而且没有全局最优解的梯度信息。传统的基于遗传算法的多目标优化算法NSGA-II和MOEA/D,通常只能处理2~3个目标函数的优化问题,产生的新种群由于高维目标函数无法比较支配关系,缺少选择压力推进种群收敛。此外,由于交叉算子实现近邻局部搜索的过程中会产生大量跟父代相似的DNA分子候选解,跟DNA编码需要降低相似度的要求相互矛盾。本文采用多目标进化策略可有效降低种群大小,提高局部和全局搜索效率。
进化策略中的核心运算是变异,对于一个长度为n的单链DNA序列X=5’–x1x2···xn–3’ 来说,可以变异的有两个变化的方面,一个是每一位碱基,另一个是同时变化碱基的个数。每一位碱基xi∈{A, C, G, T}, 本文采用四进制整数进行编码{A, C, G, T}→{0, 1, 2, 3},因此单个碱基xi可以采用式(8)进行变异。
xi=(xi+random(3)+1)mod4 | (8) |
例如,xi为碱基C=1, random(a)随机产生[0, a-1]间的任意整数,则式(8)将xi随机变换为{0, 2, 3}→{A, G,T}。
此外,对于DNA序列X=
本文采用的进化策略同时考虑局部搜索和全局搜索能力,将参数k取为单链DNA序列长度的随机数,随机确定变异碱基的总个数。进而,随机挑选k个不同的碱基位置对DNA序列进行变异,算法流程如表1所示。
输入: X=5′–x1x2⋯xn–3′ |
输出: Y=5′–y1y2⋯yn–3′ |
1: for j=1 to n |
2: List.add(j) |
3: end for |
4: k=random(n) |
5: for j=1 to k |
6: i = random(List.count) |
7: yi=(xi+random(3)+1) mod 4 |
8: List.delete(i) |
9: end for |
由于DNA序列设计问题中编码约束函数相互冲突,并且每个指标的值域不相同,进化策略的个体在变异中会存在相互非支配的解,通常采用式(9)对个体进行评价,选取适应度函数较优的个体。
Fitness(x)=m∑i=1fi(x)−fminifmaxi−fmini | (9) |
当整个种群适应度值越来越小的时候,算法就收敛的越来越好。传统的多目标进化算法需要找到分布均匀,且相互非支配的多组候选解。利用各种有效的小生境技术可以帮助让算法在收敛的过程中,保持较好的多样性。经过分析可以发现,DNA编码问题中的相似度约束(fSi)已经对DNA分子的多样性进行了限制,将多样性的保持转换为了目标函数的优化。此外,虽然从多目标优化的角度,相互非支配的候选解无法做出取舍。但是从DNA计算的实验需求上,DNA计算更倾向于选择各目标函数值较为平衡的解。以相似度和H-measure为例,高相似度的DNA分子集合,容易导致DNA分子X和Y的补链发生非特异性杂交。高H-measure的DNA分子集合,容易导致DNA分子X和Y的反向序列直接发生互补,导致非特异性杂交错配,如图1所示。
因此,在所有的相互非支配的候选解集中,理想的选择是相似度和H-measure两个指标较为平衡的解,这种类型的DNA分子集合,将更有效的减少DNA分子间非特异性杂交,保证DNA计算的可靠性。因此,我们引入相似度和H-measure目标函数值之差的平方项,引导算法选择冲突目标较均衡的解,如式(10)所示
Fitness(x)=(fSi−fHm)2+m∑i=1fi(x)−fminifmaxi−fmini | (10) |
算法首先生成初始化种群Pt,然后依次计算个体p的目标函数值。然后,种群个体变异产生新的候选个体q,如果新的候选解q能支配原个体p,则用新的候选解q替换掉原个体p,表示为q ≺ p。其中,个体q的目标函数值都小于等于个体p,且至少有1个目标函数值小于p。如果新的候选解q被原个体p支配即p ≺ q,则放弃新候选解。如果p和q之间的关系不满足上述两种情况,则定义p和q两个个体相互非支配,即(q ⊀ p) and (p ⊀ q),则比较式(10)的适应度函数值,如果新的候选解综合目标函数较小,且两个指标更平均。则新候选解替代原个体,算法流程如表2所示。
1: Initialization |
2: while (t < max iteration) |
3: for i=1 to P |
4: p = Pt(i) |
5: q = Individual Mutation(p) |
6: if q ≺ p then |
7: Pt(i)=q |
8: else if (q ⊀ p) and (p ⊀ q) then |
9: if Fitness(q) > Fitness(p) then |
10: Pt(i)=q |
11: end if |
12: end if |
13: end for |
14: t=t+1 |
15: end while |
为了验证算法的有效性,本文将算法和MGA[7], IWO[8], pMO-ABC[10]算法进行对比,根据Adelman的经典实验,产生7条长度为20的DNA序列集合进行比较,实验结果如表3所示。
方法(序列) | 连续性 | 发卡结构 | H-measure | 相似度 | Tm | GC(%) |
MGA[7] | ||||||
TAGACCACTGTTGCACATGG | 0 | 0 | 58 | 52 | 50.2794 | 50 |
ATTCGGTCAGACTTGCTGTG | 0 | 0 | 64 | 52 | 48.6650 | 50 |
ATAGTGCGGACAGTAGTTCC | 0 | 0 | 66 | 59 | 50.1634 | 50 |
AATACGCGGAACGTAACCTC | 0 | 0 | 61 | 85 | 50.4158 | 50 |
AATACGCGGAACGTAACCTC | 0 | 0 | 61 | 85 | 50.4158 | 50 |
ACAGCCTTAAGCCTAACTCC | 0 | 3 | 65 | 54 | 49.0641 | 50 |
ATGCTTCCGACATGGAATGG | 0 | 3 | 63 | 57 | 49.8160 | 50 |
f (x) | 0 | 6 | 438 | 444 | 1.7508 | 0 |
IWO[8] | ||||||
ACACCAGCACACCAGAAACA | 9 | 0 | 55 | 55 | 48.4670 | 50 |
GTTCAATCGCCTCTCGGTAT | 0 | 0 | 57 | 57 | 49.3935 | 50 |
GCTACCTCTTCCACCATTCT | 0 | 0 | 55 | 55 | 49.2453 | 50 |
GAATCAATGGCGGTCAGAAG | 0 | 0 | 66 | 66 | 49.9440 | 50 |
TTGGTCCGGTTATTCCTTCG | 0 | 0 | 65 | 65 | 50.6418 | 50 |
CCATCTTCCGTACTTCACTG | 0 | 0 | 56 | 56 | 51.0993 | 50 |
TTCGACTCGGTTCCTTGCTA | 0 | 0 | 58 | 58 | 47.6049 | 50 |
f (x) | 9 | 0 | 412 | 412 | 3.4944 | 0 |
pMO-ABC[10] | ||||||
TGTGGTTGGTTAGTCGGTTG | 0 | 0 | 46 | 49 | 51.0421 | 50 |
GGTGGTATTGGTGGTATTGG | 0 | 0 | 47 | 47 | 53.8027 | 50 |
CTTCTCTTCTCTTGCCGCTT | 0 | 0 | 39 | 56 | 46.4112 | 50 |
AACAACCTCCACACCGAACA | 0 | 0 | 62 | 32 | 49.1737 | 50 |
CTCTCTCTCTCACTCTCTCA | 0 | 0 | 41 | 48 | 46.5220 | 50 |
CTCTCATTCCTTCTTACCCC | 16 | 0 | 43 | 51 | 50.8283 | 50 |
TGGTGTTGCTGGTGTAGGTT | 0 | 0 | 48 | 51 | 49.3985 | 50 |
f (x) | 16 | 0 | 326 | 334 | 7.3915 | 0 |
MOES | ||||||
GGAGAGGAGAAGAAGAAGAG | 0 | 0 | 52 | 25 | 48.1727 | 50 |
CCTCCACATCACCATTAACC | 0 | 0 | 56 | 31 | 52.3807 | 50 |
CTCTCTCTCTCTCTCTCTCT | 0 | 0 | 34 | 37 | 45.6658 | 50 |
TTCCTTCCTTCCTTCCTTCC | 0 | 0 | 36 | 39 | 48.7500 | 50 |
TTGGTTGGTTGGTTGGTTGG | 0 | 0 | 30 | 46 | 51.3054 | 50 |
TTGTTGTTGGTGGTGGTGGT | 0 | 0 | 30 | 48 | 50.2236 | 50 |
TGTGTGTGGTGTGTGTTGTG | 0 | 0 | 30 | 46 | 51.0025 | 50 |
f (x) | 0 | 0 | 268 | 272 | 6.7149 | 0 |
从表3中可以看出4种算法在GC含量约束上的表现都很一致。在温度约束方面,4种算法都满足比较统一的解链温度。本文算法MOES产生DNA序列的连续性和发卡结构均为0,因此不会产生不期望的二级结构。此外,相似度和H-measure的数值最低,表明DNA序列集合具有更低的概率发生相互的非特异性杂交和错配。因此,从实验结果可以看出本文所提算法在解决DNA序列设计问题上比对比算法质量更高。
由于更大规模的DNA分子集合,可以用于求解更大规模的计算问题。本文生成14条长度为20的DNA序列集合,和MGA[7], INSGA-II[9], pMO-ABC[10]进行比较,实验结果如表4所示。可以看出,所有算法还是较好地满足了解链温度和GC含量的要求。本文算法显著地降低了相似度和H-measure的目标函数值,可以极大地避免DNA分子间的相互干扰,反映出算法具有最好的收敛性能。
方法(序列) | 连续性 | 发卡结构 | H-measure | 相似度 | Tm | GC(%) |
MGA[7] | ||||||
CTCATCTAATCAGCCTCGCA | 0 | 0 | 135 | 114 | 48.1554 | 50 |
CTAATAGTGACAGCTGCGTG | 0 | 3 | 131 | 119 | 50.2421 | 50 |
GCATCGTTAGAGACACCTAC | 0 | 3 | 134 | 124 | 50.7932 | 50 |
GCATCAATATGCGCGACTAC | 0 | 0 | 131 | 125 | 50.2815 | 50 |
CATTAAGTAGACGCTGTCGG | 0 | 3 | 132 | 114 | 50.9507 | 50 |
TATGGATGAGGAGGACCTAG | 0 | 3 | 133 | 117 | 50.6387 | 50 |
CAGAGATGTTCTGTACCACC | 0 | 3 | 128 | 117 | 51.2232 | 50 |
CGTCGAGAATTCGTAGCTCA | 0 | 0 | 137 | 119 | 48.3224 | 50 |
TCTGTTACCGTATCGGATCG | 0 | 3 | 129 | 115 | 50.8791 | 50 |
AGAAGAGTTCGACTTGCTGG | 0 | 3 | 134 | 121 | 47.5507 | 50 |
GCAAGGAATTCACCGTCTGT | 0 | 3 | 133 | 129 | 48.9881 | 50 |
CGTGTGAAGAGAGTGGTTCA | 0 | 0 | 127 | 123 | 48.9355 | 50 |
CGACTGAATCATGGACCTGT | 0 | 3 | 134 | 126 | 49.7624 | 50 |
TACCGAGAAGTAGGACTGCA | 0 | 3 | 134 | 124 | 48.3847 | 50 |
f (x) | 0 | 30 | 1852 | 1687 | 3.6725 | 0 |
INSGA-II[9] | ||||||
CGAGACATCGTGCATATCGT | 0 | 4 | 143 | 124 | 49.6393 | 50 |
TATAGCACGAGTGCGCGTAT | 0 | 3 | 137 | 130 | 48.5659 | 50 |
GATCTACGATCATGAGAGCG | 0 | 4 | 135 | 126 | 49.6673 | 50 |
TCTGTACTGCTGACTCGAGT | 0 | 3 | 163 | 124 | 47.1312 | 50 |
CGAGTAGTCACACGATGAGA | 0 | 0 | 152 | 132 | 49.2836 | 50 |
AGATGATCAGCAGCGACACT | 0 | 3 | 133 | 133 | 46.5546 | 50 |
TGTGCTCGTCTCTGCATACT | 0 | 4 | 159 | 130 | 47.1507 | 50 |
AGACGAGTCGTACAGTACAG | 0 | 0 | 152 | 134 | 49.9091 | 50 |
ATGTACGTGAGATGCAGCAG | 0 | 0 | 139 | 121 | 48.9270 | 50 |
ATCACTACTCGCTCGTCACT | 0 | 3 | 141 | 132 | 47.5190 | 50 |
TCAGAGATACTCACGTCACG | 0 | 3 | 142 | 123 | 49.2836 | 50 |
GACAGAGCTATCAGCTACTG | 0 | 3 | 129 | 124 | 49.2927 | 50 |
GCTGACATAGAGTGCGATAC | 0 | 0 | 130 | 133 | 50.1725 | 50 |
ACATCGACACTACTACGCAC | 0 | 3 | 133 | 144 | 50.1554 | 50 |
f (x) | 0 | 33 | 1988 | 1810 | 3.6179 | 0 |
pMO-ABC[10] | ||||||
GTTATTGGTGGTGTGCGTTG | 0 | 0 | 143 | 82 | 51.9305 | 50 |
ACGGAAGTAGGAAGGAGAGA | 0 | 0 | 137 | 106 | 47.8089 | 50 |
GGAAGACGCAGAAGAGAAAG | 9 | 0 | 121 | 110 | 48.2609 | 50 |
CCTCCTTATTGCCTTCCTTC | 0 | 0 | 114 | 102 | 50.3081 | 50 |
AACTAACCACCGACCAACCA | 0 | 0 | 95 | 118 | 50.1102 | 50 |
ACACACAACACACACACTCC | 0 | 0 | 88 | 119 | 50.4577 | 50 |
ACACCACCACATTACCACAC | 0 | 0 | 97 | 119 | 51.9161 | 50 |
CTTCCGTCTCTTCTCTCTCT | 0 | 0 | 134 | 105 | 46.9561 | 50 |
AAGGAGCGAGGAAGCGAAAA | 16 | 0 | 107 | 95 | 45.8306 | 50 |
AACACCAGAACATCCACACC | 0 | 0 | 90 | 131 | 50.5474 | 50 |
CCAACACCATACAACAGACC | 0 | 0 | 95 | 130 | 52.3720 | 50 |
AAGGCGGAAGGATAGAAGAG | 0 | 0 | 128 | 115 | 48.5370 | 50 |
TCTGCCGCTTCTTCTTCTTC | 0 | 0 | 118 | 95 | 46.4000 | 50 |
TCCTCTCGTCTATTCTCCTC | 0 | 0 | 111 | 98 | 48.4427 | 50 |
f (x) | 25 | 0 | 1578 | 1525 | 6.5414 | 0 |
MOES | ||||||
CATACACACTCACACTCACC | 0 | 0 | 112 | 89 | 51.6792 | 50 |
TTGTTGTGGGTTGTCCGGTT | 9 | 0 | 105 | 90 | 49.7949 | 50 |
ACACACACACACACACACAC | 0 | 0 | 93 | 78 | 50.9244 | 50 |
TTGTGGTCCTGGTGTTCTCT | 0 | 0 | 112 | 90 | 48.4957 | 50 |
GAGAGAGAGAGAGAGAGAGA | 0 | 0 | 72 | 100 | 45.6568 | 50 |
TGGTGTGGTGTGGTTAGGTT | 0 | 0 | 96 | 93 | 50.5325 | 50 |
TTGGTGGTGGTGGTTGTAGT | 0 | 0 | 96 | 95 | 50.5325 | 50 |
CCAACCAACCAACCAACCAA | 0 | 0 | 95 | 78 | 51.3054 | 50 |
AACAAGCCAGAAGCCAGAAG | 0 | 0 | 94 | 102 | 47.5066 | 50 |
GTTGGTGCTGTTGTTGAGGT | 0 | 0 | 101 | 99 | 49.4550 | 50 |
GAAGAAGGGAGGAGAGAAGA | 9 | 0 | 77 | 108 | 47.4961 | 50 |
AATGGAAGCGAAGCGAAGTG | 0 | 0 | 93 | 104 | 47.6766 | 50 |
AACCATCAACCGCCGAAGAA | 0 | 3 | 104 | 95 | 48.1694 | 50 |
AAGGTGGAGAGGAAGGAGAA | 0 | 0 | 82 | 111 | 47.4098 | 50 |
f (x) | 18 | 3 | 1332 | 1332 | 6.0224 | 0 |
为了进一步证明本文所提的改进评价函数在解决算法早熟和目标不平衡问题上的有效性,本文和传统的评价函数进行了比较。图2(a)和图2(b)分别显示了使用改进的评价函数和传统的评价函数时目标函数值的收敛过程。首先,连续性和发卡结构都能在早期就收敛到0,这表明基于本文算法的具有很强的局部和全局搜索能力。但是对于相似度和H-measure,传统的评价函数在大约6000代时就停止继续下降并且H-measure一直比相似度大很多,陷入了局部最优。可以认为传统的方式,由于相似度目标上的值优化变小,而舍弃H-measure目标上的优化。而改进的支配方式中,相似度和H-measure能够一直一起进化,直到大约45000代才收敛。在改进的算法中,需要优化的目标是相似度和H-measure中较大的值,因此即使一个目标收敛,程序仍然乐于接受能够优化较差目标的变异。使得程序不会过早收敛并且维持目标函数值之间的平衡。图2(c))和图2(d)显示的是整个迭代过程中相似度和H-measure的分布。可以看出改进的方式中算法会优先优化相似度和H-measure中较劣的解决方案,两个目标间差距不大,证明了本文算法的有效性。
本文提出一种基于进化策略的多目标优化算法求解DNA序列设计问题,设计的随机碱基变异算子可以兼顾局部搜索和全局搜索能力,跟传统的优化算法相比,没有需要设置的敏感参数。此外,改进的评价函数可以在优化目标函数的同时,综合考虑冲突指标相似度和H-measure的平衡性,可以有效地减少DNA分子集合中的非特异性杂交。由于算法运行在较小的种群上,可以极大地减少不必要的时间复杂度。通过实验跟几种最新的DNA编码设计算法进行比对,结果表明本文算法可以设计出高质量的DNA分子集合,可有效提高DNA计算的有效性和可靠性。
[1] |
国家能源局. 2019年11月全国电力安全生产情况[EB/OL]. http://www.nea.gov.cn/2019-12/27/c_138661484.htm, 2019.
Power Safety Supervision Department of National Energy Administration. National power safety production in November 2019[EB/OL]. http://www.nea.gov.cn/2019-12/27/c_138661484.htm, 2019.
|
[2] |
普洱市人民政府. 云南滇能泗南江水电开发有限公司泗南江水电站“5·29”较大爆燃事故调查报告[EB/OL]. http://www.pes.gov.cn/info/egovinfo/1001/xxgk_content/1028-/2020-1226001.htm, 2020.
Pu'er Municipal People's Government. 5.29 accident investigation report, 1029-/2020–1226001[EB/OL]. http://www.pes.gov.cn/info/egovinfo/1001/xxgk_content/1028-/2020-1226001.htm, 2020.
|
[3] |
安学民, 孙华东, 张晓涵, 等. 美国得州“2.15”停电事件分析及启示[J]. 中国电机工程学报, 2021, 41(10): 3407–3415. doi: 10.13334/j.0258-8013.pcsee.210498
AN Xuemin, SUN Huadong, ZHANG Xiaohan, et al. Analysis and lessons of Texas power outage event on February 15, 2021[J]. Proceedings of the CSEE, 2021, 41(10): 3407–3415. doi: 10.13334/j.0258-8013.pcsee.210498
|
[4] |
郭步阳. 试论人工智能技术在电力系统故障诊断中的应用[J]. 科技创新与应用, 2015(34): 206.
GUO Buyang. Application of artificial intelligence technology in power system fault detection[J]. Technology Innovation and Application, 2015(34): 206.
|
[5] |
MOTTALIB M, ROKONUZZAMAN M, HABIB T, et al. Fabric defect classification with geometric features using Bayesian classifier[C]. 2015 International Conference on Advances in Electrical Engineering, Dhaka, Bangladesh, 2015: 137–140.
|
[6] |
XIANG C, FAN X A, and LEE T H. Face recognition using recursive fisher linear discriminant[J]. IEEE Transactions on Image Processing, 2006, 15(8): 2097–2105. doi: 10.1109/TIP.2006.875225
|
[7] |
CORTES C and VAPNIK V. Support-vector networks[J]. Machine Learning, 1995, 20(3): 273–297. doi: 10.1007/BF00994018
|
[8] |
OPELT A, PINZ A, FUSSENEGGER M, et al. Generic object recognition with boosting[J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2006, 28(3): 416–431. doi: 10.1109/TPAMI.2006.54
|
[9] |
KRIZHEVSKY A, SUTSKEVER I, and HINTON G E. ImageNet classification with deep convolutional neural networks[J]. Communications of the ACM, 2017, 60(6): 84–90. doi: 10.1145/3065386
|
[10] |
HE Kaiming, ZHANG Xiangyu, REN Shaoqing, et al. Deep residual learning for image recognition[C]. 2016 IEEE Conference on Computer Vision and Pattern Recognition, Las Vegas, USA, 2016: 770–778.
|
[11] |
HU Jie, SHEN Li, and SUN Gang. Squeeze-and-excitation networks[C]. 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition, Salt Lake City, USA, 2018: 7132–7141.
|
[12] |
GIRSHICK R, DONAHUE J, DARRELL T, et al. Rich feature hierarchies for accurate object detection and semantic segmentation[C]. 2014 IEEE Conference on Computer Vision and Pattern Recognition, Columbus, USA, 2014: 580–587.
|
[13] |
REN Shaoqing, HE Kaiming, GIRSHICK R, et al. Faster R-CNN: Towards real-time object detection with region proposal networks[J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2017, 39(6): 1137–1149. doi: 10.1109/TPAMI.2016.2577031
|
[14] |
LIU Wei, ANGUELOV D, ERHAN D, et al. SSD: Single shot MultiBox detector[C]. The 14th European Conference on Computer Vision, Amsterdam, The Netherlands, 2016: 21–37.
|
[15] |
REDMON J, DIVVALA S, GIRSHICK R, et al. You only look once: Unified, real-time object detection[C]. 2016 IEEE Conference on Computer Vision and Pattern Recognition, Las Vegas, USA, 2016: 779–788.
|
[16] |
HUANG Lichao, YANG Yi, DENG Yafeng, et al. DenseBox: Unifying landmark localization with end to end object detection[J]. arXiv: 1509.04874, 2015. doi: 10.48550/arXiv.1509.04874.
|
[17] |
LAW H and DENG Jia. CornerNet: Detecting objects as paired keypoints[C]. The 15th European Conference on Computer Vision, Munich, Germany, 2018: 765–781.
|
[18] |
ZHOU Xingyi, ZHUO Jiacheng, and KRÄHENBÜHL P. Bottom-up object detection by grouping extreme and center points[C]. 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition, Long Beach, USA, 2019: 850–859.
|
[19] |
ZHU Chenchen, HE Yihui, and SAVVIDES M. Feature selective anchor-free module for single-shot object detection[C]. 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition, Long Beach, USA, 2019: 840–849.
|
[20] |
TIAN Zhi, SHEN Chunhua, CHEN Hao, et al. FCOS: Fully convolutional one-stage object detection[C]. 2019 IEEE/CVF International Conference on Computer Vision, Seoul, Korea (South), 2019: 9626–9635.
|
[21] |
KONG Tao, SUN Fuchun, LIU Huaping, et al. FoveaBox: Beyound anchor-based object detection[J]. IEEE Transactions on Image Processing, 2020, 29: 7389–7398. doi: 10.1109/TIP.2020.3002345
|
[22] |
OTSU N. A threshold selection method from gray-level histograms[J]. IEEE Transactions on Systems, Man, and Cybernetics, 1979, 9(1): 62–66. doi: 10.1109/TSMC.1979.4310076
|
[23] |
KHAN J F, BHUIYAN S M A, and ADHAMI R R. Image segmentation and shape analysis for road-sign detection[J]. IEEE Transactions on Intelligent Transportation Systems, 2011, 12(1): 83–96. doi: 10.1109/TITS.2010.2073466
|
[24] |
TREMEAU A and BOREL N. A region growing and merging algorithm to color segmentation[J]. Pattern Recognition, 1997, 30(7): 1191–1203. doi: 10.1016/S0031-3203(96)00147-1
|
[25] |
黄鹏, 郑淇, 梁超. 图像分割方法综述[J]. 武汉大学学报:理学版, 2020, 66(6): 519–531.
HUANG Peng, ZHENG Qi, and LIANG Chao. Overview of image segmentation methods[J]. Journal of Wuhan University:Natural Science Edition, 2020, 66(6): 519–531.
|
[26] |
周挺. 基于Graph Cuts的双目图像目标分割方法研究[D]. [硕士论文], 西安理工大学, 2020.
ZHOU Ting. Research on binocular image object segmentation method based on graph cuts[D]. [Master dissertation], Xi’an University of Technology, 2020.
|
[27] |
FARABET C, COUPRIE C, NAJMAN L, et al. Scene parsing with multiscale feature learning, purity trees, and optimal covers[C]. The 29th International Conference on Machine Learning, Edinburgh, UK, 2012.
|
[28] |
PINHEIRO P and COLLOBERT R. Recurrent convolutional neural networks for scene labeling[C]. The 31st International Conference on Machine Learning, Beijing, China, 2014: 82–90.
|
[29] |
LONG J, SHELHAMER E, and DARRELL T. Fully convolutional networks for semantic segmentation[C]. 2015 IEEE Conference on Computer Vision and Pattern Recognition, Boston, USA, 2015: 3431–3440.
|
[30] |
CHEN L C, PAPANDREOU G, KOKKINOS I, et al. DeepLab: Semantic image segmentation with deep convolutional nets, atrous convolution, and fully connected CRFs[J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2018, 40(4): 834–848. doi: 10.1109/TPAMI.2017.2699184
|
[31] |
石延辉, 罗毅, 涂光瑜, 等. 一种适用于隔离开关的边缘提取算法[J]. 继电器, 2007, 35(12): 23–26. doi: 10.3969/j.issn.1674-3415.2007.12.006
SHI Yanhui, LUO Yi, TU Guangyu, et al. An edge detectable algorithm for high-voltage isolating switch[J]. Power System Protection and Control, 2007, 35(12): 23–26. doi: 10.3969/j.issn.1674-3415.2007.12.006
|
[32] |
陈安伟, 乐全明, 张宗益, 等. 基于机器人的变电站开关状态图像识别方法[J]. 电力系统自动化, 2012, 36(6): 101–105. doi: 10.7500/AEPS201107176
CHEN Anwei, YUE Quanming, ZHANG Zongyi, et al. An image recognition method of substation breakers state based on robot[J]. Automation of Electric Power Systems, 2012, 36(6): 101–105. doi: 10.7500/AEPS201107176
|
[33] |
邵剑雄, 闫云凤, 齐冬莲. 基于霍夫森林的变电站开关设备检测及状态识别[J]. 电力系统自动化, 2016, 40(11): 115–120. doi: 10.7500/AEPS20150524001
SHAO Jianxiong, YAN Yunfeng, and QI Donglian. Substation switch detection and state recognition based on Hough forests[J]. Automation of Electric Power Systems, 2016, 40(11): 115–120. doi: 10.7500/AEPS20150524001
|
[34] |
郭威, 赵晓鹏. 输电线路中缺失绝缘子的检测与定位[J]. 太原科技大学学报, 2021, 42(2): 116–122. doi: 10.3969/j.issn.1673-2057.2021.02.006
GUO Wei and ZHAO Xiaopeng. Detection and location of missing insulators in transmission lines[J]. Journal of Taiyuan University of Science and Technology, 2021, 42(2): 116–122. doi: 10.3969/j.issn.1673-2057.2021.02.006
|
[35] |
李浩然, 高健, 吴田, 等. 基于改进Canny算子的绝缘子裂纹检测研究[J]. 智慧电力, 2021, 49(2): 91–98. doi: 10.3969/j.issn.1673-7598.2021.02.015
LI Haoran, GAO Jian, WU Tian, et al. Crack detection method of insulators based on improved canny operator[J]. Smart Power, 2021, 49(2): 91–98. doi: 10.3969/j.issn.1673-7598.2021.02.015
|
[36] |
严宇, 邹德华, 江维, 等. 基于HOUGH变换的特高压立式绝缘子视觉检测方法研究[J]. 电力科学与工程, 2020, 36(10): 42–47. doi: 10.3969/j.ISSN.1672-0792.2020.10.007
YAN Yu, ZOU Dehua, JIANG Wei, et al. Research on visual detection method of UHV vertical insulator based on HOUGH transform[J]. Electric Power Science and Engineering, 2020, 36(10): 42–47. doi: 10.3969/j.ISSN.1672-0792.2020.10.007
|
[37] |
邢浩强, 杜志岐, 苏波. 变电站指针式仪表检测与识别方法[J]. 仪器仪表学报, 2017, 38(11): 2813–2821. doi: 10.3969/j.issn.0254-3087.2017.11.024
XING Haoqiang, DU Zhiqi, and SU Bo. Detection and recognition method for pointer-type meter in transformer substation[J]. Chinese Journal of Scientific Instrument, 2017, 38(11): 2813–2821. doi: 10.3969/j.issn.0254-3087.2017.11.024
|
[38] |
房桦, 明志强, 周云峰, 等. 一种适用于变电站巡检机器人的仪表识别算法[J]. 自动化与仪表, 2013, 28(5): 10–14. doi: 10.3969/j.issn.1001-9944.2013.05.003
FANG Hua, MING Zhiqiang, ZHOU Yunfeng, et al. Meter recognition algorithm for equipment inspection robot[J]. Automation &Instrumentation, 2013, 28(5): 10–14. doi: 10.3969/j.issn.1001-9944.2013.05.003
|
[39] |
向友君, 江文, 阮荣钜. 基于刻度准确定位的指针式仪表示数识别方法[J]. 华南理工大学学报:自然科学版, 2020, 48(10): 129–135.
XIANG Youjun, JIANG Wen, and RUAN Rongju. Reading recognition method of pointer-type meter based on accurate scale localization[J]. Journal of South China University of Technology:Natural Science Edition, 2020, 48(10): 129–135.
|
[40] |
冯敏, 罗旺, 余磊, 等. 适用于无人机巡检图像的输电线路螺栓检测方法[J]. 电力科学与技术学报, 2018, 33(4): 135–140. doi: 10.3969/j.issn.1673-9140.2018.04.019
FENG Min, LUO Wang, YU Lei, et al. A bolt detection method for pictures captured from an unmanned aerial vehicle in power transmission line inspection[J]. Journal of Electric Power Science and Technology, 2018, 33(4): 135–140. doi: 10.3969/j.issn.1673-9140.2018.04.019
|
[41] |
孙启悦, 王龙. 基于超像素图像分割的变电设备故障诊断研究[J]. 浙江电力, 2017, 36(12): 86–89. doi: 10.19585/j.zjdl.201712017
SUN Qiyue and WANG Long. Study on substation equipment fault diagnosis based on super-pixel segmentation[J]. Zhejiang Electric Power, 2017, 36(12): 86–89. doi: 10.19585/j.zjdl.201712017
|
[42] |
杨洋. 电气设备红外图像分析与处理[D]. [硕士论文], 北京交通大学, 2015.
YANG Yang. Infrared image analysis and processing of power equipments[D]. [Master dissertation], Beijing Jiaotong University, 2015.
|
[43] |
郭文诚, 崔昊杨, 马宏伟, 等. 基于Zernike矩特征的电力设备红外图像目标识别[J]. 激光与红外, 2019, 49(4): 503–506. doi: 10.3969/j.issn.1001-5078.2019.04.020
GUO Wencheng, CUI Haoyang, MA Hongwei, et al. Infrared image target recognition of power equipment based on Zernike moment[J]. Laser &Infrared, 2019, 49(4): 503–506. doi: 10.3969/j.issn.1001-5078.2019.04.020
|
[44] |
冯振新, 周东国, 江翼, 等. 基于改进MSER算法的电力设备红外故障区域提取方法[J]. 电力系统保护与控制, 2019, 47(5): 123–128. doi: 10.7667/PSPC180363
FENG Zhenxin, ZHOU Dongguo, JIANG Yi, et al. Fault region extraction using improved MSER algorithm with application to the electrical system[J]. Power System Protection and Control, 2019, 47(5): 123–128. doi: 10.7667/PSPC180363
|
[45] |
刘子英, 张靖, 邓芳明. 基于BP神经网络的高压隔离开关分合闸监测识别[J]. 电力系统保护与控制, 2020, 48(5): 134–140. doi: 10.19783/j.cnki.pspc.190524
LIU Ziying, ZHANG Jing, and DENG Fangming. Monitoring and identification of state of opening or closing isolation switch based on BP neural network[J]. Power System Protection and Control, 2020, 48(5): 134–140. doi: 10.19783/j.cnki.pspc.190524
|
[46] |
王舶仲, 蒋毅舟, 文超, 等. 基于生成对抗网络的隔离开关分合位置判别方法研究及应用[J]. 智慧电力, 2019, 47(10): 77–84. doi: 10.3969/j.issn.1673-7598.2019.10.012
WANG Bozhong, JIANG Yizhou, WEN Chao, et al. Method for breaking-closing position discrimination of isolation switch based on generative adversarial network and its application[J]. Smart Power, 2019, 47(10): 77–84. doi: 10.3969/j.issn.1673-7598.2019.10.012
|
[47] |
张一茗, 李少华, 陈士刚, 等. 基于ReliefF特征量优化及BP神经网络识别的高压隔离开关故障类型与位置诊断方法[J]. 高压电器, 2018, 54(2): 12–19. doi: 10.13296/j.1001-1609.hva.2018.02.003
ZHANG Yiming, LI Shaohua, CHEN Shigang, et al. Fault type and position diagnosis method of high-voltage disconnectors based on reliefF characteristic quantity optimization and BP neural network recognition[J]. High Voltage Apparatus, 2018, 54(2): 12–19. doi: 10.13296/j.1001-1609.hva.2018.02.003
|
[48] |
唐小煜, 黄进波, 冯洁文, 等. 基于U-net和YOLOv4的绝缘子图像分割与缺陷检测[J]. 华南师范大学学报:自然科学版, 2020, 52(6): 15–21. doi: 10.6054/j.jscnun.2020088
TANG Xiaoyu, HUANG Jinbo, FENG Jiewen, et al. Image segmentation and defect detection of insulators based on U-net and YOLOv4[J]. Journal of South China Normal University:Natural Science Edition, 2020, 52(6): 15–21. doi: 10.6054/j.jscnun.2020088
|
[49] |
朱明州, 赵曙光, 王建强. 基于改进Faster R-CNN的绝缘子检测方法研究[J]. 科技风, 2021(15): 99–100. doi: 10.19392/j.cnki.1671-7341.202115042
ZHU Mingzhou, ZHAO Shuguang, and WANG Jianqiang. Research on insulator detection method based on improved faster R-CNN[J]. Technology Wind, 2021(15): 99–100. doi: 10.19392/j.cnki.1671-7341.202115042
|
[50] |
王道累, 孙嘉珺, 张天宇, 等. 基于改进生成对抗网络的玻璃绝缘子自爆缺陷检测方法[J]. 高电压技术, 2022, 48(3): 1096–1103. doi: 10.13336/j.1003-6520.hve.20210236
WANG Daolei, SUN Jiajun, ZHANG Tianyu, et al. Self-explosion defect detection method of glass insulator based on improved generative adversarial network[J]. High Voltage Engineering, 2022, 48(3): 1096–1103. doi: 10.13336/j.1003-6520.hve.20210236
|
[51] |
徐发兵, 吴怀宇, 陈志环, 等. 基于深度学习的指针式仪表检测与识别研究[J]. 高技术通讯, 2019, 29(12): 1206–1215. doi: 10.3772/j.issn.1002-0470.2019.12.006
XU Fabing, WU Huaiyu, CHEN Zhihuan, et al. Research on pointer instrument detection and recognition based on deep learning[J]. Chinese High Technology Letters, 2019, 29(12): 1206–1215. doi: 10.3772/j.issn.1002-0470.2019.12.006
|
[52] |
万吉林, 王慧芳, 管敏渊, 等. 基于Faster R-CNN和U-Net的变电站指针式仪表读数自动识别方法[J]. 电网技术, 2020, 44(8): 3097–3105. doi: 10.13335/j.1000-3673.pst.2019.1670
WAN Jilin, WANG Huifang, GUAN Minyuan, et al. An automatic identification for reading of substation pointer-type meters using faster R-CNN and U-Net[J]. Power System Technology, 2020, 44(8): 3097–3105. doi: 10.13335/j.1000-3673.pst.2019.1670
|
[53] |
张永翔, 吴功平, 刘中云, 等. 基于YOLOv3网络的输电线路防震锤和线夹检测迁移学习[J]. 计算机应用, 2020, 40(S2): 188–194.
ZHANG Yongxiang, WU Gongping, LIU Zhongyun, et al. Transfer learning of transmission line damper and clamp detection based on YOLOv3 network[J]. Journal of Computer Applications, 2020, 40(S2): 188–194.
|
[54] |
阮国恒, 李文航. 基于视频联动技术的输电线路远程智能巡检方法[J]. 自动化与仪器仪表, 2021(1): 77–80,84. doi: 10.14016/j.cnki.1001-9227.2021.01.077
RUAN Guoheng and LI Wenhang. Remote intelligent inspection method of transmission line based on video linkage technology[J]. Automation &Instrumentation, 2021(1): 77–80,84. doi: 10.14016/j.cnki.1001-9227.2021.01.077
|
[55] |
吴锡, 王梓屹, 宋柯, 等. 基于Faster RCNN检测器的输电线路无人机自主巡检系统[J]. 电力信息与通信技术, 2020, 18(9): 8–15.
WU Xi, WANG Ziyi, SONG Ke, et al. The autonomous inspection system of transmission line UAV based on Faster RCNN detector[J]. Electric Power Information and Communication Technology, 2020, 18(9): 8–15.
|
[56] |
刘云鹏, 裴少通, 武建华, 等. 基于深度学习的输变电设备异常发热点红外图片目标检测方法[J]. 南方电网技术, 2019, 13(2): 27–33. doi: 10.13648/j.cnki.issn1674-0629.2019.02.005
LIU Yunpeng, PEI Shaotong, WU Jianhua, et al. Deep learning based target detection method for abnormal hot spots infrared images of transmission and transformation equipment[J]. Southern Power System Technology, 2019, 13(2): 27–33. doi: 10.13648/j.cnki.issn1674-0629.2019.02.005
|
[57] |
李文璞, 谢可, 廖逍, 等. 基于Faster RCNN变电设备红外图像缺陷识别方法[J]. 南方电网技术, 2019, 13(12): 79–84. doi: 10.13648/j.cnki.issn1674-0629.2019.12.012
LI Wenpu, XIE Ke, LIAO Xiao, et al. Intelligent diagnosis method of infrared image for transformer equipment based on improved Faster RCNN[J]. Southern Power System Technology, 2019, 13(12): 79–84. doi: 10.13648/j.cnki.issn1674-0629.2019.12.012
|
[58] |
Customvision website. https://www.customvision.ai.
|
[59] |
BISONG E. Google AutoML: Cloud vision[M]. BISONG E. Building Machine Learning and Deep Learning Models on Google Cloud Platform. Berkeley: Apress, 2019: 581–598.
|
[60] |
CHEN Yuntao, HAN Chenxia, LI Yanghao, et al. SimpleDet: A simple and versatile distributed framework for object detection and instance recognition[J]. Journal of Machine Learning Research, 2019, 20(156): 1–8.
|
[61] |
WU Yuxin, KIRILLOV A, MASSA F, et al. Detectron2[EB/OL]. https://github.com/facebookresearch/detectron2, 2019.
|
[62] |
CHEN Kai, WANG Jiaqi, PANG Jiangmiao, et al. MMDetection: Open MMLab detection toolbox and benchmark[J]. arXiv: 1906.07155, 2019.
|
[63] |
MA Yanjun, YU Dianhai, WU Tian, et al. PaddlePaddle: An open-source deep learning platform from industrial practice[J]. Frontiers of Data and Computing, 2019, 1(1): 105–115. doi: 10.11871/jfdc.issn.2096.742X.2019.01.011
|
[64] |
HE Kaiming, GKIOXARI G, DOLLÁR P, et al. Mask R-CNN[C]. 2017 IEEE International Conference on Computer Vision, Venice, Italy, 2017: 2980–2988.
|
[65] |
CAI Zhaowei and VASCONCELOS N. Cascade R-CNN: Delving into high quality object detection[C]. 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition, Salt Lake City, USA, 2018: 6154–6162.
|
[66] |
LIN T Y, GOYAL P, GIRSHICK R, et al. Focal loss for dense object detection[C]. 2017 IEEE International Conference on Computer Vision, Venice, Italy, 2017: 2999–3007.
|
[67] |
HINTON G, VINYALS O, and DEAN J. Distilling the knowledge in a neural network[J]. Computer Science, 2015, 14(7): 38–39.
|
[68] |
王勋, 王新, 魏举锋. 智能巡检系统在电力行业中的应用研究[J]. 四川水力发电, 2021, 40(1): 109–112. doi: 10.3969/j.issn.1001-2184.2021.01.025
WANG Xun, WANG Xin, and WEI Jufeng. Application of intelligent inspection system in electrical power industry[J]. Sichuan Water Power, 2021, 40(1): 109–112. doi: 10.3969/j.issn.1001-2184.2021.01.025
|
[69] |
严太山, 郑晓琼, 吕雪峰, 等. 变电站自动巡检管控系统研究与应用[J]. 农村电气化, 2021(3): 41–44. doi: 10.13882/j.cnki.ncdqh.2021.03.014
YAN Taishan, ZHENG Xiaoqiong, LV Xuefeng, et al. Research and application of automatic patrol check, management control system in substations[J]. Rural Electrification, 2021(3): 41–44. doi: 10.13882/j.cnki.ncdqh.2021.03.014
|
[70] |
张海华, 陈昊, 许驰, 等. 变电站立体智能巡检新技术研究与应用[J]. 湖北电力, 2021, 45(1): 41–46. doi: 10.19308/j.hep.2021.01.007
ZHANG Haihua, CHEN Hao, XU Chi, et al. Research and application of new technology of three-dimensional intelligent inspection for substations[J]. Hubei Electric Power, 2021, 45(1): 41–46. doi: 10.19308/j.hep.2021.01.007
|
1. | 张涛,张龙,张国群,贾桂芬,孙俊格. 软件定义系统技术研究综述. 空天防御. 2024(02): 1-7+35 . ![]() | |
2. | 周淑怡,赵成安,王灏茗,陈文龙. OpenTDR:一种网络流量控制方案. 科学技术与工程. 2024(35): 15152-15162 . ![]() | |
3. | 刘奕,李建华,陈玉. 基于对偶分解的数据中心网络流量工程方法. 计算机仿真. 2022(06): 346-350 . ![]() | |
4. | 向敏,饶华阳,张进进,陈梦鑫. 基于图卷积神经网络的软件定义电力通信网络路由控制策略. 电子与信息学报. 2021(02): 388-395 . ![]() | |
5. | 史久根,杨旭,刘雅丽,孙立. 软件定义网络中快速和一致的流更新策略. 电子与信息学报. 2021(09): 2617-2623 . ![]() | |
6. | 刘敏,张霄,王浩,刘丽榕. 基于蚁群链路权值的电力通信网络负载均衡算法. 信息技术. 2020(08): 126-131 . ![]() | |
7. | 刘奕,李建华,陈玉,齐子森. 一种数据中心网络节点的共享保护算法. 信息网络安全. 2020(10): 27-33 . ![]() |
输入: X=5′–x1x2⋯xn–3′ |
输出: Y=5′–y1y2⋯yn–3′ |
1: for j=1 to n |
2: List.add(j) |
3: end for |
4: k=random(n) |
5: for j=1 to k |
6: i = random(List.count) |
7: yi=(xi+random(3)+1) mod 4 |
8: List.delete(i) |
9: end for |
1: Initialization |
2: while (t < max iteration) |
3: for i=1 to P |
4: p = Pt(i) |
5: q = Individual Mutation(p) |
6: if q ≺ p then |
7: Pt(i)=q |
8: else if (q ⊀ p) and (p ⊀ q) then |
9: if Fitness(q) > Fitness(p) then |
10: Pt(i)=q |
11: end if |
12: end if |
13: end for |
14: t=t+1 |
15: end while |
方法(序列) | 连续性 | 发卡结构 | H-measure | 相似度 | Tm | GC(%) |
MGA[7] | ||||||
TAGACCACTGTTGCACATGG | 0 | 0 | 58 | 52 | 50.2794 | 50 |
ATTCGGTCAGACTTGCTGTG | 0 | 0 | 64 | 52 | 48.6650 | 50 |
ATAGTGCGGACAGTAGTTCC | 0 | 0 | 66 | 59 | 50.1634 | 50 |
AATACGCGGAACGTAACCTC | 0 | 0 | 61 | 85 | 50.4158 | 50 |
AATACGCGGAACGTAACCTC | 0 | 0 | 61 | 85 | 50.4158 | 50 |
ACAGCCTTAAGCCTAACTCC | 0 | 3 | 65 | 54 | 49.0641 | 50 |
ATGCTTCCGACATGGAATGG | 0 | 3 | 63 | 57 | 49.8160 | 50 |
f (x) | 0 | 6 | 438 | 444 | 1.7508 | 0 |
IWO[8] | ||||||
ACACCAGCACACCAGAAACA | 9 | 0 | 55 | 55 | 48.4670 | 50 |
GTTCAATCGCCTCTCGGTAT | 0 | 0 | 57 | 57 | 49.3935 | 50 |
GCTACCTCTTCCACCATTCT | 0 | 0 | 55 | 55 | 49.2453 | 50 |
GAATCAATGGCGGTCAGAAG | 0 | 0 | 66 | 66 | 49.9440 | 50 |
TTGGTCCGGTTATTCCTTCG | 0 | 0 | 65 | 65 | 50.6418 | 50 |
CCATCTTCCGTACTTCACTG | 0 | 0 | 56 | 56 | 51.0993 | 50 |
TTCGACTCGGTTCCTTGCTA | 0 | 0 | 58 | 58 | 47.6049 | 50 |
f (x) | 9 | 0 | 412 | 412 | 3.4944 | 0 |
pMO-ABC[10] | ||||||
TGTGGTTGGTTAGTCGGTTG | 0 | 0 | 46 | 49 | 51.0421 | 50 |
GGTGGTATTGGTGGTATTGG | 0 | 0 | 47 | 47 | 53.8027 | 50 |
CTTCTCTTCTCTTGCCGCTT | 0 | 0 | 39 | 56 | 46.4112 | 50 |
AACAACCTCCACACCGAACA | 0 | 0 | 62 | 32 | 49.1737 | 50 |
CTCTCTCTCTCACTCTCTCA | 0 | 0 | 41 | 48 | 46.5220 | 50 |
CTCTCATTCCTTCTTACCCC | 16 | 0 | 43 | 51 | 50.8283 | 50 |
TGGTGTTGCTGGTGTAGGTT | 0 | 0 | 48 | 51 | 49.3985 | 50 |
f (x) | 16 | 0 | 326 | 334 | 7.3915 | 0 |
MOES | ||||||
GGAGAGGAGAAGAAGAAGAG | 0 | 0 | 52 | 25 | 48.1727 | 50 |
CCTCCACATCACCATTAACC | 0 | 0 | 56 | 31 | 52.3807 | 50 |
CTCTCTCTCTCTCTCTCTCT | 0 | 0 | 34 | 37 | 45.6658 | 50 |
TTCCTTCCTTCCTTCCTTCC | 0 | 0 | 36 | 39 | 48.7500 | 50 |
TTGGTTGGTTGGTTGGTTGG | 0 | 0 | 30 | 46 | 51.3054 | 50 |
TTGTTGTTGGTGGTGGTGGT | 0 | 0 | 30 | 48 | 50.2236 | 50 |
TGTGTGTGGTGTGTGTTGTG | 0 | 0 | 30 | 46 | 51.0025 | 50 |
f (x) | 0 | 0 | 268 | 272 | 6.7149 | 0 |
方法(序列) | 连续性 | 发卡结构 | H-measure | 相似度 | Tm | GC(%) |
MGA[7] | ||||||
CTCATCTAATCAGCCTCGCA | 0 | 0 | 135 | 114 | 48.1554 | 50 |
CTAATAGTGACAGCTGCGTG | 0 | 3 | 131 | 119 | 50.2421 | 50 |
GCATCGTTAGAGACACCTAC | 0 | 3 | 134 | 124 | 50.7932 | 50 |
GCATCAATATGCGCGACTAC | 0 | 0 | 131 | 125 | 50.2815 | 50 |
CATTAAGTAGACGCTGTCGG | 0 | 3 | 132 | 114 | 50.9507 | 50 |
TATGGATGAGGAGGACCTAG | 0 | 3 | 133 | 117 | 50.6387 | 50 |
CAGAGATGTTCTGTACCACC | 0 | 3 | 128 | 117 | 51.2232 | 50 |
CGTCGAGAATTCGTAGCTCA | 0 | 0 | 137 | 119 | 48.3224 | 50 |
TCTGTTACCGTATCGGATCG | 0 | 3 | 129 | 115 | 50.8791 | 50 |
AGAAGAGTTCGACTTGCTGG | 0 | 3 | 134 | 121 | 47.5507 | 50 |
GCAAGGAATTCACCGTCTGT | 0 | 3 | 133 | 129 | 48.9881 | 50 |
CGTGTGAAGAGAGTGGTTCA | 0 | 0 | 127 | 123 | 48.9355 | 50 |
CGACTGAATCATGGACCTGT | 0 | 3 | 134 | 126 | 49.7624 | 50 |
TACCGAGAAGTAGGACTGCA | 0 | 3 | 134 | 124 | 48.3847 | 50 |
f (x) | 0 | 30 | 1852 | 1687 | 3.6725 | 0 |
INSGA-II[9] | ||||||
CGAGACATCGTGCATATCGT | 0 | 4 | 143 | 124 | 49.6393 | 50 |
TATAGCACGAGTGCGCGTAT | 0 | 3 | 137 | 130 | 48.5659 | 50 |
GATCTACGATCATGAGAGCG | 0 | 4 | 135 | 126 | 49.6673 | 50 |
TCTGTACTGCTGACTCGAGT | 0 | 3 | 163 | 124 | 47.1312 | 50 |
CGAGTAGTCACACGATGAGA | 0 | 0 | 152 | 132 | 49.2836 | 50 |
AGATGATCAGCAGCGACACT | 0 | 3 | 133 | 133 | 46.5546 | 50 |
TGTGCTCGTCTCTGCATACT | 0 | 4 | 159 | 130 | 47.1507 | 50 |
AGACGAGTCGTACAGTACAG | 0 | 0 | 152 | 134 | 49.9091 | 50 |
ATGTACGTGAGATGCAGCAG | 0 | 0 | 139 | 121 | 48.9270 | 50 |
ATCACTACTCGCTCGTCACT | 0 | 3 | 141 | 132 | 47.5190 | 50 |
TCAGAGATACTCACGTCACG | 0 | 3 | 142 | 123 | 49.2836 | 50 |
GACAGAGCTATCAGCTACTG | 0 | 3 | 129 | 124 | 49.2927 | 50 |
GCTGACATAGAGTGCGATAC | 0 | 0 | 130 | 133 | 50.1725 | 50 |
ACATCGACACTACTACGCAC | 0 | 3 | 133 | 144 | 50.1554 | 50 |
f (x) | 0 | 33 | 1988 | 1810 | 3.6179 | 0 |
pMO-ABC[10] | ||||||
GTTATTGGTGGTGTGCGTTG | 0 | 0 | 143 | 82 | 51.9305 | 50 |
ACGGAAGTAGGAAGGAGAGA | 0 | 0 | 137 | 106 | 47.8089 | 50 |
GGAAGACGCAGAAGAGAAAG | 9 | 0 | 121 | 110 | 48.2609 | 50 |
CCTCCTTATTGCCTTCCTTC | 0 | 0 | 114 | 102 | 50.3081 | 50 |
AACTAACCACCGACCAACCA | 0 | 0 | 95 | 118 | 50.1102 | 50 |
ACACACAACACACACACTCC | 0 | 0 | 88 | 119 | 50.4577 | 50 |
ACACCACCACATTACCACAC | 0 | 0 | 97 | 119 | 51.9161 | 50 |
CTTCCGTCTCTTCTCTCTCT | 0 | 0 | 134 | 105 | 46.9561 | 50 |
AAGGAGCGAGGAAGCGAAAA | 16 | 0 | 107 | 95 | 45.8306 | 50 |
AACACCAGAACATCCACACC | 0 | 0 | 90 | 131 | 50.5474 | 50 |
CCAACACCATACAACAGACC | 0 | 0 | 95 | 130 | 52.3720 | 50 |
AAGGCGGAAGGATAGAAGAG | 0 | 0 | 128 | 115 | 48.5370 | 50 |
TCTGCCGCTTCTTCTTCTTC | 0 | 0 | 118 | 95 | 46.4000 | 50 |
TCCTCTCGTCTATTCTCCTC | 0 | 0 | 111 | 98 | 48.4427 | 50 |
f (x) | 25 | 0 | 1578 | 1525 | 6.5414 | 0 |
MOES | ||||||
CATACACACTCACACTCACC | 0 | 0 | 112 | 89 | 51.6792 | 50 |
TTGTTGTGGGTTGTCCGGTT | 9 | 0 | 105 | 90 | 49.7949 | 50 |
ACACACACACACACACACAC | 0 | 0 | 93 | 78 | 50.9244 | 50 |
TTGTGGTCCTGGTGTTCTCT | 0 | 0 | 112 | 90 | 48.4957 | 50 |
GAGAGAGAGAGAGAGAGAGA | 0 | 0 | 72 | 100 | 45.6568 | 50 |
TGGTGTGGTGTGGTTAGGTT | 0 | 0 | 96 | 93 | 50.5325 | 50 |
TTGGTGGTGGTGGTTGTAGT | 0 | 0 | 96 | 95 | 50.5325 | 50 |
CCAACCAACCAACCAACCAA | 0 | 0 | 95 | 78 | 51.3054 | 50 |
AACAAGCCAGAAGCCAGAAG | 0 | 0 | 94 | 102 | 47.5066 | 50 |
GTTGGTGCTGTTGTTGAGGT | 0 | 0 | 101 | 99 | 49.4550 | 50 |
GAAGAAGGGAGGAGAGAAGA | 9 | 0 | 77 | 108 | 47.4961 | 50 |
AATGGAAGCGAAGCGAAGTG | 0 | 0 | 93 | 104 | 47.6766 | 50 |
AACCATCAACCGCCGAAGAA | 0 | 3 | 104 | 95 | 48.1694 | 50 |
AAGGTGGAGAGGAAGGAGAA | 0 | 0 | 82 | 111 | 47.4098 | 50 |
f (x) | 18 | 3 | 1332 | 1332 | 6.0224 | 0 |
输入: X=5′–x1x2⋯xn–3′ |
输出: Y=5′–y1y2⋯yn–3′ |
1: for j=1 to n |
2: List.add(j) |
3: end for |
4: k=random(n) |
5: for j=1 to k |
6: i = random(List.count) |
7: yi=(xi+random(3)+1) mod 4 |
8: List.delete(i) |
9: end for |
1: Initialization |
2: while (t < max iteration) |
3: for i=1 to P |
4: p = Pt(i) |
5: q = Individual Mutation(p) |
6: if q ≺ p then |
7: Pt(i)=q |
8: else if (q ⊀ p) and (p ⊀ q) then |
9: if Fitness(q) > Fitness(p) then |
10: Pt(i)=q |
11: end if |
12: end if |
13: end for |
14: t=t+1 |
15: end while |
方法(序列) | 连续性 | 发卡结构 | H-measure | 相似度 | Tm | GC(%) |
MGA[7] | ||||||
TAGACCACTGTTGCACATGG | 0 | 0 | 58 | 52 | 50.2794 | 50 |
ATTCGGTCAGACTTGCTGTG | 0 | 0 | 64 | 52 | 48.6650 | 50 |
ATAGTGCGGACAGTAGTTCC | 0 | 0 | 66 | 59 | 50.1634 | 50 |
AATACGCGGAACGTAACCTC | 0 | 0 | 61 | 85 | 50.4158 | 50 |
AATACGCGGAACGTAACCTC | 0 | 0 | 61 | 85 | 50.4158 | 50 |
ACAGCCTTAAGCCTAACTCC | 0 | 3 | 65 | 54 | 49.0641 | 50 |
ATGCTTCCGACATGGAATGG | 0 | 3 | 63 | 57 | 49.8160 | 50 |
f (x) | 0 | 6 | 438 | 444 | 1.7508 | 0 |
IWO[8] | ||||||
ACACCAGCACACCAGAAACA | 9 | 0 | 55 | 55 | 48.4670 | 50 |
GTTCAATCGCCTCTCGGTAT | 0 | 0 | 57 | 57 | 49.3935 | 50 |
GCTACCTCTTCCACCATTCT | 0 | 0 | 55 | 55 | 49.2453 | 50 |
GAATCAATGGCGGTCAGAAG | 0 | 0 | 66 | 66 | 49.9440 | 50 |
TTGGTCCGGTTATTCCTTCG | 0 | 0 | 65 | 65 | 50.6418 | 50 |
CCATCTTCCGTACTTCACTG | 0 | 0 | 56 | 56 | 51.0993 | 50 |
TTCGACTCGGTTCCTTGCTA | 0 | 0 | 58 | 58 | 47.6049 | 50 |
f (x) | 9 | 0 | 412 | 412 | 3.4944 | 0 |
pMO-ABC[10] | ||||||
TGTGGTTGGTTAGTCGGTTG | 0 | 0 | 46 | 49 | 51.0421 | 50 |
GGTGGTATTGGTGGTATTGG | 0 | 0 | 47 | 47 | 53.8027 | 50 |
CTTCTCTTCTCTTGCCGCTT | 0 | 0 | 39 | 56 | 46.4112 | 50 |
AACAACCTCCACACCGAACA | 0 | 0 | 62 | 32 | 49.1737 | 50 |
CTCTCTCTCTCACTCTCTCA | 0 | 0 | 41 | 48 | 46.5220 | 50 |
CTCTCATTCCTTCTTACCCC | 16 | 0 | 43 | 51 | 50.8283 | 50 |
TGGTGTTGCTGGTGTAGGTT | 0 | 0 | 48 | 51 | 49.3985 | 50 |
f (x) | 16 | 0 | 326 | 334 | 7.3915 | 0 |
MOES | ||||||
GGAGAGGAGAAGAAGAAGAG | 0 | 0 | 52 | 25 | 48.1727 | 50 |
CCTCCACATCACCATTAACC | 0 | 0 | 56 | 31 | 52.3807 | 50 |
CTCTCTCTCTCTCTCTCTCT | 0 | 0 | 34 | 37 | 45.6658 | 50 |
TTCCTTCCTTCCTTCCTTCC | 0 | 0 | 36 | 39 | 48.7500 | 50 |
TTGGTTGGTTGGTTGGTTGG | 0 | 0 | 30 | 46 | 51.3054 | 50 |
TTGTTGTTGGTGGTGGTGGT | 0 | 0 | 30 | 48 | 50.2236 | 50 |
TGTGTGTGGTGTGTGTTGTG | 0 | 0 | 30 | 46 | 51.0025 | 50 |
f (x) | 0 | 0 | 268 | 272 | 6.7149 | 0 |
方法(序列) | 连续性 | 发卡结构 | H-measure | 相似度 | Tm | GC(%) |
MGA[7] | ||||||
CTCATCTAATCAGCCTCGCA | 0 | 0 | 135 | 114 | 48.1554 | 50 |
CTAATAGTGACAGCTGCGTG | 0 | 3 | 131 | 119 | 50.2421 | 50 |
GCATCGTTAGAGACACCTAC | 0 | 3 | 134 | 124 | 50.7932 | 50 |
GCATCAATATGCGCGACTAC | 0 | 0 | 131 | 125 | 50.2815 | 50 |
CATTAAGTAGACGCTGTCGG | 0 | 3 | 132 | 114 | 50.9507 | 50 |
TATGGATGAGGAGGACCTAG | 0 | 3 | 133 | 117 | 50.6387 | 50 |
CAGAGATGTTCTGTACCACC | 0 | 3 | 128 | 117 | 51.2232 | 50 |
CGTCGAGAATTCGTAGCTCA | 0 | 0 | 137 | 119 | 48.3224 | 50 |
TCTGTTACCGTATCGGATCG | 0 | 3 | 129 | 115 | 50.8791 | 50 |
AGAAGAGTTCGACTTGCTGG | 0 | 3 | 134 | 121 | 47.5507 | 50 |
GCAAGGAATTCACCGTCTGT | 0 | 3 | 133 | 129 | 48.9881 | 50 |
CGTGTGAAGAGAGTGGTTCA | 0 | 0 | 127 | 123 | 48.9355 | 50 |
CGACTGAATCATGGACCTGT | 0 | 3 | 134 | 126 | 49.7624 | 50 |
TACCGAGAAGTAGGACTGCA | 0 | 3 | 134 | 124 | 48.3847 | 50 |
f (x) | 0 | 30 | 1852 | 1687 | 3.6725 | 0 |
INSGA-II[9] | ||||||
CGAGACATCGTGCATATCGT | 0 | 4 | 143 | 124 | 49.6393 | 50 |
TATAGCACGAGTGCGCGTAT | 0 | 3 | 137 | 130 | 48.5659 | 50 |
GATCTACGATCATGAGAGCG | 0 | 4 | 135 | 126 | 49.6673 | 50 |
TCTGTACTGCTGACTCGAGT | 0 | 3 | 163 | 124 | 47.1312 | 50 |
CGAGTAGTCACACGATGAGA | 0 | 0 | 152 | 132 | 49.2836 | 50 |
AGATGATCAGCAGCGACACT | 0 | 3 | 133 | 133 | 46.5546 | 50 |
TGTGCTCGTCTCTGCATACT | 0 | 4 | 159 | 130 | 47.1507 | 50 |
AGACGAGTCGTACAGTACAG | 0 | 0 | 152 | 134 | 49.9091 | 50 |
ATGTACGTGAGATGCAGCAG | 0 | 0 | 139 | 121 | 48.9270 | 50 |
ATCACTACTCGCTCGTCACT | 0 | 3 | 141 | 132 | 47.5190 | 50 |
TCAGAGATACTCACGTCACG | 0 | 3 | 142 | 123 | 49.2836 | 50 |
GACAGAGCTATCAGCTACTG | 0 | 3 | 129 | 124 | 49.2927 | 50 |
GCTGACATAGAGTGCGATAC | 0 | 0 | 130 | 133 | 50.1725 | 50 |
ACATCGACACTACTACGCAC | 0 | 3 | 133 | 144 | 50.1554 | 50 |
f (x) | 0 | 33 | 1988 | 1810 | 3.6179 | 0 |
pMO-ABC[10] | ||||||
GTTATTGGTGGTGTGCGTTG | 0 | 0 | 143 | 82 | 51.9305 | 50 |
ACGGAAGTAGGAAGGAGAGA | 0 | 0 | 137 | 106 | 47.8089 | 50 |
GGAAGACGCAGAAGAGAAAG | 9 | 0 | 121 | 110 | 48.2609 | 50 |
CCTCCTTATTGCCTTCCTTC | 0 | 0 | 114 | 102 | 50.3081 | 50 |
AACTAACCACCGACCAACCA | 0 | 0 | 95 | 118 | 50.1102 | 50 |
ACACACAACACACACACTCC | 0 | 0 | 88 | 119 | 50.4577 | 50 |
ACACCACCACATTACCACAC | 0 | 0 | 97 | 119 | 51.9161 | 50 |
CTTCCGTCTCTTCTCTCTCT | 0 | 0 | 134 | 105 | 46.9561 | 50 |
AAGGAGCGAGGAAGCGAAAA | 16 | 0 | 107 | 95 | 45.8306 | 50 |
AACACCAGAACATCCACACC | 0 | 0 | 90 | 131 | 50.5474 | 50 |
CCAACACCATACAACAGACC | 0 | 0 | 95 | 130 | 52.3720 | 50 |
AAGGCGGAAGGATAGAAGAG | 0 | 0 | 128 | 115 | 48.5370 | 50 |
TCTGCCGCTTCTTCTTCTTC | 0 | 0 | 118 | 95 | 46.4000 | 50 |
TCCTCTCGTCTATTCTCCTC | 0 | 0 | 111 | 98 | 48.4427 | 50 |
f (x) | 25 | 0 | 1578 | 1525 | 6.5414 | 0 |
MOES | ||||||
CATACACACTCACACTCACC | 0 | 0 | 112 | 89 | 51.6792 | 50 |
TTGTTGTGGGTTGTCCGGTT | 9 | 0 | 105 | 90 | 49.7949 | 50 |
ACACACACACACACACACAC | 0 | 0 | 93 | 78 | 50.9244 | 50 |
TTGTGGTCCTGGTGTTCTCT | 0 | 0 | 112 | 90 | 48.4957 | 50 |
GAGAGAGAGAGAGAGAGAGA | 0 | 0 | 72 | 100 | 45.6568 | 50 |
TGGTGTGGTGTGGTTAGGTT | 0 | 0 | 96 | 93 | 50.5325 | 50 |
TTGGTGGTGGTGGTTGTAGT | 0 | 0 | 96 | 95 | 50.5325 | 50 |
CCAACCAACCAACCAACCAA | 0 | 0 | 95 | 78 | 51.3054 | 50 |
AACAAGCCAGAAGCCAGAAG | 0 | 0 | 94 | 102 | 47.5066 | 50 |
GTTGGTGCTGTTGTTGAGGT | 0 | 0 | 101 | 99 | 49.4550 | 50 |
GAAGAAGGGAGGAGAGAAGA | 9 | 0 | 77 | 108 | 47.4961 | 50 |
AATGGAAGCGAAGCGAAGTG | 0 | 0 | 93 | 104 | 47.6766 | 50 |
AACCATCAACCGCCGAAGAA | 0 | 3 | 104 | 95 | 48.1694 | 50 |
AAGGTGGAGAGGAAGGAGAA | 0 | 0 | 82 | 111 | 47.4098 | 50 |
f (x) | 18 | 3 | 1332 | 1332 | 6.0224 | 0 |