<?xml version="1.0" encoding="UTF-8"?>
<collection>
<dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" 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:identifier>doi:10.1007/978-3-319-56154-7_20</dc:identifier><dc:language>eng</dc:language><dc:creator>Alcalde Cuesta, Fernando</dc:creator><dc:creator>González Sequeiros, Pablo</dc:creator><dc:creator>Lozano Rojo, Álvaro</dc:creator><dc:creator>Vigara Benito, Rubén</dc:creator><dc:title>An accurate database of the fixation probabilities for all undirected graphs of order 10 or less</dc:title><dc:identifier>ART-2017-99192</dc:identifier><dc:description>We present a extremely precise database of the fixation probabilities of mutant individuals in a non-homogeneous population which are spatially arranged on a small graph. We explore what features of a graph increase the chances of a beneficial allele of a gene to spread over a structured population.</dc:description><dc:date>2017</dc:date><dc:source>http://zaguan.unizar.es/record/131158</dc:source><dc:doi>10.1007/978-3-319-56154-7_20</dc:doi><dc:identifier>http://zaguan.unizar.es/record/131158</dc:identifier><dc:identifier>oai:zaguan.unizar.es:131158</dc:identifier><dc:relation>info:eu-repo/grantAgreement/ES/MICINN/MTM2013-45710-C2</dc:relation><dc:relation>info:eu-repo/grantAgreement/ES/MICINN/MTM2013-46337-C2-2-P</dc:relation><dc:relation>info:eu-repo/grantAgreement/ES/UZ/CUD2015-10</dc:relation><dc:identifier.citation>Lecture Notes in Computer Science 10209 (2017), 209-220</dc:identifier.citation><dc:rights>All rights reserved</dc:rights><dc:rights>http://www.europeana.eu/rights/rr-f/</dc:rights><dc:rights>info:eu-repo/semantics/openAccess</dc:rights></dc:dc>

</collection>