<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>06039160</id>
  <dt>j</dt>
  <an>06039160</an>
  <augroup>
    <au>Brijder, Robert</au>
    <au>Gillis, Joris J.M.</au>
    <au>Van den Bussche, Jan</au>
  </augroup>
  <ti>A comparison of graph-theoretic DNA hybridization models.</ti>
  <so>Theor. Comput. Sci. 429, 46-53 (2012).</so>
  <py>2012</py>
  <pu>Elsevier Science Publishers, Amsterdam</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>DNA hybridization</ut>
    <ut>multiset-based graph grammars</ut>
    <ut>self-assembly</ut>
    <ut>database theory</ut>
  </utgroup>
  <cigroup>
    <ci>Zbl pre06043744</ci>
    <ci>Zbl 05948114</ci>
  </cigroup>
  <ligroup>
    <li>doi:10.1016/j.tcs.2011.12.023</li>
  </ligroup>
  <abgroup>
    <ab>Summary: We show that the graph-theoretic DNA hybridization models of pot tiles [{\it N. Jonoska}, {\it G. I. McColm} and {\it A. Staninska}, Lect. Notes Comput. Sci. 4287, 83--94 (2006; Zbl 1132.68399)] and sticker complexes [the last two authors, ibid. 6479, 18--37 (2012; Zbl 06043744); {\it R. Brijder} and the last two authors, ibid. 6937, 49--63 (2011; Zbl 05948114)] 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.</ab>
    <rv></rv>
  </abgroup>
</item>