Results 81 to 90 of about 12,133 (300)

Degrees of Undecidability in Term Rewriting [PDF]

open access: yes, 2009
Undecidability of various properties of first order term rewriting systems is well-known. An undecidable property can be classified by the complexity of the formula defining it. This gives rise to a hierarchy of distinct levels of undecidability, starting from the arithmetical hierarchy classifying properties using first order arithmetical formulas and
Jörg Endrullis   +2 more
openaire   +1 more source

Subtype‐specific enhancer RNAs define transcriptional regulators and prognosis in breast cancers

open access: yesMolecular Oncology, EarlyView.
This study employed machine learning methodologies to perform the subtype‐specific classification of RNA‐seq data sets, which are mapped on enhancers from TCGA‐derived breast cancer patients. Their integration with gene expression (referred to as ProxCReAM eRNAs) and chromatin accessibility profiles has the potential to identify lineage‐specific and ...
Aamena Y. Patel   +6 more
wiley   +1 more source

Soundness of Unravelings for Conditional Term Rewriting Systems via Ultra-Properties Related to Linearity [PDF]

open access: yesLogical Methods in Computer Science, 2012
Unravelings are transformations from a conditional term rewriting system (CTRS, for short) over an original signature into an unconditional term rewriting systems (TRS, for short) over an extended signature. They are not sound w.r.t.
Naoki Nishida   +2 more
doaj   +1 more source

K-field kinks in two-dimensional dilaton gravity

open access: yesPhysics Letters B, 2021
In this work, kinks with non-canonical kinetic energy terms are studied in a type of two-dimensional dilaton gravity model. The linear stability issue is generally discussed for arbitrary static solutions, and the stability criteria are obtained.
Yuan Zhong, Fei-Yu Li, Xu-Dong Liu
doaj   +1 more source

Network divergence analysis identifies adaptive gene modules and two orthogonal vulnerability axes in pancreatic cancer

open access: yesMolecular Oncology, EarlyView.
Tumors contain diverse cellular states whose behavior is shaped by context‐dependent gene coordination. By comparing gene–gene relationships across biological contexts, we identify adaptive transcriptional modules that reorganize into distinct vulnerability axes.
Brian Nelson   +9 more
wiley   +1 more source

Keratin 19 as a prognostic marker and contributing factor of metastasis and chemoresistance in high‐grade serous ovarian cancer

open access: yesMolecular Oncology, EarlyView.
Keratin 19 (KRT19) is overexpressed in high‐grade serous ovarian cancer with high levels of Kallikrein‐related peptidases (KLK) 4–7 and is associated with poor survival. In vivo analyses demonstrate that elevated KRT19 increases peritoneal tumour burden.
Sophia Bielesch   +13 more
wiley   +1 more source

Termination of Rewriting with and Automated Synthesis of Forbidden Patterns [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2010
We introduce a modified version of the well-known dependency pair framework that is suitable for the termination analysis of rewriting under forbidden pattern restrictions.
Bernhard Gramlich, Felix Schernhammer
doaj   +1 more source

Longitudinal circulating tumor DNA profiling in patients with advanced endometrial cancer using an off‐the‐shelf targeted NGS panel

open access: yesMolecular Oncology, EarlyView.
Intratumour heterogeneity complicates precision management of advanced endometrial cancer. Circulating tumor DNA (ctDNA) offers a minimally invasive strategy to capture tumor evolution and therapeutic resistance. Here, we compare tumor‐agnostic NGS with tumor‐informed ddPCR, outlining their relative sensitivity, concordance, and clinical implications ...
Carlos Casas‐Arozamena   +15 more
wiley   +1 more source

Kruskal's Tree Theorem for Acyclic Term Graphs [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2016
In this paper we study termination of term graph rewriting, where we restrict our attention to acyclic term graphs. Motivated by earlier work by Plump we aim at a definition of the notion of simplification order for acyclic term graphs. For this we adapt
Georg Moser, Maria A. Schett
doaj   +1 more source

The Termination Hierarchy for Term Rewriting [PDF]

open access: yesApplicable Algebra in Engineering, Communication and Computing, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +3 more sources

Home - About - Disclaimer - Privacy