0000000000141930
AUTHOR
Alessandro De Luca
Lactobacillus crispatus M247 oral administration: Is it really an effective strategy in the management of papillomavirus-infected women?
Abstract Background Recent studies have shown the importance of the microbiota in women's health. Indeed, the persistence of Human Papilloma Virus (HPV)-related lesions in patients with dysbiosis can be the antechamber to cervical cancer. The aim of this study was to evaluate whether long term administration of oral Lactobacillus crispatus can restore eubiosis in women with HPV infections and hence achieve viral clearance. Methods In total, 160 women affected by HPV infections were enrolled at the Department of Gynecological Obstetrics of “San Paolo” Hospital, Italy between February 2021 and February 2022. The women were randomly assigned to two groups, one in treatment with oral Lactobacil…
Production of CSSi013-A (9360) iPSC line from an asymptomatic subject carrying an heterozygous mutation in TDP-43 protein
Amyotrophic Lateral Sclerosis (ALS) is a fatal disease affecting both upper and lower motoneurons. The transactive response DNA binding protein (TARDBP) gene, encoding for TDP-43, is one of the most commonly mutated gene associated with familial cases of ALS (10%). We generated a human induced pluripotent stem cell (hiPSC) line from the fibroblasts of an asymptomatic subject carrying the TARDBP p.G376D mutation. This mutation is very rare and was described in a large Apulian family, in which all ALS affected members are carriers of the mutation. The subject here described is the first identified asymptomatic carrier of the mutation.
Maximal Closed Substrings
A string is closed if it has length 1 or has a nonempty border without internal occurrences. In this paper we introduce the definition of a maximal closed substring (MCS), which is an occurrence of a closed substring that cannot be extended to the left nor to the right into a longer closed substring. MCSs with exponent at least 2 are commonly called runs; those with exponent smaller than 2, instead, are particular cases of maximal gapped repeats. We show that a string of length n contains O(n1.5) MCSs. We also provide an output-sensitive algorithm that, given a string of length n over a constant-size alphabet, locates all m MCSs the string contains in O(nlog n+ m) time.
Enumeration and Structure of Trapezoidal Words
Trapezoidal words are words having at most $n+1$ distinct factors of length $n$ for every $n\ge 0$. They therefore encompass finite Sturmian words. We give combinatorial characterizations of trapezoidal words and exhibit a formula for their enumeration. We then separate trapezoidal words into two disjoint classes: open and closed. A trapezoidal word is closed if it has a factor that occurs only as a prefix and as a suffix; otherwise it is open. We investigate open and closed trapezoidal words, in relation with their special factors. We prove that Sturmian palindromes are closed trapezoidal words and that a closed trapezoidal word is a Sturmian palindrome if and only if its longest repeated …
On the Lie complexity of Sturmian words
Bell and Shallit recently introduced the Lie complexity of an infinite word $s$ as the function counting for each length the number of conjugacy classes of words whose elements are all factors of $s$. They proved, using algebraic techniques, that the Lie complexity is bounded above by the first difference of the factor complexity plus one; hence, it is uniformly bounded for words with linear factor complexity, and, in particular, it is at most 2 for Sturmian words, which are precisely the words with factor complexity $n+1$ for every $n$. In this note, we provide an elementary combinatorial proof of the result of Bell and Shallit and give an exact formula for the Lie complexity of any Sturmi…
Open and Closed Prefixes of Sturmian Words
A word is closed if it contains a proper factor that occurs both as a prefix and as a suffix but does not have internal occurrences, otherwise it is open. We deal with the sequence of open and closed prefixes of Sturmian words and prove that this sequence characterizes every finite or infinite Sturmian word up to isomorphisms of the alphabet. We then characterize the combinatorial structure of the sequence of open and closed prefixes of standard Sturmian words. We prove that every standard Sturmian word, after swapping its first letter, can be written as an infinite product of squares of reversed standard words.
Rapid evaluation of notch stress intensity factors using the peak stress method with 3D tetrahedral finite element models: Comparison of commercial codes
The peak stress method (PSM) allows a rapid application of the notch stress intensity factor (NSIF) approach to the fatigue life assessment of welded structures, by employing the linear elastic peak stresses evaluated by FE analyses with coarse meshes. Because of the widespread adoption of 3D modeling of large and complex structures in the industry, the PSM has recently been boosted by including four-node and ten-node tetrahedral elements of Ansys FE software, which allows to discretize complex geometries. In this paper, a Round Robin among eleven Italian Universities has been performed to calibrate the PSM with seven different commercial FE software packages. Several 3D mode I, II and III …
"Delirium Day": a nationwide point prevalence study of delirium in older hospitalized patients using an easy standardized diagnostic tool
Background To date, delirium prevalence in adult acute hospital populations has been estimated generally from pooled findings of single-center studies and/or among specific patient populations. Furthermore, the number of participants in these studies has not exceeded a few hundred. To overcome these limitations, we have determined, in a multicenter study, the prevalence of delirium over a single day among a large population of patients admitted to acute and rehabilitation hospital wards in Italy. Methods This is a point prevalence study (called “Delirium Day”) including 1867 older patients (aged 65 years or more) across 108 acute and 12 rehabilitation wards in Italian hospitals. Delirium wa…
The sequence of open and closed prefixes of a Sturmian word
A finite word is closed if it contains a factor that occurs both as a prefix and as a suffix but does not have internal occurrences, otherwise it is open. We are interested in the {\it oc-sequence} of a word, which is the binary sequence whose $n$-th element is $0$ if the prefix of length $n$ of the word is open, or $1$ if it is closed. We exhibit results showing that this sequence is deeply related to the combinatorial and periodic structure of a word. In the case of Sturmian words, we show that these are uniquely determined (up to renaming letters) by their oc-sequence. Moreover, we prove that the class of finite Sturmian words is a maximal element with this property in the class of binar…