47,788 research outputs found
Evolution of the G+C content frontier in the rat cytomegalovirus genome
No full textWithin the 230138 bp of the rat cytomegalovirus (RCMV) genome, the G+C content changes abruptly at position 142644, constituting a G+C content frontier. To the left of this point, overall G+C content is 69.2%, and to the right it is only 47.6%. A region of extremely low G+C content (33.8%) is found in the 5 kb immediately to the right of the frontier, in which there are no predicted coding sequences. To the right of position 147501, the G+C content rises and predicted coding sequences reappear. However, these genes are much shorter (average 848bp, 50% G+C) than those in the left two-thirds of the genome (average 1462bp, 70% G+C). Whole genome alignment of several viruses indicates that the initial ultra-low G+C region appeared in the common ancestor of the genera Cytomegalovirus and Muromegalovirus, and that the lowering of G+C in the right third has been a subsequent process in the lineage leading to RCMV. The left two-thirds of RCMV has stop codon occurrences at 67.5% of their expected level, based on a modified Markov chain model of stop codon distribution, and the corresponding figure for the right third is 78%. Therefore, despite heavy mutation pressure, selective constraint has operated in the right third of the RCMV genome to maintain a degree of gene length unusual for such low G+C sequences
FIGURE 1. Myristica beddomei subsp. beddomei A. Twig with leaves and fruit. B. Male inflorescence. C. Female inflorescence. D. Male flower. E. Androecium, exposed. F. Female flower. G. Gynoecium exposed. H. Fruits. I. Arillate seed. J in Status of the subspecies of Myristica beddomei (Myristicaceae), endemic to the Western Ghats, India
No full textFIGURE 1. Myristica beddomei subsp. beddomei A. Twig with leaves and fruit. B. Male inflorescence. C. Female inflorescence. D. Male flower. E. Androecium, exposed. F. Female flower. G. Gynoecium exposed. H. Fruits. I. Arillate seed. J. Bark exudate.Published as part of Govind, Murugan Govindakurup & Dan, Mathew, 2022, Status of the subspecies of Myristica beddomei (Myristicaceae), endemic to the Western Ghats, India, pp. 261-269 in Phytotaxa 541 (3) on page 264, DOI: 10.11646/phytotaxa.541.3.5, http://zenodo.org/record/639264
On the Kernel and Related Problems in Interval Digraphs
No full textGiven a digraph G, a set X ⊆ V(G) is said to be an absorbing set (resp. dominating set) if every vertex in the graph is either in X or is an in-neighbour (resp. out-neighbour) of a vertex in X. A set S ⊆ V(G) is said to be an independent set if no two vertices in S are adjacent in G. A kernel (resp. solution) of G is an independent and absorbing (resp. dominating) set in G. The problem of deciding if there is a kernel (or solution) in an input digraph is known to be NP-complete. Similarly, the problems of computing a minimum cardinality kernel, absorbing set (or dominating set) and the problems of computing a maximum cardinality kernel, independent set are all known to be NP-hard for general digraphs. We explore the algorithmic complexity of these problems in the well known class of interval digraphs. A digraph G is an interval digraph if a pair of intervals (S_u,T_u) can be assigned to each vertex u of G such that (u,v) ∈ E(G) if and only if S_u ∩ T_v ≠ ∅. Many different subclasses of interval digraphs have been defined and studied in the literature by restricting the kinds of pairs of intervals that can be assigned to the vertices. We observe that several of these classes, like interval catch digraphs, interval nest digraphs, adjusted interval digraphs and chronological interval digraphs, are subclasses of the more general class of reflexive interval digraphs - which arise when we require that the two intervals assigned to a vertex have to intersect. We see as our main contribution the identification of the class of reflexive interval digraphs as an important class of digraphs. We show that all the problems mentioned above are efficiently solvable, in most of the cases even linear-time solvable, in the class of reflexive interval digraphs, but are APX-hard on even the very restricted class of interval digraphs called point-point digraphs, where the two intervals assigned to each vertex are required to be degenerate, i.e. they consist of a single point each. The results we obtain improve and generalize several existing algorithms and structural results for reflexive interval digraphs. We also obtain some new results for undirected graphs along the way: (a) We get an O(n(n+m)) time algorithm for computing a minimum cardinality (undirected) independent dominating set in cocomparability graphs, which slightly improves the existing O(n³) time algorithm for the same problem by Kratsch and Stewart; and (b) We show that the Red Blue Dominating Set problem, which is NP-complete even for planar bipartite graphs, is linear-time solvable on interval bigraphs, which is a class of bipartite (undirected) graphs closely related to interval digraphs
Cubicity, Degeneracy, and Crossing Number
No full textA k-box B=(R_1,R_2,...,R_k), where each R_i is a closed interval on the real line, is defined to be the Cartesian product R_1 X R_2 X ... X R_k. If each R_i is a unit length interval, we call B a k-cube. Boxicity of a graph G, denoted as box(G), is the minimum integer k such that G is an intersection graph of k-boxes. Similarly, the cubicity of G, denoted as cub(G), is the minimum integer k such that G is an intersection graph of k-cubes.
It was shown in [L. Sunil Chandran, Mathew C. Francis, and Naveen Sivadasan. Representing graphs as the intersection of axis-parallel cubes. MCDES-2008, IISc Centenary Conference, available at CoRR, abs/cs/0607092, 2006.] that, for a graph G with maximum degree \Delta, cub(G) <= \lceil 4(\Delta +1) ln n\rceil. In this paper we show that, for a k-degenerate graph G, cub(G) <= (k+2) \lceil 2e log n \rceil. Since k is at most \Delta and can be much lower, this clearly is a stronger result. We also give an efficient deterministic algorithm that runs in O(n^2k) time to output a 8k(\lceil 2.42 log n\rceil + 1) dimensional cube representation for G.
The crossing number of a graph G, denoted as CR(G), is the minimum number of crossing pairs of edges, over all drawings of G in the plane. An important consequence of the above result is that if the crossing number of a graph G is t, then box(G) is O(t^{1/4}{\lceil log t\rceil}^{3/4}) . This bound is tight upto a factor of O((log t)^{3/4}).
Let (P,\leq) be a partially ordered set and let G_{P} denote its underlying comparability graph. Let dim(P) denote the poset dimension of P. Another interesting consequence of our result is to show that dim(P) \leq 2(k+2) \lceil 2e \log n \rceil, where k denotes the degeneracy of G_{P}. Also, we get a deterministic algorithm that runs in O(n^2k) time to construct a 16k(\lceil 2.42 log n\rceil + 1) sized realizer for P. As far as we know, though very good upper bounds exist for poset dimension in terms of maximum degree of its underlying comparability graph, no upper bounds in terms of the degeneracy of the underlying comparability graph is seen in the literature
Correction to: The role of resection in hepatocellular carcinoma BCLC stage B: A multi-institutional patient-level meta-analysis and systematic review (Langenbeck's Archives of Surgery, (2024), 409, 1, (277), 10.1007/s00423-024-03466-x)
No full textCorrection to: Langenbeck’s Archives of Surgery (2024) 409:277. https://doi.org/10.1007/s00423-024-03466-x. This article unfortunately contained a mistake. The author name ‘Mathew Vithayathil’ was incorrectly written as ‘Vithayathil Mathew K.’. The original article has been corrected
Erratum to: Effect of moderate red wine intake on cardiac prognosis after recent acute myocardial infarction of subjects with Type 2 diabetes mellitus (Diabetic Medicine, (2006), 23, 9, (974-981), 10.1111/j.1464-5491.2006.01886.x)
No full textIn an article by Marfella et al, the author name C. Saron is incorrect and should be listed as C. Sardu. Therefore the correct author list is: R. Marfella, F. Cacciapuoti, M. Siniscalchi, F. C. Sasso, F. Marchese, F. Cinone, E. Musacchio, M. A. Marfella, L. Ruggiero, G. Chiorazzo, D. Liberti, G. Chiorazzo, G. F. Nicoletti, C. Sardu, F. D'Andrea, C. Ammendola, M. Verza and L. Coppola.In an article by Marfella et al, the author name C. Saron is incorrect and should be listed as C. Sardu. Therefore the correct author list is: R. Marfella, F. Cacciapuoti, M. Siniscalchi, F. C. Sasso, F. Marchese, F. Cinone, E. Musacchio, M. A. Marfella, L. Ruggiero, G. Chiorazzo, D. Liberti, G. Chiorazzo, G. F. Nicoletti, C. Sardu, F. D'Andrea, C. Ammendola, M. Verza and L. Coppola
A new and accurate map of New South Wales [cartographic material] with Norfolk and Lord Howe's Islands Port Jackson &c. from actual surveys /
No full textEngraved map of the East coast of Australia from the Furneaux Islands to Endeavour Islands, and of the South Pacific Ocean and islands including the Solomon Islands and New Caledonia.; Insets: Ld. Howe's Island. Scale [ca. 1:250 000] -- An accurate survey of Norfolk Island. Scale [ca. 1:50 000] -- Port Jackson, Botany Bay &c. Scale ca.1:600 000.; Plate 55 from: Carey's General atlas. Philadelphia : M. Carey and Son, 1817.; Philips, 4311.; Tooley, Printed maps of New South Wales 1773-1873 (Map Collectors Circle no. 44), 32.Carey's General atla
Measurement of the ratio of prompt χ c to J / ψ production in pp collisions at √s = 7 TeV
No full textThe prompt production of charmonium χ c and J / ψ states is studied in proton-proton collisions at a centre-of-mass energy of √s = 7 TeV at the Large Hadron Collider. The χ c and J / ψ mesons are identified through their decays χ c → J / ψ γ and J / ψ → μ + μ - using 36 pb - 1 of data collected by the LHCb detector in 2010. The ratio of the prompt production cross-sections for χ c and J / ψ, σ (χ c → J / ψ γ) / σ (J / ψ), is determined as a function of the J / ψ transverse momentum in the range 2 < p T J / ψ < 15 GeV / c. The results are in excellent agreement with next-to-leading order non-relativistic expectations and show a significant discrepancy compared with the colour singlet model prediction at leading order, especially in the low p T J / ψ region
The two-loop QCD correction to massive spin-2 resonance → qq ̄ g
No full textThe two-loop QCD correction to massive spin-2 graviton decaying to q+ q ̄ + g is presented considering a generic universal spin-2 coupling to the SM through the conserved energy-momentum tensor. Such a massive spin-2 particle can arise in extra-dimensional models. The ultraviolet and infrared structure of the QCD amplitudes are studied. In dimensional regularization, the infrared pole structure is in agreement with Catani’s proposal, confirming the universal factorization property of QCD amplitudes, even with the spin-2 tensorial coupling
Mutation analysis of the Fanconi Anaemia group A, C, E, F and G genes in sporadic acute myeloid leukaemia
No full text- …
