<?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-08-10T02:31:13Z</responseDate>
  <request identifier="792" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:792</identifier>
        <datestamp>2024-03-06T11:06:53Z</datestamp>
        <setSpec>ddc:004</setSpec>
        <setSpec>open_access</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>06201 Executive Summary – Combinatorial and Algorithmic Foundations of Pattern and Association Discovery</dc:title>
          <dc:creator>Ahlswede, Rudolf</dc:creator>
          <dc:creator>Apostolico, Alberto</dc:creator>
          <dc:creator>Levenshtein, Vladimir I.</dc:creator>
          <dc:subject>Data compression</dc:subject>
          <dc:subject>pattern matching</dc:subject>
          <dc:subject>pattern discovery</dc:subject>
          <dc:subject>search</dc:subject>
          <dc:subject>sorting</dc:subject>
          <dc:subject>molecular biology</dc:subject>
          <dc:subject>reconstruction</dc:subject>
          <dc:subject>genome rearrangements</dc:subject>
          <dc:description>The goals of this seminar have been (1) to identify and match&#13;
recently developed methods to specific tasks and data sets in a core of&#13;
application areas; next, based on feedback from the specific applied domain,&#13;
(2) to fine tune and personalize those applications, and finally (3) to&#13;
identify and tackle novel combinatorial and algorithmic problems, in some&#13;
cases all the way to the development of novel software tools.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Rudolf Ahlswede and Alberto Apostolico and Vladimir I. Levenshtein</dc:contributor>
          <dc:date>2006</dc:date>
          <dc:relation>Is Part Of Dagstuhl Seminar Proceedings, Volume 6201, Combinatorial and Algorithmic Foundations of Pattern and Association Discovery (2006)</dc:relation>
          <dc:type>InProceedings</dc:type>
          <dc:type>Text</dc:type>
          <dc:type>doc-type:ResearchArticle</dc:type>
          <dc:type>publishedVersion</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>doi:10.4230/DagSemProc.06201.2</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-7926</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.06201.2</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by/4.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
