Results 71 to 80 of about 488,070 (310)

Eternal Independent Sets in Graphs

open access: yesTheory and Applications of Graphs, 2016
The use of mobile guards to protect a graph has received much attention in the literature of late in the form of eternal dominating sets, eternal vertex covers and other models of graph protection.
Yair Caro, William Klostermeyer
doaj   +1 more source

Dominant Sets for “Constrained” Image Segmentation [PDF]

open access: yesIEEE Transactions on Pattern Analysis and Machine Intelligence, 2019
Image segmentation has come a long way since the early days of computer vision, and still remains a challenging task. Modern variations of the classical (purely bottom-up) approach, involve, e.g., some form of user assistance (interactive segmentation) or ask for the simultaneous segmentation of two or more images (co-segmentation).
Eyasu Zemene Zemene   +2 more
openaire   +3 more sources

By dawn or dusk—how circadian timing rewrites bacterial infection outcomes

open access: yesFEBS Letters, EarlyView.
The circadian clock shapes immune function, yet its influence on infection outcomes is only beginning to be understood. This review highlights how circadian timing alters host responses to the bacterial pathogens Salmonella enterica, Listeria monocytogenes, and Streptococcus pneumoniae revealing that the effectiveness of immune defense depends not only
Devons Mo   +2 more
wiley   +1 more source

Edge Dominating Sets and Vertex Covers

open access: yesDiscussiones Mathematicae Graph Theory, 2013
Bipartite graphs with equal edge domination number and maximum matching cardinality are characterized. These two parameters are used to develop bounds on the vertex cover and total vertex cover numbers of graphs and a resulting chain of vertex covering ...
Dutton Ronald, Klostermeyer William F.
doaj   +1 more source

The Caenorhabditis elegans DPF‐3 and human DPP4 have tripeptidyl peptidase activity

open access: yesFEBS Letters, EarlyView.
The dipeptidyl peptidase IV (DPPIV) family comprises serine proteases classically defined by their ability to remove dipeptides from the N‐termini of substrates, a feature that gave the family its name. Here, we report the discovery of a previously unrecognized tripeptidyl peptidase activity in DPPIV family members from two different species.
Aditya Trivedi, Rajani Kanth Gudipati
wiley   +1 more source

Dominating Sets in Perfect Graphs

open access: yesDiscrete Mathematics, 1990
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Corneil, Derek G., Stewart, Lorna K.
openaire   +2 more sources

Crosstalk between the ribosome quality control‐associated E3 ubiquitin ligases LTN1 and RNF10

open access: yesFEBS Letters, EarlyView.
Loss of the E3 ligase LTN1, the ubiquitin‐like modifier UFM1, or the deubiquitinating enzyme UFSP2 disrupts endoplasmic reticulum–ribosome quality control (ER‐RQC), a pathway that removes stalled ribosomes and faulty proteins. This disruption may trigger a compensatory response to ER‐RQC defects, including increased expression of the E3 ligase RNF10 ...
Yuxi Huang   +8 more
wiley   +1 more source

Interplay between circadian and other transcription factors—Implications for cycling transcriptome reprogramming

open access: yesFEBS Letters, EarlyView.
This perspective highlights emerging insights into how the circadian transcription factor CLOCK:BMAL1 regulates chromatin architecture, cooperates with other transcription factors, and coordinates enhancer dynamics. We propose an updated framework for how circadian transcription factors operate within dynamic and multifactorial chromatin landscapes ...
Xinyu Y. Nie, Jerome S. Menet
wiley   +1 more source

New results on metric-locating-dominating sets of graphs [PDF]

open access: yes, 2016
A dominating set S of a graph is a metric-locating-dominating set if each vertex of the graph is uniquely distinguished by its distanc es from the elements of S , and the minimum cardinality of such a set is called the metri c-location- domination number.
González, Antonio   +2 more
core  

Home - About - Disclaimer - Privacy