Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/12223
Title: Graph-theoretic Formalization of Hybridization in DNA Sticker Complexes
Authors: BRIJDER, Robert 
GILLIS, Joris 
VAN DEN BUSSCHE, Jan 
Issue Date: 2011
Publisher: Springer-Verlag
Source: Cardelli, Luca & Shih, William (Ed.) DNA Computing and Molecular Programming. p. 49-63.
Series/Report: Lecture Notes in Computer Science
Series/Report no.: 6937
Abstract: Sticker complexes are a formal graph-based data model for a restricted class of DNA complexes, motivated by potential applications to databases. This data model allows for a purely declarative definition of hybridization. We introduce the notion of terminating hybridization, and characterize this notion in purely graph-theoretic terms. Terminating hybridization can still produce results of exponential size. We indicate a class of complexes where hybridization is guaranteed to be polynomially bounded.
Keywords: DNA Computing, theoretical computer science, hybridization, graphs
Document URI: http://hdl.handle.net/1942/12223
ISBN: 978-3-642-23637-2
DOI: 10.1007/978-3-642-23638-9_7
ISI #: 000306630000007
Category: C1
Type: Proceedings Paper
Validations: ecoom 2013
Appears in Collections:Research publications

Files in This Item:
File Description SizeFormat 
pasadena.pdfPreprint113.48 kBAdobe PDFView/Open
Show full item record

SCOPUSTM   
Citations

6
checked on Sep 3, 2020

WEB OF SCIENCETM
Citations

3
checked on May 21, 2022

Page view(s)

170
checked on May 25, 2022

Download(s)

348
checked on May 25, 2022

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.