<?xml version='1.0' encoding='UTF-8'?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-03-14T16:28:28Z</responseDate>
  <request metadataPrefix="oai_dc" identifier="oai:kait.repo.nii.ac.jp:00000944" verb="GetRecord">https://kait.repo.nii.ac.jp/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:kait.repo.nii.ac.jp:00000944</identifier>
        <datestamp>2025-06-16T02:34:34Z</datestamp>
        <setSpec>2:16:41:117</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns="http://www.w3.org/2001/XMLSchema" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>DNA計算における分子数低減のための塩基配列設定方式の実験</dc:title>
          <dc:title>Good Encodings for DNA-based Computation with Decreasing the Number of Molecules</dc:title>
          <dc:creator>山本, 富士男</dc:creator>
          <dc:creator>Yamamoto, Fujio</dc:creator>
          <dc:creator>佐藤, 剛志</dc:creator>
          <dc:creator>Sato, Takeshi</dc:creator>
          <dc:creator>宮崎, 剛</dc:creator>
          <dc:creator>Miyazaki, Tsuyoshi</dc:creator>
          <dc:subject>DNA Computing</dc:subject>
          <dc:subject>Molecular Computation</dc:subject>
          <dc:subject>DNA sequence</dc:subject>
          <dc:subject>Hamiltonian path</dc:subject>
          <dc:description>application/pdf</dc:description>
          <dc:description>Encoding methods for DNA-based computation with relatively small number of DNA molecules are proposed. They are composed of several steps of selecting molecules that are predicted not to produce unnecessacy combinations of bases. As compared with a traditional method using random sequences of DNA, the proposed methods were considered to require much less number of molecules in solving graph problems such as directed Hamiltonian path problems.</dc:description>
          <dc:description>departmental bulletin paper</dc:description>
          <dc:publisher>神奈川工科大学</dc:publisher>
          <dc:date>2003-03-20</dc:date>
          <dc:type>VoR</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>神奈川工科大学研究報告.B,理工学編</dc:identifier>
          <dc:identifier>27</dc:identifier>
          <dc:identifier>73</dc:identifier>
          <dc:identifier>80</dc:identifier>
          <dc:identifier>AN10074179</dc:identifier>
          <dc:identifier>09161902</dc:identifier>
          <dc:identifier>https://kait.repo.nii.ac.jp/record/944/files/kkb-027-012.pdf</dc:identifier>
          <dc:identifier>https://doi.org/10.34411/00000937</dc:identifier>
          <dc:identifier>http://hdl.handle.net/10368/938</dc:identifier>
          <dc:identifier>https://kait.repo.nii.ac.jp/records/944</dc:identifier>
          <dc:language>jpn</dc:language>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
