期刊文献+
共找到624篇文章
< 1 2 32 >
每页显示 20 50 100
Applying Surface-Based DNA Computing for Solving the Dominating Set Problem
1
作者 Hassan Taghipour Mahdi Rezaei Heydar Ali Esmaili 《American Journal of Molecular Biology》 2012年第3期286-290,共5页
The surface-based DNA computing is one of the methods of DNA computing which uses DNA strands immobilized on a solid surface. In this paper, we applied surface-based DNA computing for solving the dominating set proble... The surface-based DNA computing is one of the methods of DNA computing which uses DNA strands immobilized on a solid surface. In this paper, we applied surface-based DNA computing for solving the dominating set problem. At first step, surface-based DNA solution space was constructed by using appropriate DNA strands. Then, by application of a DNA parallel algorithm, dominating set problem was resolved in polynomial time. 展开更多
关键词 Parallel computing surface-based dna computers Dominating Set PROBLEM NP-COMPLETE PROBLEM
下载PDF
DNA Computing with Water Strider Based Vector Quantization for Data Storage Systems
2
作者 A.Arokiaraj Jovith S.Rama Sree +4 位作者 Gudikandhula Narasimha Rao K.Vijaya Kumar Woong Cho Gyanendra Prasad Joshi Sung Won Kim 《Computers, Materials & Continua》 SCIE EI 2023年第3期6429-6444,共16页
The exponential growth of data necessitates an effective data storage scheme,which helps to effectively manage the large quantity of data.To accomplish this,Deoxyribonucleic Acid(DNA)digital data storage process can b... The exponential growth of data necessitates an effective data storage scheme,which helps to effectively manage the large quantity of data.To accomplish this,Deoxyribonucleic Acid(DNA)digital data storage process can be employed,which encodes and decodes binary data to and from synthesized strands of DNA.Vector quantization(VQ)is a commonly employed scheme for image compression and the optimal codebook generation is an effective process to reach maximum compression efficiency.This article introduces a newDNAComputingwithWater StriderAlgorithm based Vector Quantization(DNAC-WSAVQ)technique for Data Storage Systems.The proposed DNAC-WSAVQ technique enables encoding data using DNA computing and then compresses it for effective data storage.Besides,the DNAC-WSAVQ model initially performsDNA encoding on the input images to generate a binary encoded form.In addition,aWater Strider algorithm with Linde-Buzo-Gray(WSA-LBG)model is applied for the compression process and thereby storage area can be considerably minimized.In order to generate optimal codebook for LBG,the WSA is applied to it.The performance validation of the DNAC-WSAVQ model is carried out and the results are inspected under several measures.The comparative study highlighted the improved outcomes of the DNAC-WSAVQ model over the existing methods. 展开更多
关键词 dna computing data storage image compression vector quantization ws algorithm space saving
下载PDF
DNA聚合酶η小分子抑制剂筛选 被引量:1
3
作者 曹佳佳 叶舒迈 赵烨 《浙江大学学报(农业与生命科学版)》 CAS CSCD 北大核心 2024年第1期35-41,共7页
DNA损伤修复以及基因组稳定性维持对于动植物正常生长和防御逆境至关重要。针对DNA聚合酶错误掺入导致的基因组不稳定性,本研究以DNA聚合酶η为研究对象,通过计算分子模拟对接的方式,对其可能的小分子抑制剂进行筛选,并对其酶动力学参... DNA损伤修复以及基因组稳定性维持对于动植物正常生长和防御逆境至关重要。针对DNA聚合酶错误掺入导致的基因组不稳定性,本研究以DNA聚合酶η为研究对象,通过计算分子模拟对接的方式,对其可能的小分子抑制剂进行筛选,并对其酶动力学参数进行测定。结果显示:脱氧腺苷三磷酸(deoxyadenosine triphosphate,d ATP)对DNA聚合酶η的活性具有抑制效果,使其延伸的相对效率为36%~42%。分子模拟对接和体外实验结果表明,相较于dATP(亲和力为-26.7 kJ/mol),环鸟苷酸-腺苷酸(cyclic GMP-AMP,cGAMP)与DNA聚合酶η具有更低的结合能(亲和力为-35.1 kJ/mol)。酶动力学参数测定结果也表明,相较于dATP,cGAMP具有更强的抑制能力且在浓度为0.5 mmol/L时达到最强(相对延伸效率为13%)。因此,本研究筛选获得了针对DNA聚合酶η的一种潜在的小分子抑制剂。同时,鉴于该蛋白质高表达导致细胞对抗肿瘤药物(DNA损伤剂)的耐受性,这为新型药物的开发提供了依据。 展开更多
关键词 dna损伤修复 dna聚合酶 酶动力学 计算生物学 环鸟苷酸-腺苷酸
下载PDF
基于DNA链置换反应网络求解0-1背包问题 被引量:1
4
作者 杨静 郑雅雯 +1 位作者 张彤彤 蒋天怿 《安徽理工大学学报(自然科学版)》 CAS 2024年第1期78-88,共11页
目的基于DNA链置换的化学反应网络可以作为一种有效的编程语言来解决各种数学问题,而0-1背包问题是一个经典的NP问题。为了求解0-1背包问题。方法提出利用DNA链置换反应网络,并利用Visual DSD设计仿真实验。结果通过加权、求和和阈值3... 目的基于DNA链置换的化学反应网络可以作为一种有效的编程语言来解决各种数学问题,而0-1背包问题是一个经典的NP问题。为了求解0-1背包问题。方法提出利用DNA链置换反应网络,并利用Visual DSD设计仿真实验。结果通过加权、求和和阈值3个反应模块进行求解,最后由输出的单链DNA来表达结果。由于浓度的检测存在一定误差,使用带有荧光分子的单链DNA输出表达操作结果。最后,使用DSD仿真软件得到变量转换模块相对应的链置换反应网络图、变量仿真图以及阈值比较图。模型表明,该算法能够有效降低0-1背包问题的复杂度,并且具有较高的求解精度和稳定性。结论所提出的模型进一步丰富了DNA计算,并拓宽了DNA链位移的计算宽度。 展开更多
关键词 dna链置换 0-1背包问题 NP问题 dna计算
下载PDF
Solving the independent set problem by sticker based DNA computers
5
作者 Hassan Taghipour Ahad Taghipour +1 位作者 Mahdi Rezaei Heydar Ali Esmaili 《American Journal of Molecular Biology》 2012年第2期153-158,共6页
In this paper, the sticker based DNA computing was used for solving the independent set problem. At first, solution space was constructed by using appropriate DNA memory complexes. We defined a new operation called “... In this paper, the sticker based DNA computing was used for solving the independent set problem. At first, solution space was constructed by using appropriate DNA memory complexes. We defined a new operation called “divide” and applied it in construction of solution space. Then, by application of a sticker based parallel algorithm using biological operations, independent set problem was resolved in polynomial time. 展开更多
关键词 Parallel computing Sticker BASED dna computers INDEPENDENT Set PROBLEM NP-COMPLETE PROBLEM
下载PDF
激素敏感性前列腺癌患者中PSMA PET/CT衍生参数与循环肿瘤DNA特征之间的相关性分析
6
作者 潘剑 叶定伟 +1 位作者 朱耀 王备合 《中国癌症杂志》 CAS CSCD 北大核心 2024年第7期680-685,共6页
背景与目的:前列腺特异性膜抗原(prostate-specific membrane antigen,PSMA)正电子发射计算机体层显像(positron emission tomography/computed tomography,PET/CT)和循环肿瘤DNA(circulating tumor DNA,ctDNA)的检测结果都是激素敏感... 背景与目的:前列腺特异性膜抗原(prostate-specific membrane antigen,PSMA)正电子发射计算机体层显像(positron emission tomography/computed tomography,PET/CT)和循环肿瘤DNA(circulating tumor DNA,ctDNA)的检测结果都是激素敏感性前列腺癌(hormone-sensitive prostate cancer,HSPC)治疗决策的参考依据。本研究旨在分析HSPC患者中PSMA PET/CT衍生参数与ctDNA特征之间的相关性。方法:回顾性纳入于复旦大学附属肿瘤医院就诊且接受PSMA PET/CT和ctDNA测序的间隔≤2周、有完整病历记录的HSPC患者。排除存在除前列腺癌外的活动性恶性肿瘤,以及组织学特征支持纯神经内分泌癌或小细胞癌诊断的患者。本研究经复旦大学附属肿瘤医院伦理委员会批注(伦理编号:1909207-12)。采用Spearman相关系数评价PSMA PET/CT衍生参数最大标准摄取值(maximum standardized uptake value,SUVmax)、总肿瘤体积(total tumor volume,TTV)、病灶摄取总量(total lesion uptake,TLU)与ctDNA分数(ctDNA%)之间的相关性。结果:共纳入60例HSPC患者,TP53(3.3%)、BRCA2(3.3%)和ATM(3.3%)是最常见的突变基因。在相关性分析中,ctDNA%与SUVmax有显著相关性(Spearman’s rho=0.272,P=0.036);ctDNA%与TLU(Spearman’s rho=0.160,P=0.222)和TTV(Spearman’s rho=0.162,P=0.215)无显著相关性。结论:SUVmax与ctDNA%之间有显著相关性,提示与无PSMA阳性病灶和低PSMA摄取病灶的患者相比,存在高PSMA摄取病灶的患者接受联合靶向治疗的概率增加,本研究结果有望作为制订个体化治疗方案的参考。 展开更多
关键词 激素敏感性前列腺癌 前列腺特异性膜抗原 正电子发射计算机体层显像 循环肿瘤dna 相关性分析
下载PDF
肺腺癌胸腔积液DNA倍体异常与EGFR突变的关系及其对患者预后的影响
7
作者 刘颖 王蕊 +4 位作者 郭晓 董律吏 张艳 赵银环 杜芸 《癌变.畸变.突变》 CAS 2023年第3期178-182,186,共6页
目的:回顾性分析转移性肺腺癌胸腔积液细胞的DNA倍体异常和表皮生长因子受体(EGFR)基因突变的关系,及其对肺腺癌患者预后的影响。方法:收集河北医科大学第四医院2012—2019年439例肺腺癌伴恶性胸腔积液患者的临床资料。使用计算机辅助DN... 目的:回顾性分析转移性肺腺癌胸腔积液细胞的DNA倍体异常和表皮生长因子受体(EGFR)基因突变的关系,及其对肺腺癌患者预后的影响。方法:收集河北医科大学第四医院2012—2019年439例肺腺癌伴恶性胸腔积液患者的临床资料。使用计算机辅助DNA倍体定量分析系统检测胸腔积液中肺腺癌细胞DNA含量,计算大于5c细胞的百分比、大于9c细胞的数目、最大DNA指数(DI)值、大于5c细胞的平均DI值及非整倍体细胞峰。比较DNA倍体异常、EGFR基因突变各组间的差异,并检验DNA倍体异常与EGFR突变的相关性,分析DNA倍体异常及EGFR基因突变在肺腺癌预后中的价值。结果:439例肺腺癌患者中,共有244例(55.58%)检测出EGFR基因突变。与对照组比较,男性、有吸烟史、大于5c细胞的百分比<14%、大于9c细胞的数目<8、最大DI值<6、大于5c细胞的平均DI值<5的患者,其EGFR基因突变率降低(P<0.05)。不同非整倍体细胞峰的EGFR基因突变率不同,双峰和单峰比无峰的EGFR突变率高(P<0.05),而多峰与其他组的EGFR突变率差异无统计学意义(P>0.05)。与EGFR野生型患者相比,EGFR突变型患者的大于5c细胞的百分比、大于9c细胞的数目、最大DI值、大于5c细胞的平均DI值及非整倍体细胞峰的平均秩次更高(P<0.05),且上述5项指标均与EGFR突变均存在较弱的正相关关系(Kendall’s tau-b相关系数分别为0.186、0.153、0.110、0.156、0.148,均为P<0.05)。单因素生存分析显示,大于5c细胞的百分比≥14%、大于9c细胞的数目≥8、EGFR突变患者的中位总生存时间较对照组患者长(P<0.05)。多因素生存分析显示,EGFR基因突变是晚期肺腺癌患者的独立预后影响因素。结论:晚期肺腺癌患者中EGFR基因突变与DNA倍体异常存在关联,DNA倍体异常可能是预测EGFR基因突变的潜在指标。DNA倍体异常不是晚期肺腺癌患者的独立预后因素,但EGFR基因突变患者预后优于野生型患者。 展开更多
关键词 dna倍体异常 EGFR基因突变 肺腺癌 计算机辅助 预后
下载PDF
弥漫大B细胞淋巴瘤^(18)F-FDG PET/CT代谢参数和循环肿瘤DNA突变丰度:相关性和生存分析
8
作者 徐海青 宋烈晶 丁重阳 《中国实验血液学杂志》 CAS CSCD 北大核心 2023年第6期1690-1700,共11页
目的:探讨弥漫大B细胞淋巴瘤(DLBCL)患者18-氟-脱氧葡萄糖正电子发射断层显像/计算机断层扫描代谢参数与外周血循环肿瘤DNA(ctDNA)的相关性,以及这两类参数在预测无进展生存期(PFS)中的预后价值。方法:回顾性分析同期行外周血ctDNA检测... 目的:探讨弥漫大B细胞淋巴瘤(DLBCL)患者18-氟-脱氧葡萄糖正电子发射断层显像/计算机断层扫描代谢参数与外周血循环肿瘤DNA(ctDNA)的相关性,以及这两类参数在预测无进展生存期(PFS)中的预后价值。方法:回顾性分析同期行外周血ctDNA检测及相应PET/CT扫描的DLBCL患者的临床、PET/CT及ctDNA资料。ctDNA取样及PET扫描时,根据疾病不同治疗及病情发展情况,将患者分为基线组和复发/难治性(R/R)组。ctDNA突变丰度以变异等位基因频率(VAF)表示,包括最大VAF(maxVAF)和平均VAF(meanVAF)。以41%最大标准化摄取值方法获得总代谢肿瘤体积(TMTV)和糖酵解总量(TLG),并获得两最远病灶距离(Dmax),采用Spearman相关分析评估PET参数与ctDNA突变丰度的相关性。在基线及R/R组中分别采用受试者工作特征(ROC)曲线获得这些参数和预测PFS的最佳截断值。采用Kaplan-Meier法勾画生存曲线并行log-rank检验比较生存差异。结果:共纳入67例DLBCL患者,男性33例,女性34例,中位年龄为56.0(46.0,67.0)岁,基线组29例,R/R组38例。PET参数中,除最大标准化摄取值(SUVmax)外,基线TMTV、TLG、Dmax均与基线ctDNA突变丰度显著相关(maxVAFvsTMTV:r=0.711;maxVAFvsTLG:r=0.709;maxVAFvsDmax:r=0.672;meanVAFvsTMTV:r=0.682;meanVAFvsTLG:r=0.677;meanVAFvsDmax:r=0.646),而在全部患者中,以上相关性明显减弱。在R/R患者中,仅TMTV与meanVAF具有较弱的相关性(r=0.376)。对各参数进行ROC分析结果表明,TMTV、TLG和Dmax预测PFS的特异性优于突变丰度,而ctDNA突变丰度的敏感性更好。除R/R患者外,在基线患者和全体患者中可观察到在不同乳酸脱氢酶水平下,TMTV、TLG、Dmax、VAF均具有显著差异(均P<0.05)。生存曲线表明,基线患者中,高TMTV(> 109.5 cm3)、高TLG(> 2 141.3)、高Dmax(> 33.1 cm)及高VAF(maxVAF> 7.74%、meanVAF> 4.39%)均是不良PFS的危险因素,而在R/R患者中仅高VAF(maxVAF和meanVAF均> 0.61%)是影响PFS的危险因素。结论:PET衍生参数与ctDNA突变丰度相关性良好,尤其是在基线患者中。ctDNA的VAF预测PFS较PET代谢参数更敏感,而PET代谢肿瘤负荷具有更好的特异性。TMTV、TLG和VAF均对PFS有良好的预后价值。PET/CT联合ctDNA在预后评估和个性化治疗方面有进一步研究的潜力。 展开更多
关键词 氟脱氧葡萄糖 正电子发射断层显像/计算机断层扫描 循环肿瘤dna 突变丰度 弥漫大B细胞淋巴瘤
下载PDF
SOLVING MINIMUM SPANNING TREE PROBLEM WITH DNA COMPUTING 被引量:3
9
作者 LiuXikui LiYan XuJin 《Journal of Electronics(China)》 2005年第2期112-117,共6页
Molecular programming is applied to minimum spanning problem whose solution requires encoding of real values in DNA strands. A new encoding scheme is proposed for real values that is biologically plausible and has a f... Molecular programming is applied to minimum spanning problem whose solution requires encoding of real values in DNA strands. A new encoding scheme is proposed for real values that is biologically plausible and has a fixed code length. According to the characteristics of the problem, a DNA algorithm solving the minimum spanning tree problem is given. The effectiveness of the proposed method is verified by simulation. The advantages and disadvantages of this algorithm are discussed. 展开更多
关键词 dna computing Genetic algorithms Minimum spanning tree problem
下载PDF
A DNA Computing Model for the Graph Vertex Coloring Problem Based on a Probe Graph 被引量:8
10
作者 Jin xu Xiaoli Qiang +2 位作者 Kai Zhang Cheng Zhang Jing Yang 《Engineering》 2018年第1期61-77,共17页
The biggest bottleneck in DNA computing is exponential explosion, in which the DNA molecules used as data in information processing grow exponentially with an increase of problem size. To overcome this bottleneck and ... The biggest bottleneck in DNA computing is exponential explosion, in which the DNA molecules used as data in information processing grow exponentially with an increase of problem size. To overcome this bottleneck and improve the processing speed, we propose a DNA computing model to solve the graph vertex coloring problem. The main points of the model are as follows: The exponential explosion prob- lem is solved by dividing subgraphs, reducing the vertex colors without losing the solutions, and ordering the vertices in subgraphs; and the bio-operation times are reduced considerably by a designed parallel polymerase chain reaction (PCR) technology that dramatically improves the processing speed. In this arti- cle, a 3-colorable graph with 61 vertices is used to illustrate the capability of the DNA computing model. The experiment showed that not only are all the solutions of the graph found, but also more than 99% of false solutions are deleted when the initial solution space is constructed. The powerful computational capability of the model was based on specific reactions among the large number of nanoscale oligonu- cleotide strands. All these tiny strands are operated by DNA self-assembly and parallel PCR. After thou- sands of accurate PCR operations, the solutions were found by recognizing, splicing, and assembling. We also prove that the searching capability of this model is up to 0(3^59). By means of an exhaustive search, it would take more than 896 000 years for an electronic computer (5 x 10^14 s-1) to achieve this enormous task. This searching capability is the largest among both the electronic and non-electronic computers that have been developed since the DNA computing model was proposed by Adleman's research group in 2002 (with a searching capability of 0(2^20)). 展开更多
关键词 dna computing GRAPH VERTEX COLORING PROBLEM POLYMERASE chain reaction
下载PDF
DNA BIO SOFT COMPUTING AND ITS APPLICATIONS TO INTELLIGENT SYSTEMS
11
作者 任立红 丁永生 邵世煌 《Journal of Shanghai Jiaotong university(Science)》 EI 1999年第2期97-103,共7页
Recently, the possibility of using DNA as a computing tool arouses wide interests of many researchers. In this paper, we first explored the mechanism of DNA computing and its biological mathematics based on the mechan... Recently, the possibility of using DNA as a computing tool arouses wide interests of many researchers. In this paper, we first explored the mechanism of DNA computing and its biological mathematics based on the mechanism of biological DNA. Then we integrated DNA computing with evolutionary computation, fuzzy systems, neural networks and chaotic systems in soft computing technologies. Finally, we made some prospects on the further work of DNA bio soft computing. 展开更多
关键词 dna computING SOFT computING EVOLUTIONARY computation fuzzy SYSTEMS neural networks CHAOTIC SYSTEMS
下载PDF
Job shop scheduling problem based on DNA computing
12
作者 Yin Zhixiang Cui Jianzhong Yang Yan Ma Ying 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2006年第3期654-659,共6页
To solve job shop scheduling problem, a new approach-DNA computing is used in solving job shop scheduling problem. The approach using DNA computing to solve job shop scheduling is divided into three stands. Finally, o... To solve job shop scheduling problem, a new approach-DNA computing is used in solving job shop scheduling problem. The approach using DNA computing to solve job shop scheduling is divided into three stands. Finally, optimum solutions are obtained by sequencing A small job shop scheduling problem is solved in DNA computing, and the "operations" of the computation were performed with standard protocols, as ligation, synthesis, electrophoresis etc. This work represents further evidence for the ability of DNA computing to solve NP-complete search problems. 展开更多
关键词 dna computing job shop scheduling problem WEIGHTED tournament.
下载PDF
Hamilton Graph Based on DNA Computing
13
作者 ZHANGJia-xiu 《Chinese Quarterly Journal of Mathematics》 CSCD 2004年第1期79-83,共5页
DNA computing is a novel method for solving a class of intractable computational problem, in which the computing can grow exponentially with problem size. Up to now, many accomplishments have been achieved to improve ... DNA computing is a novel method for solving a class of intractable computational problem, in which the computing can grow exponentially with problem size. Up to now, many accomplishments have been achieved to improve its performance and increase its reliability. Hamilton Graph Problem has been solved by means of molecular biology techniques. A small graph was encoded in molecules of DNA, and the 'operations' of the computation were performed with standard protocols and enzymes. This work represents further evidence for the ability of DNA computing to solve NP-complete search problems. 展开更多
关键词 Hamilton Graph dna computing NP-COMPLETE
下载PDF
Applying DNA Computation to Error Detection Problem in Rule-Based Systems
14
作者 Behrouz Madahian Amin Salighehdar Reza Amini 《Journal of Intelligent Learning Systems and Applications》 2015年第1期21-36,共16页
As rule-based systems (RBS) technology gains wider acceptance, the need to create and maintain large knowledge bases will assume greater importance. Demonstrating a rule base to be free from error remains one of the o... As rule-based systems (RBS) technology gains wider acceptance, the need to create and maintain large knowledge bases will assume greater importance. Demonstrating a rule base to be free from error remains one of the obstacles to the adoption of this technology. In the past several years, a vast body of research has been carried out in developing various graphical techniques such as utilizing Petri Nets to analyze structural errors in rule-based systems, which utilize propositional logic. Four typical errors in rule-based systems are redundancy, circularity, incompleteness, and inconsistency. Recently, a DNA-based computing approach to detect these errors has been proposed. That paper presents algorithms which are able to detect structural errors just for special cases. For a rule base, which contains multiple starting nodes and goal nodes, structural errors are not removed correctly by utilizing the algorithms proposed in that paper and algorithms lack generality. In this study algorithms mainly based on Adleman’s operations, which are able to detect structural errors, in any form that they may arise in rule base, are presented. The potential of applying our algorithm is auspicious giving the operational time complexity of O(n*(Max{q, K, z})), in which n is the number of fact clauses;q is the number of rules in the longest inference chain;K is the number of tubes containing antecedents which are comprised of distinct number of starting nodes;and z denotes the maximum number of distinct antecedents comprised of the same number of starting nodes. 展开更多
关键词 dna computING RULE-BASED Systems RULE VERIFICATION Structural ERRORS
下载PDF
家庭旅行商问题的三链DNA计算模型
15
作者 蒋天怿 杨静 《怀化学院学报》 2023年第5期50-52,共3页
一种基于三链DNA计算模型的DNA算法被用于解决家庭旅行商问题(Family Traveling Salesperson Problem,FTSP)。该算法通过对实例中的顶点和弧编码进行几次基本的生化操作来获得问题的解,进一步验证了DNA计算具有解决更复杂大数据问题的... 一种基于三链DNA计算模型的DNA算法被用于解决家庭旅行商问题(Family Traveling Salesperson Problem,FTSP)。该算法通过对实例中的顶点和弧编码进行几次基本的生化操作来获得问题的解,进一步验证了DNA计算具有解决更复杂大数据问题的潜力。 展开更多
关键词 FTSP dna计算 三链dna
下载PDF
Enhanced Parallelized DNA-Coded Stream Cipher Based on Multiplayer Prisoners’Dilemma
16
作者 Khaled M.Suwais 《Computers, Materials & Continua》 SCIE EI 2023年第5期2685-2704,共20页
Data encryption is essential in securing exchanged data between connected parties.Encryption is the process of transforming readable text into scrambled,unreadable text using secure keys.Stream ciphers are one type of... Data encryption is essential in securing exchanged data between connected parties.Encryption is the process of transforming readable text into scrambled,unreadable text using secure keys.Stream ciphers are one type of an encryption algorithm that relies on only one key for decryption and as well as encryption.Many existing encryption algorithms are developed based on either a mathematical foundation or on other biological,social or physical behaviours.One technique is to utilise the behavioural aspects of game theory in a stream cipher.In this paper,we introduce an enhanced Deoxyribonucleic acid(DNA)-coded stream cipher based on an iterated n-player prisoner’s dilemma paradigm.Our main goal is to contribute to adding more layers of randomness to the behaviour of the keystream generation process;these layers are inspired by the behaviour of multiple players playing a prisoner’s dilemma game.We implement parallelism to compensate for the additional processing time that may result fromadding these extra layers of randomness.The results show that our enhanced design passes the statistical tests and achieves an encryption throughput of about 1,877 Mbit/s,which makes it a feasible secure stream cipher. 展开更多
关键词 ENCRYPTION game theory dna cryptography stream cipher parallel computing
下载PDF
基于DNA折纸的可编程纳米计算
17
作者 王方 肖溢锐 +2 位作者 吕姝颖 强小利 石晓龙 《广州大学学报(自然科学版)》 CAS 2023年第5期52-62,共11页
在过去的半个世纪中,随着基于半导体集成电路的电子计算机发展遇到了硬件瓶颈,新型计算机理论与技术的探索成为了研究的焦点。DNA作为携带遗传信息的载体,其高密度的数据存储和并行运行能力使得DNA计算成为新型计算的研究热点之一。DNA... 在过去的半个世纪中,随着基于半导体集成电路的电子计算机发展遇到了硬件瓶颈,新型计算机理论与技术的探索成为了研究的焦点。DNA作为携带遗传信息的载体,其高密度的数据存储和并行运行能力使得DNA计算成为新型计算的研究热点之一。DNA计算理论与实验技术的研究促进了DNA纳米制造技术的快速发展,同时DNA纳米技术为DNA计算搭载了可靠的分子实验技术平台。文章首先简单介绍了DNA计算与DNA纳米技术的发展和成果,重点关注DNA折纸这一完全可寻址、可编程的纳米结构,从基于DNA折纸的逻辑电路、可编程自组装、计算结构等方面对DNA计算的发展进行综述和展望。 展开更多
关键词 dna计算 dna折纸 dna逻辑门 算法自组装
下载PDF
旅行商问题的DNA可视化计算模型
18
作者 张彤彤 杨静 +2 位作者 殷志祥 蒋天怿 郑雅雯 《哈尔滨商业大学学报(自然科学版)》 CAS 2023年第6期694-701,共8页
基于“DNA折纸术”提出一个旅行商问题的解决方案,利用“DNA折纸术”折叠出固定大小的DNA纳米结构作为DNA折纸基底,利用分子信标表示旅行商问题中的城市(即顶点)和路径,将旅行商问题的路径映射为一个有向图,选择根节点最终将问题映射为... 基于“DNA折纸术”提出一个旅行商问题的解决方案,利用“DNA折纸术”折叠出固定大小的DNA纳米结构作为DNA折纸基底,利用分子信标表示旅行商问题中的城市(即顶点)和路径,将旅行商问题的路径映射为一个有向图,选择根节点最终将问题映射为有向树,并将有向树锚定在DNA折纸基底上,利用杂交链式反应反应出经过每个点且长度最短的DNA长链,即为该问题的最优解,同时用荧光标记的分子信标个数检测其路径长度,实现求解旅行商问题的可视化.通过实例模拟和仿真实验验证方法的有效性和可行性,分析给出该DNA可视化计算模型的复杂度. 展开更多
关键词 dna折纸术 杂交链式反应 旅行商问题 分子信标 dna计算
下载PDF
DNA计算的研究进展与展望 被引量:33
19
作者 高琳 许进 张军英 《电子学报》 EI CAS CSCD 北大核心 2001年第7期973-977,共5页
DNA计算是一种模拟生物分子DNA的结构并借助于分子生物技术进行计算的新方法 ,它开创了以化学反应作为计算工具的先例 ,为NP 完全问题的解决提供了一种全新的途径 ,具有广阔的应用前景 .DNA计算的两个主要特点是计算的高度并行性和巨大... DNA计算是一种模拟生物分子DNA的结构并借助于分子生物技术进行计算的新方法 ,它开创了以化学反应作为计算工具的先例 ,为NP 完全问题的解决提供了一种全新的途径 ,具有广阔的应用前景 .DNA计算的两个主要特点是计算的高度并行性和巨大的信息存储容量 .本文首先介绍了DNA计算的基本思想 ;然后综述了DNA算例及其模型 ;分析了DNA计算的特点及其与遗传算法的类比关系 ;指出了DNA计算目前存在的问题 ;最后对DNA计算的发展前景进行展望 . 展开更多
关键词 dna计算 分子计算 dna计算机 遗传算法
下载PDF
DNA计算机原理、进展及难点(Ⅳ):论DNA计算机模型 被引量:33
20
作者 许进 谭钢军 +1 位作者 范月科 郭养安 《计算机学报》 EI CSCD 北大核心 2007年第6期881-893,共13页
在DNA计算机研究中,所建模型的好坏直接影响着DNA计算中诸多问题,如编码的难易程度、整个生物操作或生化反应的设计、解空间的大小、计算时间多少、应用范围以及通用性的程度等.如何建立快速的、功能强的、具有一定通用性的DNA计算机模... 在DNA计算机研究中,所建模型的好坏直接影响着DNA计算中诸多问题,如编码的难易程度、整个生物操作或生化反应的设计、解空间的大小、计算时间多少、应用范围以及通用性的程度等.如何建立快速的、功能强的、具有一定通用性的DNA计算机模型,是从事DNA计算机研究者一直关注与感兴趣的难题.为此,该文将主要围绕着DNA计算机的模型建立展开讨论,重点讨论10年来所建立起来的一些主要模型.共分为三种类型:第一种是利用DNA分子结构与特性所建立起来的几种主要模型;第二种是利用生物操作方式所建立的三种模型:试管型、表面型与芯片型;第三种是所谓的DNA计算机模型.文中讨论了这些模型的基本原理、功能、优缺点以及应用的研究进展等.最后,对DNA计算机模型研究中的难点进行了分析,并给出了相应的解决思路. 展开更多
关键词 dna计算 dna计算机 模型
下载PDF
上一页 1 2 32 下一页 到第
使用帮助 返回顶部