Results 61 to 70 of about 996,357 (278)
Lower bounds for the energy of graphs
AKCE International Journal of Graphs and Combinatorics, 2018 Let G be a finite simple undirected graph with n vertices and m edges. The energy of a graph G , denoted by E ( G ) , is defined as the sum of the absolute values of the eigenvalues of G .
Akbar Jahanbani
doaj +2 more sources
Randomized complexity lower bounds [PDF]
Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98, 1998 The complexity lower bound (log N) is proved for randomized computation trees (over reals with branching signs f ; >g) for recognizing an arrangement or a polyhedron with N faces. A similar lower bound is proved for randomized computation trees over any zero-characteristic eld with branching signs f=; 6 =g for recognizing an arrangement.
openaire +2 more sources
Multiple ETS family transcription factors bind mutant p53 via distinct interaction regions
FEBS Letters, EarlyView.Mutant p53 gain‐of‐function is thought to be mediated by interaction with other transcription factors. We identify multiple ETS transcription factors that can bind mutant p53 and found that this interaction can be promoted by a PXXPP motif. ETS proteins that strongly bound mutant p53 were upregulated in ovarian cancer compared to ETS proteins that ...
Stephanie A. Metcalf +6 more
wiley +1 more source
Scientific Reports, 2021 Ritz eigenvalues only provide upper bounds for the energy levels, while obtaining lower bounds requires at least the calculation of the variances associated with these eigenvalues. The well-known Weinstein and Temple lower bounds based on the eigenvalues
Miklos Ronto +2 more
doaj +1 more source
Challenges in computational lower bounds [PDF]
, 2013 We draw two incomplete, biased maps of challenges in computational complexity lower ...
Viola, Emanuele
core
New Lower Bounds for Constant Dimension Codes [PDF]
, 2013 This paper provides new constructive lower bounds for constant dimension codes, using different techniques such as Ferrers diagram rank metric codes and pending blocks.
Silberstein, Natalia +1 more
core +1 more source
The newfound relationship between extrachromosomal DNAs and excised signal circles
FEBS Letters, EarlyView.Extrachromosomal DNAs (ecDNAs) contribute to the progression of many human cancers. In addition, circular DNA by‐products of V(D)J recombination, excised signal circles (ESCs), have roles in cancer progression but have largely been overlooked. In this Review, we explore the roles of ecDNAs and ESCs in cancer development, and highlight why these ...
Dylan Casey, Zeqian Gao, Joan Boyes
wiley +1 more source
New lower bounds for van der Waerden numbers
Forum of Mathematics, Pi, 2022 We show that there is a red-blue colouring of $[N]$ with no blue 3-term arithmetic progression and no red arithmetic progression of length $e^{C(\log N)^{3/4}(\log \log N)^{1/4}}$.
Ben Green
doaj +1 more source
FEBS Letters, EarlyView.This study reveals how the mitochondrial protein Slm35 is regulated in Saccharomyces cerevisiae. The authors identify stress‐responsive DNA elements and two upstream open reading frames (uORFs) in the 5′ untranslated region of SLM35. One uORF restricts translation, and its mutation increases Slm35 protein levels and mitophagy.
Hernán Romo‐Casanueva +5 more
wiley +1 more source
Multicut Lower Bounds via Network Coding
, 2013 We introduce a new technique to certify lower bounds on the multicut size using network coding. In directed networks the network coding rate is not a lower bound on the multicut, but we identify a class of networks on which the rate is equal to the size ...
Blasiak, Anna
core +1 more source