<?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-04-07T05:59:27Z</responseDate>
  <request identifier="oai:pub.unibl.org:37699" metadataPrefix="mets" verb="GetRecord">https://pub.unibl.org/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:pub.unibl.org:37699</identifier>
        <datestamp>2024-06-12T15:38:15Z</datestamp>
      </header>
      <metadata>
        <mets xmlns="http://www.loc.gov/METS/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.loc.gov/METS/ http://www.loc.gov/standards/mets/mets.xsd" xmlns:xlink="http://www.w3.org/1999/xlink">
          <dmdSec ID="dmd-37699">
            <mdWrap MDTYPE="DC" MDTYPEVERSION="DCMI Metadata Terms">
              <xmlData xmlns:dcterms="http://purl.org/dc/terms/">
                <dcterms:title>An A* search algorithm for the constrained 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="Christoph Berger">/unibl/author/Christoph Berger</dcterms:creator>
                <dcterms:creator xsi:type="dcterms:URI" title="Guenther Raidl">/unibl/author/Guenther Raidl</dcterms:creator>
                <dcterms:creator xsi:type="dcterms:URI" title="Christian Blum">/unibl/author/Christian Blum</dcterms:creator>
                <dcterms:date>2021-02</dcterms:date>
                <dcterms:type>Academic Article</dcterms:type>
                <dcterms:type>text</dcterms:type>
                <dcterms:format>106041</dcterms:format>
                <dcterms:format>Article</dcterms:format>
                <dcterms:identifier>/unibl/sci/idNaucniRad:28187</dcterms:identifier>
                <dcterms:identifier xsi:type="dcterms:URI" title="info:doi/https://doi.org/10.1016/j.ipl.2020.106041">https://dx.doi.org/https://doi.org/10.1016/j.ipl.2020.106041</dcterms:identifier>
                <dcterms:relation xsi:type="dcterms:URI" title="Природно-математички факултет">https://pmf.unibl.org</dcterms:relation>
                <dcterms:relation>INFORMATION PROCESSING LETTERS</dcterms:relation>
                <dcterms:relation>0020-0190</dcterms:relation>
                <dcterms:isPartOf>INFORMATION PROCESSING LETTERS</dcterms:isPartOf>
                <dcterms:isPartOf>0020-0190</dcterms:isPartOf>
                <dcterms:bibliographicCitation>M. Đukanović, C. Berger, G. Raidl, C. Blum, An A* search algorithm for the constrained longest common subsequence problem, INFORMATION PROCESSING LETTERS, Vol. 166, pp. Article - 106041, Feb, 2021</dcterms:bibliographicCitation>
              </xmlData>
            </mdWrap>
          </dmdSec>
          <structMap>
            <div DMDID="dmd-37699"/>
          </structMap>
        </mets>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>