Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
437209 | Theoretical Computer Science | 2012 | 8 Pages |
Abstract
We show that the graph-theoretic DNA hybridization models of pot tiles (Jonoska et al. (2006, 2011) [4,5]) and sticker complexes (Gillis and Van den Bussche (2011) and Brijder et al. (2011) [3,2]) are equivalent. This allows one to carry over known results from one model to the other. In addition, we introduce the concept of “greedy” hybridization and compare it to “regular” hybridization.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics