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

Uloženo v:
Podrobná bibliografie
Vydáno v:Algorithms in Computational Molecular Biology: Techniques, Approaches and Applications s. 171 - 190
Hlavní autoři: Hsieh, Sun‐Yuan, Huang, Chao‐Wen, Chou, Hsin‐Hung
Médium: Kapitola
Jazyk:angličtina
Vydáno: Hoboken, NJ, USA John Wiley & Sons, Inc 18.01.2011
Edice:Wiley Series on Bioinformatics: Computational Techniques and Engineering
Témata:
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
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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