Abstract Study question Is the behavior of second polar body (PBII) associated with subsequent human embryonic development? Summary answer Human zygotes morphologically static PBII showed significantly higher rates good quality embryos and utilization than showing various behaviors. What is known already In recent years, time-lapse incubators have become widely available, enabling continuous ob...

So, we have (1.2) p1p2 · · · pn < (pn 2 )n (n ≥ 9), where also holds true by computation for 5 ≤ n ≤ 8. In other hand, one can get a trivial lower bound for that product using Euclid’s proof of infinity of primes; Letting En = p1p2 · · · pn−1 for every n ≥ 2, it is clear that pn < En. So, if pn < En < pn+1 then En should has a prime factor among p1, p2, · · · , pn which isn’t possible. Thus En ...

Gene targeting by homologous recombination in embryonic stem cells is extensively used to generate specific mouse mutants. However, most mammalian species lack tools for targeted gene manipulation. Since double-strand breaks strongly increase the rate of homologous recombination at genomic loci, we explored whether gene targeting can be directly performed in zygotes by the use of zinc-finger nu...

The effect of shifting zygotes from a rich medium into a poor medium (shift-down) on the frequency of recombination has been examined; our results suggest that protein syntheses other than those required for growth may be involved. Experiments with chloramphenicol support this notion, and further suggest that there is a competition between genetic integration and degradation in the recipient ce...

Deletions, duplications, and inversions of large genomic regions covering several genes are an important class of disease causing variants in humans. Modeling these structural variants in mice requires multistep processes in ES cells, which has limited their availability. Mutant mice containing small insertions, deletions, and single nucleotide polymorphisms can be reliably generated using CRIS...

Proof-Number (PN) search is a best-first adversarial search algorithm especially suited for finding the game-theoretical value in game trees. The strategy of the algorithm may be described as developing the tree into the direction where the opposition characterised by value and branching factor is to expect to be the weakest. In this chapter we start by providing a short description of the orig...