DNA芯片在0-1规划问题中的应用

生物芯片技术和DNA计算分别是近年来生命科学与信息科学的新兴研究领域,对信息高度并行的获取与处理是二者的本质特性.而0-1规划问题作为运筹学中一个重要的问题,到目前为止还没有好的算法.在DNA计算和DNA芯片基础上,提出了基于DNA芯片解决0-1规划问题的DNA计算新模型,与以往DNA计算模型相比,该模型具有高信息量和操作易自动化的优点.同时指出DNA芯片技术有望作为新型生物计算的芯片.     

0-1整数规划问题的半自动化DNA计算模型

对一般的0—1整数规划问题提出了一种半自动化的DNA计算模型。首先产生所给定的0—1整数规划问题的所有可能解,然后设置对应于0—1整数规划问题的约束不等式的探针,利用这些探针设计半自动化装置对所有可能解进行自动分离,最终找出0—1整数规划问题的解。该模型的最大优点在于具有自动化的特点;同时,从理论上来讲,该模型适合含有任意变量的任意0—1整数规划问题的求解。     

基于分子信标的DNA计算

DNA计算是解决一类难以计算问题的一种新方法,这种计算随着问题的增大可以呈指数增长．迄今为止,许多研究成果已经成功地提高了它的性能和增加了它的可行性,本文在基于表面的DNA计算中采用了分子信标编码策略,并对分子信标在与对应的补链杂交形成双链时的受力进行分析,给出3-SAT问题的另一种解法．这种方法比现有的方法更有效,更具发展前景．因为它具有编码简单;耗材底;操作时间短;技术先进等优点．本文尝试了分子生物学,光学和力学的结合．这一工作为DNA计算能解决NP一完全问题提供了更有力的依据．     

分子信标DNA计算模型的研究进展与展望

由于分子信标具有结构简单,灵敏度高及反应迅速等优点,因此,利用分子信标进行数学问题的求解将成为可能.通过对分子信标的计算模型进行详细的介绍,并对分子信标的计算模型的研究思路进行了展望,据此思路,可以建立多种组合优化问题及逻辑门的分子信标计算模型.     

与非门(NAND)的DNA计算模型

近年来,随着DNA计算研究的深入,基于DNA的布尔电路的模拟成为其中一个热门的研究方向.分子信标是一种特殊的探针分子,广泛应用于各种生物技术的检测方面,具有结果稳定,特异性强的优点,本文提出了一种基于诱导"发夹"形式的DNA与非门模型,和已有的模型相比,该模型具有简单,可靠性更高且可以重复使用等优点.     

分子信标探针用于PCR检测对虾白斑杆状病毒

将对虾白斑杆状病毒的一段特异性DNA设计成分子信标探针,用于该病毒的PCR检测.温度与荧光强度之间的关系表明,所设计探针的发夹既可以形成也可以打开,符合PCR对分子信标探针的要求.结果表明,在PCR同时加入分子信标探针不影响PCR扩增,分子信标探针只能与目的DNA杂交,具有较高的特异性.随着PCR循环数的增加以及含目的DNA的质粒拷贝数的增加,荧光强度都随之增强.     

新书介绍

科学出版社生命科学编辑部新书推介“反爆炸、生物、化学、核与辐射恐怖活动的科学技术问题和对策研究”丛书蛋白质芯片(影印版)Protein M icroarraysM ark Schena7-03-014321-3/Q.14762005.565元生物芯片技术是一种高通量检测技术,它包括基因芯片、蛋白芯片及芯片实验室三大领域。蛋白质芯片以蛋白质代替DNA作为检测目的物,比基因芯片更接近生命活动的物质层面,能直接测定蛋白质的相对水平及与其他分子的交互作用情况,以定量化的方式反映基因的活动情况,因而蛋白质芯片有着比基因芯片更加直接的应用前景。本书对蛋白质芯片技术进行了全…     

全错位排列问题的基于表面的DNA计算模型

生物表面技术是DNA计算的一种实现方式,是近年来生命科学的新兴研究领域．而全错位排列问题作为组合数学中一个重要的问题,到目前为止还没有好的算法．在DNA表面技术的基础上,首次提出了全错位排列问题的基于表面的DNA计算模型,并对模型进行了简单的分析．     

用于HBV病毒快速诊断的分子信标探针设计

分子信标是一种高灵敏度、高特异性的新型荧光核酸探针.它在与互补DNA或RNA靶序列杂交时放出荧光.利用Genebank中调出已知HBV病毒ayr亚型基因组信息,通过BeaconDesigner4.0软件进行分子信标探针设计,共设计出6条分子信标探针,以便于为目前HBV病毒快速诊断提供参考.     

分子信标核酸检测技术研究进展

介绍了分子信标设计和分子信标核酸检测原理、技术特性和在基因突变大规模自动化检测中的应用. 分子信标是一种基于荧光共振能量转移现象设计的发卡型寡核苷酸探针,空间结构上呈茎环结构, 环序列是与靶核酸互补的探针,茎序列由与靶序列无关的互补序列构成,茎的一端连上荧光分子,另一端连上淬灭分子.通过空间结构改变决定分子信标发射荧光特性,从而对核酸进行定量检测. 分子信标技术具有操作简单、敏感、特异、可对核酸进行液相实时检测和对活体内核酸动态进行检测等特点,已应用于HIV辅助受体基因等基因突变的大规模自动化检测,是一种新型核酸定量检测技术.     

The general form of 0-1 programming problem based on DNA computing

DNA computing is a novel method of solving a class of intractable computational problems, in which the computing speeds up exponentially with the problem size. Up to now, many accomplishments have been made to improve its performance and increase its reliability. In this paper, we solved the general form of 0-1 programming problem with fluorescence labeling techniques based on surface chemistry by attempting to apply DNA computing to a programming problem. Our method has some significant advantages such as simple encoding, low cost, and short operating time.     

Homogeneous scoring of single-nucleotide polymorphisms: comparison of the 5'-nuclease TaqMan assay and Molecular Beacon probes

Homogeneous assays based on real-time fluorescence monitoring during PCR are relevant alternatives for large-scale genotyping of single-nucleotide polymorphisms (SNPs). We compared the performance of the homogeneous TaqMan 5'-nuclease assay and the Molecular Beacon assay using three SNPs in the human estrogen receptor gene as targets. When analyzing a panel of 90 DNA samples, both assays yielded a comparable power of discrimination between the genotypes of a C-to-T transition in codon 10 and a G-to-A transition in codon 594 of the estrogen receptor gene. The Molecular Beacon probes distinguished better than the TaqMan probes between homozygous and heterozygous genotypes of a C-to-G transversion in codon 325. The sensitivity of detecting one allele, present as a minority in a mixed sample, varied between the SNPs and was similar for both assays. With the Molecular Beacon assay, the measured signal ratios were proportional to the amount of the minor allele over a wider range than with the TaqMan assay at all three SNPs.     

DNA computation model to solve 0-1 programming problem

0-1 programming problem is an important problem in opsearch with very widespread applications. In this paper, a new DNA computation model utilizing solution-based and surface-based methods is presented to solve the 0-1 programming problem. This model contains the major benefits of both solution-based and surface-based methods; including vast parallelism, extraordinary information density and ease of operation. The result, verified by biological experimentation, revealed the potential of DNA computation in solving complex programming problem.     

Detection of an abasic site in RNA with stem-loop DNA beacons: application to an activity assay for Ricin Toxin A-Chain

The catalytic ability of Ricin Toxin A-Chain (RTA) to create an abasic site in a 14-mer stem-tetraloop RNA is exploited for its detection. RTA catalyzes the hydrolysis of the N-glycosidic bond of a specific adenosine in the GAGA tetraloop of stem-loop RNA. Thus, a 14-mer stem-loop RNA substrate containing an intact “GAGA” sequence can be discriminated from the product containing an abasic “GabGA” sequence by hybridization with a 14-mer DNA stem-loop probe sequence and following the fluorescent response of the heteroduplexes. Three DNA beacon probe designs are described. Beacon 1 probe is a stem-loop structure and has a fluorophore and a quencher covalently linked to the 5′- and 3′-ends. In this format the probe–substrate heteroduplex gives a fluorescent signal while the probe–product one remains quenched. Beacon 2 is a modified version of 1 and incorporates a pyrene deoxynucleoside for recognition of the abasic site. In this format both the substrate and product heteroduplexes give a fluorescent response. Beacon 3 utilizes a design where the fluorophore is on the substrate RNA sequence at its 5′-end while the quencher is on the probe DNA sequence at its 3′-end. In this format the fluorescence of the substrate–probe heteroduplex is quenched while that of the product–probe one is enhanced. The lower limit of detection with beacons is 14 ng/mL of RTA.     

A CLIQUE algorithm using DNA computing techniques based on closed-circle DNA sequences

DNA computing has been applied in broad fields such as graph theory, finite state problems, and combinatorial problem. DNA computing approaches are more suitable used to solve many combinatorial problems because of the vast parallelism and high-density storage. The CLIQUE algorithm is one of the gird-based clustering techniques for spatial data. It is the combinatorial problem of the density cells. Therefore we utilize DNA computing using the closed-circle DNA sequences to execute the CLIQUE algorithm for the two-dimensional data. In our study, the process of clustering becomes a parallel bio-chemical reaction and the DNA sequences representing the marked cells can be combined to form a closed-circle DNA sequences. This strategy is a new application of DNA computing. Although the strategy is only for the two-dimensional data, it provides a new idea to consider the grids to be vertexes in a graph and transform the search problem into a combinatorial problem.