RESUMEN

We report a novel method to synthesize degradable poly(vinyl ether)s with cleavable thioacetal bonds periodically arranged in the main chains using controlled cationic copolymerization of vinyl ethers with a 7-membered cyclic thioacetal (7-CTA) via degenerative chain transfer (DT) to the internal thioacetal bonds. The thioacetal bonds, which are introduced into the main chain by cationic ring-opening copolymerization of 7-CTA with vinyl ethers, serve as in-chain dormant species to allow homogeneous propagation of vinyl ethers for all internal segments to afford copolymers with controlled overall and segmental molecular weights. The obtained polymers can be degraded into low- and controlled-molecular-weight polymers with narrow molecular weight distributions via hydrolysis. Various vinyl ethers with hydrophobic, hydrophilic, and functional pendants are available. Finally, one-pot synthesis of multiblock copolymers and their degradation into diblock copolymers are also achieved.

RESUMEN

Phylogenetic networks are used in biology to represent evolutionary histories. The class of orchard phylogenetic networks was recently introduced for their computational benefits, without any biological justification. Here, we show that orchard networks can be interpreted as trees with additional horizontal arcs. Therefore, they are closely related to tree-based networks, where the difference is that in tree-based networks the additional arcs do not need to be horizontal. Then, we use this new characterization to show that the space of orchard networks on n leaves with k reticulations is connected under the rNNI rearrangement move with diameter [Formula: see text].

Asunto(s)

RESUMEN

Phylogenetic networks can represent evolutionary events that cannot be described by phylogenetic trees. These networks are able to incorporate reticulate evolutionary events such as hybridization, introgression, and lateral gene transfer. Recently, network-based Markov models of DNA sequence evolution have been introduced along with model-based methods for reconstructing phylogenetic networks. For these methods to be consistent, the network parameter needs to be identifiable from data generated under the model. Here, we show that the semi-directed network parameter of a triangle-free, level-1 network model with any fixed number of reticulation vertices is generically identifiable under the Jukes-Cantor, Kimura 2-parameter, or Kimura 3-parameter constraints.

Asunto(s)

RESUMEN

A common problem in phylogenetics is to try to infer a species phylogeny from gene trees. We consider different variants of this problem. The first variant, called Unrestricted Minimal Episodes Inference, aims at inferring a species tree based on a model with speciation and duplication where duplications are clustered in duplication episodes. The goal is to minimize the number of such episodes. The second variant, Parental Hybridization, aims at inferring a species network based on a model with speciation and reticulation. The goal is to minimize the number of reticulation events. It is a variant of the well-studied Hybridization Number problem with a more generous view on which gene trees are consistent with a given species network. We show that these seemingly different problems are in fact closely related and can, surprisingly, both be solved in polynomial time, using a structure we call "beaded trees". However, we also show that methods based on these problems have to be used with care because the optimal species phylogenies always have a restricted form. To mitigate this problem, we introduce a new variant of Unrestricted Minimal Episodes Inference that minimizes the duplication episode depth. We prove that this new variant of the problem can also be solved in polynomial time.

RESUMEN

Network reconstruction lies at the heart of phylogenetic research. Two well-studied classes of phylogenetic networks include tree-child networks and level-k networks. In a tree-child network, every non-leaf node has a child that is a tree node or a leaf. In a level-k network, the maximum number of reticulations contained in a biconnected component is k. Here, we show that level-k tree-child networks are encoded by their reticulate-edge-deleted subnetworks, which are subnetworks obtained by deleting a single reticulation edge, if [Formula: see text]. Following this, we provide a polynomial-time algorithm for uniquely reconstructing such networks from their reticulate-edge-deleted subnetworks. Moreover, we show that this can even be done when considering subnetworks obtained by deleting one reticulation edge from each biconnected component with k reticulations.

Asunto(s)

RESUMEN

In March 2011, the Fukushima Daiichi Nuclear Power Plant accident caused nuclear fuel to melt and the release of high-volatility fission products into the environment. Caesium and iodine caused environmental contamination and public exposure. Certain fission-product behaviours remain unclear. We found experimentally that liquid CsI disperses extremely favourably toward solid UO2, exhibiting a contact angle approaching zero. We further observed the presence of CsI several tens of micrometres below the surface of the solid UO2 sample, which would be caused by the infiltration of pores network by liquid CsI. Thus, volatile fission products released from molten nuclear fuels with complex internal composition and external structure migrate or evaporate to varying extents, depending on the nature of the solid-liquid interface and the fuel material surface, which becomes the pathway for the released fission products. Introducing the concept of the wettability of liquid chemical species of fission products in contact with solid fuels enabled developing accurate behavioural assessments of volatile fission products released by nuclear fuel.

RESUMEN

In order to reduce the time and effort of the daily task of refilling Dewar vessels of Ge detectors with liquid nitrogen (LN(2)), we have developed an automatic LN(2) filling system equipped with a LN(2) plant. With this system, we were freed from the work of LN(2) filling. Such an LN(2) filling system is useful for moderate-scale Ge detector arrays consisting of fewer than 20 Ge detectors.