<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-3.xsd">
  <mods>
    <titleInfo>
      <title>Fast computation of minimum hybridization networks</title>
    </titleInfo>
    <name type="personnal">
      <namePart type="family">Albrecht</namePart>
      <namePart type="given">B.</namePart>
      <role>
        <roleTerm type="text">auteur</roleTerm>
        <roleTerm type="code" authority="marcrelator">aut</roleTerm>
      </role>
      <affiliation>IRD</affiliation>
    </name>
    <name type="personnal">
      <namePart type="family">Scornavacca</namePart>
      <namePart type="given">C.</namePart>
      <role>
        <roleTerm type="text">auteur</roleTerm>
        <roleTerm type="code" authority="marcrelator">aut</roleTerm>
      </role>
      <affiliation>IRD</affiliation>
    </name>
    <name type="personnal">
      <namePart type="family">Cenci</namePart>
      <namePart type="given">Alberto</namePart>
      <role>
        <roleTerm type="text">auteur</roleTerm>
        <roleTerm type="code" authority="marcrelator">aut</roleTerm>
      </role>
      <affiliation>IRD</affiliation>
    </name>
    <name type="personnal">
      <namePart type="family">Huson</namePart>
      <namePart type="given">D. H.</namePart>
      <role>
        <roleTerm type="text">auteur</roleTerm>
        <roleTerm type="code" authority="marcrelator">aut</roleTerm>
      </role>
      <affiliation>IRD</affiliation>
    </name>
    <typeOfResource>text</typeOfResource>
    <genre authority="local">journalArticle</genre>
    <language>
      <languageTerm type="code" authority="iso639-2b">eng</languageTerm>
    </language>
    <abstract>Results: We describe how to compute a representative set of minimum hybridization networks for two given bifurcating input trees, using a parallel algorithm and provide a user-friendly implementation. A simulation study suggests that our program performs significantly better than existing software on biologically relevant data. Finally, we demonstrate the application of such methods in the context of the evolution of the Aegilops/Triticum genera.</abstract>
    <targetAudience authority="marctarget">specialized</targetAudience>
    <classification authority="local">020</classification>
    <classification authority="local">122</classification>
    <relatedItem type="host">
      <titleInfo>
        <title>Bioinformatics</title>
      </titleInfo>
      <part>
        <detail type="volume">
          <number>28</number>
        </detail>
        <detail type="volume">
          <number>2</number>
        </detail>
        <extent unit="pages">
          <list> 191-197</list>
        </extent>
      </part>
      <originInfo>
        <dateIssued>2012</dateIssued>
      </originInfo>
      <identifier type="issn">1367-4803</identifier>
    </relatedItem>
    <identifier type="uri">https://www.documentation.ird.fr/hor/PAR00008479</identifier>
    <identifier type="doi">10.1093/bioinformatics/btr618</identifier>
    <identifier type="issn">1367-4803</identifier>
    <location>
      <url usage="primary display" access="object in context">https://www.documentation.ird.fr/hor/PAR00008479</url>
    </location>
    <recordInfo>
      <recordContentSource>IRD - Base Horizon / Pleins textes</recordContentSource>
      <recordCreationDate encoding="w3cdtf">2012-03-07</recordCreationDate>
      <recordChangeDate encoding="w3cdtf">2017-08-23</recordChangeDate>
      <recordIdentifier>PAR00008479</recordIdentifier>
      <languageOfCataloging>
        <languageTerm authority="iso639-2b">fre</languageTerm>
      </languageOfCataloging>
    </recordInfo>
  </mods>
</modsCollection>
