<?xml version="1.0" encoding="UTF-8" standalone="yes"?>
<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-06-22T21:19:58Z</responseDate>
  <request identifier="oai:pub.unibl.org:68646" metadataPrefix="oai_dcterms" verb="GetRecord">https://pub.unibl.org/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:pub.unibl.org:68646</identifier>
        <datestamp>2026-06-22T04:43:21Z</datestamp>
      </header>
      <metadata>
        <oai_dcterms:dcterms xmlns:oai_dcterms="http://www.openarchives.org/OAI/2.0/oai_dcterms/" xmlns:dcterms="http://purl.org/dc/terms/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dcterms/ http://www.openarchives.org/OAI/2.0/oai_dcterms.xsd">
          <dcterms:title>A learning search algorithm for the Restricted Longest Common Subsequence problem</dcterms:title>
          <dcterms:creator xsi:type="dcterms:URI" title="Марко Ђукановић">https://www.unibl.org/sr-lat/fis/zaposlen/5218-marko-djukanovic</dcterms:creator>
          <dcterms:creator xsi:type="dcterms:URI" title="Jaume Reixach">/unibl/author/Jaume Reixach</dcterms:creator>
          <dcterms:creator xsi:type="dcterms:URI" title="Ana Nikolikj">/unibl/author/Ana Nikolikj</dcterms:creator>
          <dcterms:creator xsi:type="dcterms:URI" title="Tome Eftimov">/unibl/author/Tome Eftimov</dcterms:creator>
          <dcterms:creator xsi:type="dcterms:URI" title="Александар Картељ">https://www.unibl.org/sr-lat/fis/zaposlen/6237-aleksandar-kartelj</dcterms:creator>
          <dcterms:creator xsi:type="dcterms:URI" title="Christian Blum">/unibl/author/Christian Blum</dcterms:creator>
          <dcterms:date>2025-05</dcterms:date>
          <dcterms:type>Academic Article</dcterms:type>
          <dcterms:type>text</dcterms:type>
          <dcterms:format>22</dcterms:format>
          <dcterms:format>1</dcterms:format>
          <dcterms:identifier>/unibl/sci/idNaucniRad:38619</dcterms:identifier>
          <dcterms:identifier xsi:type="dcterms:URI" title="info:doi/10.1016/j.eswa.2025.127731">https://dx.doi.org/10.1016/j.eswa.2025.127731</dcterms:identifier>
          <dcterms:relation>EXPERT SYSTEMS WITH APPLICATIONS</dcterms:relation>
          <dcterms:relation>0957-4174</dcterms:relation>
          <dcterms:isPartOf>EXPERT SYSTEMS WITH APPLICATIONS</dcterms:isPartOf>
          <dcterms:isPartOf>0957-4174</dcterms:isPartOf>
          <dcterms:references xsi:type="dcterms:URI">https://www.sciencedirect.com/science/article/pii/S0957417425013533?via%3Dihub</dcterms:references>
          <dcterms:bibliographicCitation>M. Đukanović, J. Reixach, A. Nikolikj, T. Eftimov, А. Картељ, C. Blum, A learning search algorithm for the Restricted Longest Common Subsequence problem, EXPERT SYSTEMS WITH APPLICATIONS, Vol. 127731, pp. 1 - 22, May, 2025</dcterms:bibliographicCitation>
          <dcterms:identifier xsi:type="dcterms:URI">https://pub.unibl.org/s/cir/item/68646</dcterms:identifier>
        </oai_dcterms:dcterms>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>