<?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-09-21T06:56:53Z</responseDate>
  <request verb="GetRecord" identifier="oai:meral.edu.mm:recid/4501" metadataPrefix="oai_dc">https://meral.edu.mm/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:meral.edu.mm:recid/4501</identifier>
        <datestamp>2021-12-13T02:02:49Z</datestamp>
        <setSpec>1582963302567:1597824273898</setSpec>
        <setSpec>user-ucsy</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>Chemical Structure Searching in Chemical Compound Graph Databases</dc:title>
          <dc:creator>Thaing, Aye Nwe</dc:creator>
          <dc:description>In chemical informatics, the structure ofchemical compound can be represented as graphwith atoms as nodes and bonds as edges. Exactstructural graph matching (automorphism),exact substructure graph matching (subgraphisomorphism) and graph similarity searching areimportant research areas of chemicalinformatics. In this paper, we develop the systemfor efficient exact graph matching and graphsimilarity searching using the edge code. Thestructural information of chemical graph isgenerated as the edge code. To improve theprecision of exact graph matching, we use ournovel edge code index structure to find theautomorphic graph in the database. Forsimilarity searching, we utilize the fuzzy querysimilarity graph matching based on the edgecode to improve the computational speed.Finally, we conduct an extensive set ofexperiments on chemical compound database todemonstrate the efficiency of our approach forefficient exact graph matching and similaritysearching.</dc:description>
          <dc:date>2012-02-28</dc:date>
          <dc:identifier>http://hdl.handle.net/20.500.12678/0000004501</dc:identifier>
          <dc:identifier>https://meral.edu.mm/records/4501</dc:identifier>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
