Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/12223
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | BRIJDER, Robert | - |
dc.contributor.author | GILLIS, Joris | - |
dc.contributor.author | VAN DEN BUSSCHE, Jan | - |
dc.date.accessioned | 2011-10-11T09:00:33Z | - |
dc.date.available | NO_RESTRICTION | - |
dc.date.available | 2011-10-11T09:00:33Z | - |
dc.date.issued | 2011 | - |
dc.identifier.citation | Cardelli, Luca & Shih, William (Ed.) DNA Computing and Molecular Programming. p. 49-63. | - |
dc.identifier.isbn | 978-3-642-23637-2 | - |
dc.identifier.uri | http://hdl.handle.net/1942/12223 | - |
dc.description.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. | - |
dc.language.iso | en | - |
dc.publisher | Springer-Verlag | - |
dc.relation.ispartofseries | Lecture Notes in Computer Science | - |
dc.subject.other | DNA Computing, theoretical computer science, hybridization, graphs | - |
dc.title | Graph-theoretic Formalization of Hybridization in DNA Sticker Complexes | - |
dc.type | Proceedings Paper | - |
local.bibliographicCitation.authors | Cardelli, Luca | - |
local.bibliographicCitation.authors | Shih, William | - |
local.bibliographicCitation.conferencename | 17th International Conference on DNA Computing and Molecular Programming | - |
local.bibliographicCitation.conferenceplace | Pasadena, CA, USA 2011 | - |
dc.identifier.epage | 63 | - |
dc.identifier.spage | 49 | - |
local.bibliographicCitation.jcat | C1 | - |
local.type.refereed | Refereed | - |
local.type.specified | Proceedings Paper | - |
local.relation.ispartofseriesnr | 6937 | - |
dc.bibliographicCitation.oldjcat | C2 | - |
dc.identifier.doi | 10.1007/978-3-642-23638-9_7 | - |
dc.identifier.isi | 000306630000007 | - |
local.bibliographicCitation.btitle | DNA Computing and Molecular Programming | - |
item.accessRights | Open Access | - |
item.contributor | BRIJDER, Robert | - |
item.contributor | GILLIS, Joris | - |
item.contributor | VAN DEN BUSSCHE, Jan | - |
item.fulltext | With Fulltext | - |
item.fullcitation | BRIJDER, 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.validation | ecoom 2013 | - |
Appears in Collections: | Research publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
pasadena.pdf | Non Peer-reviewed author version | 113.48 kB | Adobe PDF | View/Open |
SCOPUSTM
Citations
6
checked on Sep 3, 2020
WEB OF SCIENCETM
Citations
3
checked on Apr 14, 2024
Page view(s)
188
checked on Sep 7, 2022
Download(s)
384
checked on Sep 7, 2022
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.