<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">397500114</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20180308164530.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">161202s1995    xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1093/imammb/12.1.13</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)oxford-10.1093/imammb/12.1.13</subfield>
  </datafield>
  <datafield tag="100" ind1="1" ind2=" ">
   <subfield code="a">HARBRON</subfield>
   <subfield code="D">CHRIS</subfield>
   <subfield code="u">Biomathematics and Statistics Scotland, Rowett Research Institute, Bucksburn, Aberdeen AB2 9SB, Scotland, UK</subfield>
  </datafield>
  <datafield tag="245" ind1="1" ind2="2">
   <subfield code="a">A pedigree-based algorithm for finding efficient peeling sequences</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[CHRIS HARBRON]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">The computational cost, in terms of both storage requirements and calculation required, of performing an elimination ordering on a graph is considered as a function of the order in which the vertices of the moral graph are eliminated. Useful properties of the moral graph of a pedigree with respect to vertex elimination are observed and these properties extended to define a k-pedigree as a graph permitting allocation of one of k sexes to each vertex of the graph, such that the subgraph induced by vertices of a single six contains no cycles. Properties of k-pedigrees include an upper bound of 2k on clique size. A novel algorithm, SEXY, based upon these properties is proposed and its performance compared with other algorithms used to generate elimination sequences. It is found to give a widely dispersed range of sequences, including some sequences requiring under a quarter of the storage and under a half of the computational time than had previously been found using standard methods.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">© Oxford University Press</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Articles</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">probabilistic networks</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">pedigree analysis</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">graph colouring</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">peeling</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">graph triangulation</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">elimination orderings</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">Mathematical Medicine and Biology</subfield>
   <subfield code="d">Oxford University Press</subfield>
   <subfield code="g">12/1(1995), 13-27</subfield>
   <subfield code="x">1477-8599</subfield>
   <subfield code="q">12:1&lt;13</subfield>
   <subfield code="1">1995</subfield>
   <subfield code="2">12</subfield>
   <subfield code="o">imammb</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1093/imammb/12.1.13</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="908" ind1=" " ind2=" ">
   <subfield code="D">1</subfield>
   <subfield code="a">research-article</subfield>
   <subfield code="2">jats</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">856</subfield>
   <subfield code="E">40</subfield>
   <subfield code="u">https://doi.org/10.1093/imammb/12.1.13</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">100</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">HARBRON</subfield>
   <subfield code="D">CHRIS</subfield>
   <subfield code="u">Biomathematics and Statistics Scotland, Rowett Research Institute, Bucksburn, Aberdeen AB2 9SB, Scotland, UK</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">773</subfield>
   <subfield code="E">0-</subfield>
   <subfield code="t">Mathematical Medicine and Biology</subfield>
   <subfield code="d">Oxford University Press</subfield>
   <subfield code="g">12/1(1995), 13-27</subfield>
   <subfield code="x">1477-8599</subfield>
   <subfield code="q">12:1&lt;13</subfield>
   <subfield code="1">1995</subfield>
   <subfield code="2">12</subfield>
   <subfield code="o">imammb</subfield>
  </datafield>
  <datafield tag="900" ind1=" " ind2="7">
   <subfield code="a">Metadata rights reserved</subfield>
   <subfield code="b">CC BY-NC-4.0</subfield>
   <subfield code="u">http://creativecommons.org/licenses/by-nc/4.0</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="898" ind1=" " ind2=" ">
   <subfield code="a">BK010053</subfield>
   <subfield code="b">XK010053</subfield>
   <subfield code="c">XK010000</subfield>
  </datafield>
  <datafield tag="949" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="F">NATIONALLICENCE</subfield>
   <subfield code="b">NL-oxford</subfield>
  </datafield>
 </record>
</collection>
