BACKGROUND/AIM   Intrusive luxation in the permanent dentition is an uncommon injury but it is considered one of the most severe types of dental trauma because of the risk for damage to the periodontal ligament, pulp and alveolar bone. Management of intrusive luxation in the permanent dentition is controversial. The purpose of this study was to evaluate pulp survival and periodontal healing in ...

APEX nuclease is a mammalian DNA repair enzyme having apurinic/apyrimidinic (AP) endonuclease, 3'-5'-exonuclease, DNA 3' repair diesterase and DNA 3'-phosphatase activities. It is also a redox factor (Ref-1), stimulating DNA binding activity of AP-1 binding proteins such as Fos and Jun. In the present paper, a cDNA for the enzyme was isolated from a rat brain cDNA library using mouse Apex cDNA ...

Abstract Apex predators are threatened globally, and their local extinctions often driven by failures in sustaining prey acquisition under contexts of severe scarcity. The harpy eagle Harpia harpyja is Earth’s largest the apex aerial predator Amazonian forests, but no previous study has examined impact forest loss on feeding ecology. We monitored 16 active nests embedded within landscapes that ...

DNA repair is required to maintain genome stability in stem cells and early embryos. At critical junctures, oxidative damage to DNA requires the base excision repair (BER) pathway. Since early zebrafish embryos lack the major polymerase in BER, DNA polymerase ß, repair proceeds via replicative polymerases, even though there is ample polb mRNA. Here, we report that Polb protein fails to appear a...

Baker [1] devised a powerful technique to obtain approximation schemes for various problems restricted to planar graphs. Her technique can be directly extended to various other graph classes, among the most general ones the graphs avoiding a fixed apex graph as a minor. Further generalizations (e.g., to all proper minor closed graph classes) are known, but they use a combination of techniques a...

A graph G is an apex graph if it contains a vertex w such that G − w is a planar graph. It is easy to see that the genus g(G) of the apex graph G is bounded above by τ − 1, where τ is the minimum face cover of the neighbors of w, taken over all planar embeddings of G−w. The main result of this paper is the linear lower bound g(G) ≥ τ/160 (if G − w is 3-connected and τ > 1). It is also proved th...