Results 91 to 100 of about 313,328 (262)

EDGE-pro: Estimated Degree of Gene Expression in Prokaryotic Genomes

open access: yesEvolutionary Bioinformatics, 2013
Background The expression levels of bacterial genes can be measured directly using next-generation sequencing (NGS) methods, offering much greater sensitivity and accuracy than earlier, microarray-based methods. Most bioinformatics software for estimating levels of gene expression from NGS data has been designed for eukaryotic genomes, with algorithms ...
Tanja Magoc   +2 more
openaire   +4 more sources

Aggressive prostate cancer is associated with pericyte dysfunction

open access: yesMolecular Oncology, EarlyView.
Tumor‐produced TGF‐β drives pericyte dysfunction in prostate cancer. This dysfunction is characterized by downregulation of some canonical pericyte markers (i.e., DES, CSPG4, and ACTA2) while maintaining the expression of others (i.e., PDGFRB, NOTCH3, and RGS5).
Anabel Martinez‐Romero   +11 more
wiley   +1 more source

ROI extraction in corona virus (COVID 19) CT images using intuitionistic fuzzy edge detection

open access: yesHeliyon
Edge detection is a vital aspect of medical image processing, playing a key role in delineating borders and contours within images. This capability is instrumental for various applications, including segmentation, feature extraction, and diagnostic ...
Kumar S.N   +3 more
doaj   +1 more source

Degree-associated edge-reconstruction numbers of double-brooms

open access: yes, 2016
An edge-deleted subgraph of a graph $G$ is an {\it edge-card}. A {\it decard} consists of an edge-card and the degree of the missing edge. The {\it degree-associated edge-reconstruction number} of a graph $G$, denoted $\dern(G)$, is the minimum number of decards that suffice to reconstruct $G$.
Ma, Meijie, Zhou, Tingting
openaire   +2 more sources

Mixed hypergraphs with bounded degree: edge-coloring of mixed multigraphs

open access: yesTheoretical Computer Science, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Král’, Daniel   +2 more
openaire   +2 more sources

The neural crest‐associated gene ERRFI1 is involved in melanoma progression and resistance toward targeted therapy

open access: yesMolecular Oncology, EarlyView.
ERRFI1, a neural crest (NC)‐associated gene, was upregulated in melanoma and negatively correlated with the expression of melanocytic differentiation markers and the susceptibility of melanoma cells toward BRAF inhibitors (BRAFi). Knocking down ERRFI1 significantly increased the sensitivity of melanoma cells to BRAFi.
Nina Wang   +8 more
wiley   +1 more source

Parameterized Complexity of Two Edge Contraction Problems with Degree Constraints [PDF]

open access: yes, 2013
Motivated by recent results of Mathieson and Szeider (J. Comput. Syst. Sci. 78(1): 179–191, 2012), we study two graph modification problems where the goal is to obtain a graph whose vertices satisfy certain degree constraints. The Regular Contraction problem takes as input a graph G and two integers d and k, and the task is to decide whether G can be ...
Belmonte, R.   +3 more
openaire   +2 more sources

Glycosylated LGALS3BP is highly secreted by bladder cancer cells and represents a novel urinary disease biomarker

open access: yesMolecular Oncology, EarlyView.
Urinary LGALS3BP is elevated in bladder cancer patients compared to healthy controls as detected by the 1959 antibody–based ELISA. The antibody shows enhanced reactivity to the high‐mannose glycosylated variant secreted by cancer cells treated with kifunensine (KIF).
Asia Pece   +18 more
wiley   +1 more source

Survivin and Aurora Kinase A control cell fate decisions during mitosis

open access: yesMolecular Oncology, EarlyView.
Aurora A interacts with survivin during mitosis and regulates its centromeric role. Loss of Aurora A activity mislocalises survivin, the CPC and BubR1, leading to disruption of the spindle checkpoint and triggering premature mitotic exit, which we refer to as ‘mitotic slippage’.
Hana Abdelkabir   +2 more
wiley   +1 more source

Injective Edge-Coloring of Graphs with Small Maximum Degree

open access: yes
An injective $k$-edge-coloring of a graph $G$ is a mapping $ϕ$: $E(G)\rightarrow\{1,2,...,k\}$, such that $ϕ(e)\neϕ(e')$ if edges $e$ and $e'$ are at distance two, or are in a triangle. The smallest integer $k$ such that $G$ has an injective $k$-edge-coloring is called the injective chromatic index of $G$, denoted by $χ_i'(G)$.
Huang, Danjun, Guo, Yuqian
openaire   +2 more sources

Home - About - Disclaimer - Privacy