Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/12223
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBRIJDER, Robert-
dc.contributor.authorGILLIS, Joris-
dc.contributor.authorVAN DEN BUSSCHE, Jan-
dc.date.accessioned2011-10-11T09:00:33Z-
dc.date.availableNO_RESTRICTION-
dc.date.available2011-10-11T09:00:33Z-
dc.date.issued2011-
dc.identifier.citationCardelli, Luca & Shih, William (Ed.) DNA Computing and Molecular Programming. p. 49-63.-
dc.identifier.isbn978-3-642-23637-2-
dc.identifier.urihttp://hdl.handle.net/1942/12223-
dc.description.abstractSticker 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.-
dc.language.isoen-
dc.publisherSpringer-Verlag-
dc.relation.ispartofseriesLecture Notes in Computer Science-
dc.subject.otherDNA Computing, theoretical computer science, hybridization, graphs-
dc.titleGraph-theoretic Formalization of Hybridization in DNA Sticker Complexes-
dc.typeProceedings Paper-
local.bibliographicCitation.authorsCardelli, Luca-
local.bibliographicCitation.authorsShih, William-
local.bibliographicCitation.conferencename17th International Conference on DNA Computing and Molecular Programming-
local.bibliographicCitation.conferenceplacePasadena, CA, USA 2011-
dc.identifier.epage63-
dc.identifier.spage49-
local.bibliographicCitation.jcatC1-
local.type.refereedRefereed-
local.type.specifiedProceedings Paper-
local.relation.ispartofseriesnr6937-
dc.bibliographicCitation.oldjcatC2-
dc.identifier.doi10.1007/978-3-642-23638-9_7-
dc.identifier.isi000306630000007-
local.bibliographicCitation.btitleDNA Computing and Molecular Programming-
item.fullcitationBRIJDER, Robert; GILLIS, Joris & VAN DEN BUSSCHE, Jan (2011) Graph-theoretic Formalization of Hybridization in DNA Sticker Complexes. In: Cardelli, Luca & Shih, William (Ed.) DNA Computing and Molecular Programming. p. 49-63..-
item.fulltextWith Fulltext-
item.validationecoom 2013-
item.accessRightsClosed Access-
item.contributorBRIJDER, Robert-
item.contributorGILLIS, Joris-
item.contributorVAN DEN BUSSCHE, Jan-
Appears in Collections:Research publications
Files in This Item:
File Description SizeFormat 
pasadena.pdfNon Peer-reviewed author version113.48 kBAdobe PDFView/Open
Show simple item record

SCOPUSTM   
Citations

6
checked on Nov 3, 2025

WEB OF SCIENCETM
Citations

3
checked on Nov 2, 2025

Google ScholarTM

Check

Altmetric


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