DNA Computing for Subgraph Isomorphism Problem and Related Problems

This chapter contains sections titled: Introduction Definitions of Subgraph Isomorphism Problem and Related Problems DNA Computing Models The Sticker‐based Solution Space Algorithms for Solving Problems Experimental Data Conclusion References

Saved in:
Bibliographic Details
Published in:Algorithms in Computational Molecular Biology: Techniques, Approaches and Applications pp. 171 - 190
Main Authors: Hsieh, Sun‐Yuan, Huang, Chao‐Wen, Chou, Hsin‐Hung
Format: Book Chapter
Language:English
Published: Hoboken, NJ, USA John Wiley & Sons, Inc 18.01.2011
Series:Wiley Series on Bioinformatics: Computational Techniques and Engineering
Subjects:
DNA computing for subgraph isomorphism problem and related problems ‐ DNA, polymer of a sequence of subunits known as nucleotides
DNA‐based computation, errors in separation of library strands
problem solving algorithms, and DNA‐based algorithms ‐ solving subgraph isomorphism problem and graph isomorphism problem
ISBN:0470505192, 9780470505199
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This chapter contains sections titled: Introduction Definitions of Subgraph Isomorphism Problem and Related Problems DNA Computing Models The Sticker‐based Solution Space Algorithms for Solving Problems Experimental Data Conclusion References
ISBN:0470505192
9780470505199
DOI:10.1002/9780470892107.ch9