Results 51 to 60 of about 10,154 (303)
Equivalent Transformations and Regularization in Context-Free Grammars
Cybernetics and Information Technologies, 2015 Regularization of translational context-free grammar via equivalent transformations is a mandatory step in developing a reliable processor of a formal language defined by this grammar.
Fedorchenko Ludmila, Baranov Sergey
doaj +1 more source
Robust and Scalable Learning of Complex Intrinsic Dataset Geometry via ElPiGraph
Entropy, 2020 Multidimensional datapoint clouds representing large datasets are frequently characterized by non-trivial low-dimensional geometry and topology which can be recovered by unsupervised machine learning approaches, in particular, by principal graphs ...
Luca Albergante +9 more
doaj +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
Improving the graph grammar parser of Rekers and Schürr [PDF]
, 2011 Graph grammars and graph grammar parsers are to visual languages what string grammars and parsers are to textual languages. A graph grammar specifies a set of valid graphs and can thus be used to formalise the syntax of a visual language. A graph grammar
Fürst, Luka +2 more
core
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
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
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
Generic Graph Grammar: A Simple Grammar for Generic Procedural Modelling [PDF]
, 2012 Methods for procedural modelling tend to be designed either for organic objects, which are described well by skeletal structures, or for man-made objects, which are described well by surface primitives.
Bærentzen, Jakob Andreas +3 more
core +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
Dependency parsing resources for French: Converting acquired lexical functional grammar F-Structure annotations and parsing F-Structures directly [PDF]
, 2009 Recent years have seen considerable success in the generation of automatically obtained wide-coverage deep grammars for natural language processing, given reliable and large CFG-like treebanks.
Schluter, Natalie, van Genabith, Josef
core