Results 51 to 60 of about 614,117 (293)
Event Structure Semantics for Dynamic Graph Grammars [PDF]
, 2007 Dynamic graph grammars (DGGs) are a reflexive extension of Graph Grammars that have been introduced to represent mobile reflexive systems and calculi at a convenient level of abstraction.
Melgratti, Hernan +4 more
core +1 more source
Molecular Oncology, EarlyView.LUNAR is a liver‐specific long noncoding RNA (lncRNA) that is highly expressed in normal liver but becomes epigenetically silenced in hepatocellular carcinoma through promoter hypermethylation. Loss of LUNAR is associated with NOTCH activation, epithelial–mesenchymal transition, and metastasis, whereas restoring LUNAR restrains metastatic progression ...
Se Ha Jang +9 more
wiley +1 more source
TRANSLATING ERLANG STATE MACHINES TO UML USING TRIPLE GRAPH GRAMMARS
Studia Universitatis Babes-Bolyai: Series Informatica, 2018 In this paper, we present a method that transforms event driven Erlang state machines into high-level state machine models represented in UML. We formalized the transformation system as a triple graph grammar, a special case of graph rewriting. We argue
Dániel LUKÁCS, Melinda TÓTH
doaj +1 more source
Spatial biology in cancer epigenetics
Molecular Oncology, EarlyView.Spatial epigenomics combines molecular profiling with tissue architecture to reveal how gene regulation is organized within intact tissues. In cancer, these technologies uncover the mechanisms driving tumor heterogeneity and microenvironmental interactions, opening new opportunities for biomarker discovery and precision medicine.
Eva Crespo‐García, Manel Esteller
wiley +1 more source
Tree-Verifiable Graph Grammars [PDF]
Hyperedge-Replacement grammars (HR) have been introduced by Courcelle in order to extend the notion of context-free sets from words and trees to graphs of bounded tree-width.
Chimes, Mark +2 more
core +4 more sources
Graph transformations in architectural design
Computer Assisted Methods in Engineering and Science, 2023 This paper deals with computer-aided design of layouts of buildings. The methodology based upon graph grammars and graph transformations allows the designer to distract itself from details and to consider the functionality of the designed object, the ...
Janusz Szuba, Adam Borkowski
doaj
Transcripts enriched in codons that trigger P‐site tRNA‐mediated mRNA decay possess stable mRNA
FEBS Open Bio, EarlyView.PTMD codons were first described by Mendel et al. as mediators of an mRNA decay pathway dependent on the human protein CNOT3, homologous to yeast Not5. Our findings confirm that PTMD codons destabilize transcripts; however, unlike in yeast, the human pathway specifically targets and slightly destabilizes primarily stable mRNAs.
Rodolfo Lopes Carneiro +1 more
wiley +1 more source
MagmaFlow: A desktop platform for artificial intelligence‐driven expression analysis
FEBS Open Bio, EarlyView.MagmaFlow is a free, no‐code platform for gene expression analysis. It generates interactive volcano plots, links genes to literature, pathways, and diseases, prioritizes candidates using millions of publications, identifies affected biological processes, builds network diagrams, and exports publication‐ready figures and reports for macOS and Windows ...
Carlos E. Buss +7 more
wiley +1 more source
Juvenile zebra finches learn the underlying structural regularities of their fathers’ song
Frontiers in Psychology, 2015 Natural behaviors, such as foraging, tool use, social interaction, birdsong, and language, exhibit branching sequential structure. Such structure should be learnable if it can be inferred from the statistics of early experience.
Otilia eMenyhart +5 more
doaj +1 more source
Growing Graphs from Hyperedge Replacement Graph Grammars [PDF]
Proceedings of the 25th ACM International on Conference on Information and Knowledge Management, 2016 Discovering the underlying structures present in large real world graphs is a fundamental scientific problem. In this paper we show that a graph's clique tree can be used to extract a hyperedge replacement grammar. If we store an ordering from the extraction process, the extracted graph grammar is guaranteed to generate an isomorphic copy of the ...
Salvador Aguiñaga +3 more
openaire +2 more sources