22 research outputs found

    Mapping and identification of candidate loci responsible for Peromyscus hybrid overgrowth

    Get PDF
    Crosses between two recently diverged rodent species of the genus Peromyscus result in dramatic parent-of-origin effects on growth and development. P. maniculatus females crossed with P. polionotus males yield growth-retarded conceptuses, whereas the reciprocal cross results in overgrowth and lethality. These hybrid effects are particularly pronounced in the placenta. We previously detected linkage to two regions of the genome involved in the overgrowth effects. One locus, termed Peal, is a paternally expressed autosomal locus mapping to a domain whose house mouse equivalent contains several clusters of imprinted genes. The other locus, termed Mexl, maps to a gene-poor region of the X chromosome. Here we use an advanced intercross line to verify and narrow the regions of linkage and identify candidate genes for Mexl and Peal. While we have previously shown that Mexl affects both pre-and postnatal growth, we show here that Peal affects only prenatal growth. Utilizing criteria such as mutant phenotypes and allelic expression, we identify the loci encoding the homeobox protein Esx1 and the zinc-finger protein Pw1/Peg3 as candidates. Both loci exhibit expression changes in the hybrids

    Driver mutations of cancer epigenomes

    Get PDF

    Constraint Games for stable and optimal allocation of demands in SDN

    No full text
    Software Defined Networking (or SDN) allows to apply a centralized control over a network of commuters in order to provide better global performances. One of the problem to solve is the multicommodity flow routing where a set of demands have to be routed at minimum cost. In contrast with other versions of this problem, we consider here problems with congestion that change the cost of a link according to the capacity used. We propose here to study centralized routing with Constraint Programming and Column Generation approaches. Furthermore, selfish routing is studied through with Constraint Games. Selfish routing is important for the perceived quality of the solution since no user is able to improve his cost by changing only his own path. We present real and synthetic benchmarks that show a good scalability
    corecore