نتایج جستجو برای: apex
تعداد نتایج: 12022 فیلتر نتایج به سال:
Introduction: Mental foramen is an important landmark in mandible and knowledge regarding the actual location of mental foramen is important in dentistry. Materials &Methods: A total of 1172 digital panoramic radiographs were evaluated for assessment of the location of the mental foramen. The location was classified into six groups in relation to the apices of the premolars and first molar. R...
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 ...
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...
Objective: Knowledge about the internal anatomy of the root canal and apical foramen is a critical prerequisite for root canal therapy and is necessary for the success of endodontic treatment. This study aimed to determine the distance of apical foramen from the anatomical apex and apical constriction, evaluate the deviation of apical foramen from the anatomical apex and specify the most common...
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...
This open-access article is distributed under the terms of the Creative Commons Attribution Non-Commercial License (CC BY-NC) (http:// creativecommons.org/licenses/by-nc/4.0/), which permits reuse, distribution and reproduction of the article, provided that the original work is properly cited and the reuse is restricted to noncommercial purposes. For commercial reuse, contact [email protected]...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید