Results 31 to 40 of about 4,711,783 (279)
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Shwachman–Diamond syndrome (SDS) is a rare autosomal recessive ribosomopathy characterized by bone marrow failure and multisystem involvement, with emerging evidence of associated neurocognitive impairment. Methods We conducted a retrospective study of 240 individuals with biallelic Shwachman–Bodian–Diamond syndrome (SBDS) mutations
Jane Koo +11 more
wiley +1 more source
Colloquium Exactarum, 2014 This article defines the formal definition of the computer program language Numeric Regular Expression. A language concept inspired by Regular Expression syntax, applying your power and flexibility to numeric chains are describe.
Bruno Vier Hoffmeister, Marta Bez
doaj +1 more source
Separation of Test-Free Propositional Dynamic Logics over Context-Free Languages [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 For a class L of languages let PDL[L] be an extension of Propositional Dynamic Logic which allows programs to be in a language of L rather than just to be regular.
Markus Latte
doaj +1 more source
Regular Languages of Thin Trees [PDF]
Theory of Computing Systems, 2015 For a fixed alphabet \(A\), a \textit{forest} is a ``mapping from its set of nodes \(\mathrm{dom}(t)\subset\omega^+\) into \(A\)''. It is additionally assumed that ``a forest is finitely branching: for every \(w\in\omega^\ast\) there are only finitely many nodes of the form \(wn\) for \(n\in {\mathbb N}\) in \(\mathrm{dom}(t)\)''; these nodes (of the ...
Bojanczyk, Mikolaj +2 more
openaire +5 more sources
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Survivorship care plans (SCPs) summarize cancer treatment and guide risk‐based follow‐up for cancer survivors, yet remain difficult to create, share, and use. Stakeholder perspectives are needed to inform usable approaches.
Molly S. Talman +4 more
wiley +1 more source
A decidable characterization of locally testable tree languages [PDF]
Logical Methods in Computer Science, 2011 A regular tree language L is locally testable if membership of a tree in L depends only on the presence or absence of some fix set of neighborhoods in the tree.
Thomas Place, Luc Segoufin
doaj +1 more source
Therapeutic Apheresis and Dialysis, EarlyView.ABSTRACT Background Chronic micro‐inflammation in patients with end‐stage renal disease (ESRD) is a significant driver of cardiovascular complications and diminished quality of life. While standard hemodialysis (SHD) effectively manages small‐molecule clearance, its ability to remove medium‐to‐large uremic toxins—the primary catalysts of systemic ...
Hongwei Zuo +5 more
wiley +1 more source
Numeration Systems on a Regular Language [PDF]
Theory of Computing Systems, 2000 Generalizations of linear numeration systems in which the set of natural numbers is recognizable by finite automata are obtained by describing an arbitrary infinite regular language following the lexicographic ordering. For these systems of numeration, we show that ultimately periodic sets are recognizable.
Lecomte, Pierre, Rigo, Michel
openaire +4 more sources
Extensions of ω-Regular Languages [PDF]
Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science, 2020 We consider extensions of monadic second order logic over $ω$-words, which are obtained by adding one language that is not $ω$-regular. We show that if the added language $L$ has a neutral letter, then the resulting logic is necessarily undecidable. A corollary is that the $ω$-regular languages are the only decidable Boolean-closed full trio over $ω ...
Mikolaj Bojanczyk +3 more
openaire +5 more sources
Engineering peptides into antibodies—opportunities and strategies for therapeutic innovation
FEBS Letters, EarlyView.Peptides and antibodies occupy complementary therapeutic niches. Peptides recognize difficult targets in a compact format, while antibodies add specificity, long half‐life, and effector functions. This review examines strategies that merge both modalities—peptide grafting into loops, terminal and Fc fusions, and bioconjugation—highlighting how ...
Jinling Wang +2 more
wiley +1 more source