Levonorgestrel intrauterine system in menorrhagia-an effective and acceptable alternative

Background: To study the efficacy, performance and acceptability of levonorgestrel intrauterine device (LNG-IUS) in treatment of women with menorrhagia.Methods: This was a descriptive, prospective and observational study conducted over a period of January 2015 to September 2020. Seventy-five (75) women presented with heavy menstrual bleeding having no contraindication for device underwent LNG-IUS insertion after consent. Menstrual pattern, pictorial blood loss assessment chart score (PBAC), rate of acceptability and satisfaction were recorded at 3 months, 6 months, 1, 2 and 3 years after insertion of LNG-IUS.Results: The most common bleeding pattern at 3 month post-insertion was inter-menstrual spotting followed by infrequent menses, oligomenorrhea and amenorrhea. LNG-IUS caused 45.19% reduction in menstrual blood loss (MBL) at 3 months, 81.48% at 1 year, 91.85% at 2 years and 97% at 3 years. Hemoglobin levels improved from mean baseline 8.9 mg/l to 12.8 mg/l at 3 years. Majority of women were satisfied with this minimally-invasive treatment with continuation rate of 94.66%. No major side-effects were noted.Conclusions: LNG-IUS is an excellent minimal invasive, highly effective in controlling blood loss and well-tolerated alternative for women with menorrhagia. Its fertility-sparing property makes it an emerging option for young women.

Tackling gynecological health problems in adolescent girls of rural India: need of the hour

Background: Adolescence is a transient and dynamic period characterised by several changes in the child’s body and mind. Onset of menarche is major physiological milestone in adolescent girls which is often associated with menstrual irregularities and other hormonal events. Aim of the present study was to evaluate the profile of adolescent girls attending the outpatient clinic.Methods: This hospital based cross-sectional, prospective, observational study was conducted at Bafna hospital from January 2019 to December 2020. We analysed 220 consecutive adolescent girls with gynaecological health issues. The data was collected and analysed using pre-designed questionnaire.Results: Menstrual disorders (64.5%) were most common followed by teenage pregnancies (20.9%). Other complaints included vulvar disorders, breast diseases, genital trauma, hirsuitism, UTI and psychological problems. Anemia (28.1%) and PCOS (30.9%) were also diagnosed. Hormonal treatment was offered to 59.5% girls whereas surgical intervention done in 4% for various indications.Conclusions: Menstrual disorders, teenage pregnancies, PCOS and anemia were the most common issues seen. Adolescent gynaecological problems are unique and specific regarding presentation, diagnosis and treatment options. It is important to tackle them on top priority due to its impact on future reproductive health

Hitting Diamonds and Growing Cacti

We consider the following NP-hard problem: in a weighted graph, find a minimum cost set of vertices whose removal leaves a graph in which no two cycles share an edge. We obtain a constant-factor approximation algorithm, based on the primal-dual method. Moreover, we show that the integrality gap of the natural LP relaxation of the problem is \Theta(\log n), where n denotes the number of vertices in the graph.Comment: v2: several minor changes

DNA methylation changes induced by long and short photoperiods in Nasonia

Many organisms monitor the annual change in day length and use this information for the timing of their seasonal response. However, the molecular mechanisms underlying photoperiodic timing are largely unknown. The wasp Nasonia vitripennis is an emerging model organism that exhibits a strong photoperiodic response: Short autumnal days experienced by females lead to the induction of developmental arrest (diapause) in their progeny, allowing winter survival of the larvae. How female Nasonia control the developmental trajectory of their offspring is unclear. Here, we took advantage of the recent discovery that DNA methylation is pervasive in Nasonia and tested its role in photoperiodism. We used reduced representation bisulfite sequencing (RRBS) to profile DNA methylation in adult female wasps subjected to different photoperiods and identified substantial differential methylation at the single base level. We also show that knocking down DNA methyltransferase 1a (Dnmt1a), Dnmt3, or blocking DNA methylation pharmacologically, largely disrupts the photoperiodic diapause response of the wasps. To our knowledge, this is the first example for a role of DNA methylation in insect photoperiodic timing

Emergence of hyperons in failed supernovae: trigger of the black hole formation

We investigate the emergence of strange baryons in the dynamical collapse of a non-rotating massive star to a black hole by the neutrino-radiation hydrodynamical simulations in general relativity. By following the dynamical formation and collapse of nascent proto-neutron star from the gravitational collapse of a 40Msun star adopting a new hyperonic EOS table, we show that the hyperons do not appear at the core bounce but populate quickly at ~0.5-0.7 s after the bounce to trigger the re-collapse to a black hole. They start to show up off center owing to high temperatures and later prevail at center when the central density becomes high enough. The neutrino emission from the accreting proto-neutron star with the hyperonic EOS stops much earlier than the corresponding case with a nucleonic EOS while the average energies and luminosities are quite similar between them. These features of neutrino signal are a potential probe of the emergence of new degrees of freedom inside the black hole forming collapse.Comment: 11 pages, 3 figures, accepted for publication in ApJ

On Feedback Vertex Set: New Measure and New Structures

We present a new parameterized algorithm for the {feedback vertex set} problem ({\sc fvs}) on undirected graphs. We approach the problem by considering a variation of it, the {disjoint feedback vertex set} problem ({\sc disjoint-fvs}), which finds a feedback vertex set of size $k$ that has no overlap with a given feedback vertex set $F$ of the graph $G$. We develop an improved kernelization algorithm for {\sc disjoint-fvs} and show that {\sc disjoint-fvs} can be solved in polynomial time when all vertices in $G \setminus F$ have degrees upper bounded by three. We then propose a new branch-and-search process on {\sc disjoint-fvs}, and introduce a new branch-and-search measure. The process effectively reduces a given graph to a graph on which {\sc disjoint-fvs} becomes polynomial-time solvable, and the new measure more accurately evaluates the efficiency of the process. These algorithmic and combinatorial studies enable us to develop an $O^*(3.83^k)$-time parameterized algorithm for the general {\sc fvs} problem, improving all previous algorithms for the problem.Comment: Final version, to appear in Algorithmic

Author Correction: Longitudinal assessment of tumor development using cancer avatars derived from genetically engineered pluripotent stem cells.

An amendment to this paper has been published and can be accessed via a link at the top of the paper

Reversal Distances for Strings with Few Blocks or Small Alphabets

International audienceWe study the String Reversal Distance problem, an extension of the well-known Sorting by Reversals problem. String Reversal Distance takes two strings S and T as input, and asks for a minimum number of reversals to obtain T from S. We consider four variants: String Reversal Distance, String Prefix Reversal Distance (in which any reversal must include the first letter of the string), and the signed variants of these problems, namely Signed String Reversal Distance and Signed String Prefix Reversal Distance. We study algorithmic properties of these four problems, in connection with two parameters of the input strings: the number of blocks they contain (a block being maximal substring such that all letters in the substring are equal), and the alphabet size Σ. For instance, we show that Signed String Reversal Distance and Signed String Prefix Reversal Distance are NP-hard even if the input strings have only one letter