Results 81 to 90 of about 2,836,177 (344)
Deep Learning with Word Embedding Improves Kazakh Named-Entity Recognition
Information, 2022 Named-entity recognition (NER) is a preliminary step for several text extraction tasks. In this work, we try to recognize Kazakh named entities by introducing a hybrid neural network model that leverages word semantics with multidimensional features and ...
Gulizada Haisa, Gulila Altenbek
doaj +1 more source
Named Entity Filtering Based on Concept Association Graphs [PDF]
Research in Computing Science, 2013 In this paper, we introduce a novel technique for named entity filtering, focused on the analysis of word association networks. We present an approach for modelling concepts which are distinctively related to specific named entity. We evaluated our approach in the context of the TREC Knowledge Base Acceleration track, and we obtained significantly ...
Gross, Oskar +2 more
openaire +2 more sources
A new intrinsically knotted graph with 22 edges
, 2017 A graph is called intrinsically knotted if every embedding of the graph contains a knotted cycle. Johnson, Kidwell and Michael showed that intrinsically knotted graphs have at least 21 edges.
Kim, Hyoungjun +4 more
core +1 more source
Molecular Oncology, EarlyView.TOMM20 increases cancer aggressiveness by maintaining a reduced state with increased NADH and NADPH levels, oxidative phosphorylation (OXPHOS), and apoptosis resistance while reducing reactive oxygen species (ROS) levels. Conversely, CRISPR‐Cas9 knockdown of TOMM20 alters these cancer‐aggressive traits.
Ranakul Islam +9 more
wiley +1 more source
REDEN: Named Entity Linking in Digital Literary Editions Using Linked Data Sets
Complex Systems Informatics and Modeling Quarterly, 2016 This paper proposes a graph-based Named Entity Linking (NEL) algorithm named REDEN for the disambiguation of authors’ names in French literary criticism texts and scientific essays from the 19th and early 20th centuries.
Carmen Brando +2 more
doaj +1 more source
, 2010 We introduce the notion of Lombardi graph drawings, named after the American abstract artist Mark Lombardi. In these drawings, edges are represented as circular arcs rather than as line segments or polylines, and the vertices have perfect angular ...
A. Efrat +26 more
core +3 more sources
Molecular Oncology, EarlyView.This study investigates an alternative approach to reactivating the oncosuppressor p53 in cancer. A short peptide targeting the association of the two p53 inhibitors, MDM2 and MDM4, induces an otherwise therapeutically active p53 with unique features that promote cell death and potentially reduce toxicity towards proliferating nontumor cells.
Sonia Valentini +10 more
wiley +1 more source
A graph-search framework for associating gene identifiers with documents
BMC Bioinformatics, 2006 Background One step in the model organism database curation process is to find, for each article, the identifier of every gene discussed in the article.
Cohen William W, Minkov Einat
doaj +1 more source
Totally magic d-lucky number of graphs
Ratio Mathematica, 2022 In this paper we introduce a new labeling named as, totally magic d-lucky labeling, find the totally magic d-lucky number of some standard graphs like wheel, cycle, bigraph etc. and find the totally magic d-lucky number of some zero divisor graphs.
N Mohamed Rilwan, A Nilofer
doaj +1 more source
Molecular Oncology, EarlyView.TGF‐β has a complex role in cancer, exhibiting both tumor‐suppressive and tumor‐promoting properties. Using a series of differentiated tumoroids, derived from different stages and mutational background of colorectal cancer patients, we replicate this duality of TGF‐β in vitro. Notably, the atypical but highly aggressive KRASQ22K mutation rendered early‐
Theresia Mair +17 more
wiley +1 more source