<?xml version="1.0" encoding="utf-8"?>
<TEI xmlns="http://www.tei-c.org/ns/1.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:hal="http://hal.archives-ouvertes.fr/" xmlns:gml="http://www.opengis.net/gml/3.3/" xmlns:gmlce="http://www.opengis.net/gml/3.3/ce" version="1.1" xsi:schemaLocation="http://www.tei-c.org/ns/1.0 http://api.archives-ouvertes.fr/documents/aofr-sword.xsd">
  <teiHeader>
    <fileDesc>
      <titleStmt>
        <title>HAL TEI export of hal-00306620</title>
      </titleStmt>
      <publicationStmt>
        <distributor>CCSD</distributor>
        <availability status="restricted">
          <licence target="https://creativecommons.org/publicdomain/zero/1.0/">CC0 1.0 - Universal</licence>
        </availability>
        <date when="2026-05-14T23:59:10+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Optimal mappings with minimun number of connected components in tree-to-tree comparison problems</title>
            <author role="aut">
              <persName>
                <forename type="first">Pascal</forename>
                <surname>Ferraro</surname>
              </persName>
              <email type="md5">3d82a968bb80ae606515cd13ce1db913</email>
              <email type="domain">labri.fr</email>
              <idno type="idhal" notation="string">pascal-ferraro</idno>
              <idno type="idhal" notation="numeric">6439</idno>
              <idno type="halauthorid" notation="string">312219-6439</idno>
              <idno type="IDREF">https://www.idref.fr/058613277</idno>
              <affiliation ref="#struct-3102"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Christophe</forename>
                <surname>Godin</surname>
              </persName>
              <email type="md5">310d55ee31ee4be07aaf8eac1baf7d14</email>
              <email type="domain">inria.fr</email>
              <idno type="idhal" notation="string">christophe-godin</idno>
              <idno type="idhal" notation="numeric">1509</idno>
              <idno type="halauthorid" notation="string">8019-1509</idno>
              <idno type="RESEARCHERID">http://www.researcherid.com/rid/C-1218-2008</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-1202-8460</idno>
              <idno type="IDREF">https://www.idref.fr/100750958</idno>
              <idno type="RESEARCHERID">http://www.researcherid.com/rid/http://www.researcherid.com/rid/C-1218-2008</idno>
              <orgName ref="#struct-300009"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Pascal</forename>
                <surname>Ferraro</surname>
              </persName>
              <email type="md5">3d82a968bb80ae606515cd13ce1db913</email>
              <email type="domain">labri.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2008-12-01 16:13:03</date>
              <date type="whenWritten">2003</date>
              <date type="whenModified">2025-05-26 14:36:02</date>
              <date type="whenReleased">2008-12-19 22:45:15</date>
              <date type="whenProduced">2003</date>
              <date type="whenEndEmbargoed">2008-12-01</date>
              <ref type="file" target="https://hal.science/hal-00306620v1/document">
                <date notBefore="2008-12-01"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://hal.science/hal-00306620v1/file/view.pdf" id="file-306620-38811">
                <date notBefore="2008-12-01"/>
              </ref>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="128227">
                <persName>
                  <forename>Pascal</forename>
                  <surname>Ferraro</surname>
                </persName>
                <email type="md5">3d82a968bb80ae606515cd13ce1db913</email>
                <email type="domain">labri.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-00306620</idno>
            <idno type="halUri">https://hal.science/hal-00306620</idno>
            <idno type="halBibtex">ferraro:hal-00306620</idno>
            <idno type="halRefHtml">&lt;i&gt;Journal of Algorithms in Cognition, Informatics and Logic&lt;/i&gt;, 2003, 48, pp.385-406</idno>
            <idno type="halRef">Journal of Algorithms in Cognition, Informatics and Logic, 2003, 48, pp.385-406</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-306620-38811"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
            <idno type="stamp" n="ENSEIRB">Ecole Nationale Supérieure d'Electronique, Informatique et Radiocommunications de Bordeaux</idno>
            <idno type="stamp" n="UNIV-BORDEAUX">Université de Bordeaux</idno>
            <idno type="stamp" n="LABRI-MABIOVIS" corresp="LABRI">Modèles et algorithmes pour la bioinformatique et la visualisation d'informations</idno>
            <idno type="stamp" n="INRIA-300009">Inria 300009</idno>
            <idno type="stamp" n="UNIVERSITE-BORDEAUX">Université de Bordeaux</idno>
          </seriesStmt>
          <notesStmt>
            <note type="audience" n="2">International</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">Optimal mappings with minimun number of connected components in tree-to-tree comparison problems</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Pascal</forename>
                    <surname>Ferraro</surname>
                  </persName>
                  <email type="md5">3d82a968bb80ae606515cd13ce1db913</email>
                  <email type="domain">labri.fr</email>
                  <idno type="idhal" notation="string">pascal-ferraro</idno>
                  <idno type="idhal" notation="numeric">6439</idno>
                  <idno type="halauthorid" notation="string">312219-6439</idno>
                  <idno type="IDREF">https://www.idref.fr/058613277</idno>
                  <affiliation ref="#struct-3102"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Christophe</forename>
                    <surname>Godin</surname>
                  </persName>
                  <email type="md5">310d55ee31ee4be07aaf8eac1baf7d14</email>
                  <email type="domain">inria.fr</email>
                  <idno type="idhal" notation="string">christophe-godin</idno>
                  <idno type="idhal" notation="numeric">1509</idno>
                  <idno type="halauthorid" notation="string">8019-1509</idno>
                  <idno type="RESEARCHERID">http://www.researcherid.com/rid/C-1218-2008</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-1202-8460</idno>
                  <idno type="IDREF">https://www.idref.fr/100750958</idno>
                  <idno type="RESEARCHERID">http://www.researcherid.com/rid/http://www.researcherid.com/rid/C-1218-2008</idno>
                  <orgName ref="#struct-300009"/>
                </author>
              </analytic>
              <monogr>
                <idno type="halJournalId" status="VALID">15052</idno>
                <idno type="issn">0196-6774</idno>
                <idno type="eissn">1090-2678</idno>
                <title level="j">Journal of Algorithms in Cognition, Informatics and Logic</title>
                <imprint>
                  <publisher>Elsevier</publisher>
                  <biblScope unit="volume">48</biblScope>
                  <biblScope unit="pp">385-406</biblScope>
                  <date type="datePub">2003</date>
                </imprint>
              </monogr>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <classCode scheme="halDomain" n="info.info-oh">Computer Science [cs]/Other [cs.OH]</classCode>
              <classCode scheme="halTypology" n="ART">Journal articles</classCode>
              <classCode scheme="halOldTypology" n="ART">Journal articles</classCode>
              <classCode scheme="halTreeTypology" n="ART">Journal articles</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>In this paper we consider the problem of finding a minimum cost mapping between two unordered trees which induces a graph with a minimum number of connected components. The proposed algorithm is based on the generalization of an algorithm for computing an edit distance between trees, and it solves the stated problem in sequential time precisely in O (|T1| x |T2| x (degT1 + deg T2) x log2 (deg T1 + deg T2)).</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="laboratory" xml:id="struct-3102" status="VALID">
          <idno type="IdRef">155054465</idno>
          <idno type="ISNI">0000000122898198</idno>
          <idno type="RNSR">199511665F</idno>
          <idno type="ROR">https://ror.org/03adqg323</idno>
          <idno type="Wikidata">Q3214395</idno>
          <orgName>Laboratoire Bordelais de Recherche en Informatique</orgName>
          <orgName type="acronym">LaBRI</orgName>
          <date type="start">1988-01-01</date>
          <desc>
            <address>
              <addrLine>Domaine Universitaire 351, cours de la Libération 33405 Talence Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.labri.fr</ref>
          </desc>
          <listRelation>
            <relation active="#struct-259761" type="direct"/>
            <relation active="#struct-300366" type="direct"/>
            <relation name="UMR5800 / URA1304" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-259761" status="VALID">
          <idno type="IdRef">175206562</idno>
          <idno type="ROR">https://ror.org/057qpr032</idno>
          <orgName>Université de Bordeaux</orgName>
          <orgName type="acronym">UB</orgName>
          <desc>
            <address>
              <addrLine>35, place Pey Berland - 33076 Bordeaux</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.u-bordeaux.fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-300366" status="VALID">
          <orgName>École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)</orgName>
          <desc>
            <address>
              <country key="FR"/>
            </address>
          </desc>
        </org>
        <org type="regroupinstitution" xml:id="struct-441569" status="VALID">
          <idno type="IdRef">02636817X</idno>
          <idno type="ISNI">0000000122597504</idno>
          <idno type="ROR">https://ror.org/02feahw73</idno>
          <orgName>Centre National de la Recherche Scientifique</orgName>
          <orgName type="acronym">CNRS</orgName>
          <date type="start">1939-10-19</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.cnrs.fr/</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>