Proceedings ArticleDOI
Clique-Detection Algorithm Using Clique-Self-Assembly
Raghavan Rama,Suresh Badarla,Kamala Krithivasan +2 more
- pp 225-230
Reads0
Chats0
TLDR
This work answers the question: Can a given set of graphs be generated through the self-assembly of clique-self-assembly and concludes that the problem of finding the generator is decidable.Abstract:
Self-assembly is a process in which simple objects autonomously combine themselves into larger objects. It is considered as a promising technique in nano-technology. Two simple graphs G1 and G2 with a clique of same size overlap and a new self-assembled graph is formed. Besides studying the properties of self assembled graphs on cliques, we answer the question: Can a given set of graphs be generated through the self-assembly of cliques? If so, how to find the generator that could generate the given set of graphs by the process of clique-self-assembly. The question of the existence of minimal generator is also discussed. The necessary and sufficient condition for a graph H to be obtained by the iterated clique-self-assembly of the graph G is also answered. We also conclude that the problem of finding the generator is decidable. We note the importance of our work with respect to several closely related clique finding problem.read more
References
More filters
Book Chapter
The program-size complexity of self-assembled squares
TL;DR: A formal model of pseudocrystalline self-assembly, called the Tile Assembly Model, in which a tile may be added to the growing object when the total interaction strength with its neighbors exceeds a parameter Τ is studied, which finds a dramatic decrease in complexity.
Proceedings ArticleDOI
The program-size complexity of self-assembled squares (extended abstract)
TL;DR: In this paper, a tile may be added to the growing object when the total interaction strength with its neighbors exceeds a parameter Τ. This model has been shown to be Turing-universal.
Book Chapter
Universal Computation via Self-assembly of DNA: Some Theory and Experiments
TL;DR: The computational capabilities inherent in the hybridization of DNA molecules are examined, and it is shown that the self-assembly of oligonucleotides into linear duplex DNA can only generate sets of sequences equivalent to regular languages.
Journal ArticleDOI
Maximum common subgraph isomorphism algorithms and their applications in molecular science: a review
TL;DR: The intuitive description of small and large molecules using graphs has led to an increasing interest in the application of graph concepts for describing, analyzing, and comparing small molecules as well as proteins.