Results 61 to 70 of about 697,927 (279)
Recognizable Hexagonal Picture Languages and xyz domino tiles
Ratio Mathematica, 2021 In the paper "Hexagonal Pattern Languages" K S Dersanambika et.al. define xyz- domino systems and characterized hexagonal pictures using this. Here we define xyz local hexagonal picture languages where the usual notion of hexagonal tiles of size (2, 2, 2 ...
Anitha Pancratius +1 more
doaj +1 more source
Molecular Oncology, EarlyView.Glioma cells mainly express the endothelin receptor EDNRB, while EDNRA is restricted to a perivascular tumor subpopulation. Endothelin signaling reduces glioma cell proliferation while promoting migration and a proneural‐to‐mesenchymal transition associated with poor prognosis. This pathway activates Ca2+, K+, ERK, and STAT3 signalings and is regulated
Donovan Pineau +36 more
wiley +1 more source
The separation problem for regular languages by piecewise testable languages [PDF]
, 2013 Separation is a classical problem in mathematics and computer science. It asks whether, given two sets belonging to some class, it is possible to separate them by another set of a smaller class.
L. Van, M. Zeitoun, Rooijen
core +1 more source
An Automata Theoretic Approach to the Zero-One Law for Regular Languages: Algorithmic and Logical Aspects [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 A zero-one language L is a regular language whose asymptotic probability converges to either zero or one. In this case, we say that L obeys the zero-one law.
Ryoma Sin'ya
doaj +1 more source
On Notions of Regularity for Data Languages [PDF]
Theoretical Computer Science, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Henrik Björklund, Thomas Schwentick
openaire +2 more sources
Interrogating the immune landscape of microsatellite stable RAS‐mutated colon cancer
Molecular Oncology, EarlyView.COLOSSUS project RAS‐mutated MSS colon cancer study explored transcriptomics and immune cell density by immunohistochemistry (IHC), Immunoscore (IS), ISIC/TuLIS scores, mutation counts, and detected different prevalences but similar microenvironment composition across immune markers with clinical relevance for future immunotherapy combination ...
Rodrigo Dienstmann +61 more
wiley +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 +4 more sources
Interpreting the effects of DNA polymerase variants at the structural level
Molecular Oncology, EarlyView.Using MAVISp and molecular dynamics simulations, we analyzed over 60 000 missense variants in POLE and POLD1 from ClinVar, COSMIC, cBioPortal, and saturation mutagenesis. Identified mechanistic indicators, including stability, binding, and long‐range, enable structural interpretation, providing ACMG‐like evidence for possible reclassification of VUS ...
Matteo Arnaudi +7 more
wiley +1 more source
On counting functions and slenderness of languages
, 2019 We study counting-regular languages -- these are languages $L$ for which there is a regular language $L'$ such that the number of strings of length $n$ in $L$ and $L'$ are the same for all $n$.
Ibarra, Oscar H. +2 more
core +1 more source
On the periodicity of regular languages
Information and Control, 1979 A subclass of regular languages called periodic languages and the corresponding finite automata having nontrivial periodic structure are characterized in this paper. Canonical forms of the regular expressions representing such periodic languages are presented.
openaire +2 more sources