Results 31 to 40 of about 49,138 (261)

Graph Operations and Neighborhood Polynomials

Discussiones Mathematicae Graph Theory, 2021
The neighborhood polynomial of graph G is the generating function for the number of vertex subsets of G of which the vertices have a common neighbor in G.
Alipour Maryam, Tittmann Peter
doaj   +1 more source

Ligand‐dependent transcriptional heterogeneity in cell cycle gene expression delays G1/S entry

FEBS Letters, EarlyView.
EGF and HRG induce distinct G1/S progression programs in ErbB2‐amplified BT474 breast cancer cells. Despite activating the potent ErbB2–ErbB3 heterodimer, HRG does not accelerate cell‐cycle entry. Instead, EGF promotes earlier restriction‐point passage via ERK–FOS signaling, whereas HRG activates the AKT–MYC axis, driving transcriptional heterogeneity ...
Ririn Rahmala Febri, Ayaka Nagasato‐Ichikawa, Keita Iida, Shuhei Kimura, Akira Imamoto, Mariko Okada   +5 more
wiley   +1 more source

A Polynomial Time Algorithm for 3SAT

CoRR
It is shown that any two clauses in an instance of 3SAT sharing the same terminal which is positive in one clause and negated in the other can imply a new clause composed of the remaining terms from both clauses. Clauses can also imply other clauses as long as all the terms in the implying clauses exist in the implied clause. It is shown an instance of
openaire   +4 more sources

A Two‐Stage Questionnaire and Actigraphy Screening for iRBD in a Multicenter Retrospective Cohort

Annals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective Isolated rapid‐eye‐movement sleep behavior disorder is a prodromal marker of synucleinopathies. However, most cases remain undiagnosed due to the insufficient predictive value of questionnaires and limited access to confirmatory video‐polysomnography. We assessed a two‐stage screening strategy combining a brief questionnaire on rapid‐
Caleb A. Massimi, Giorgio Ricciardiello Mejia, Andre Metzger, Kang Hyun Ryu, Salonee Marwaha, Eva Grzegorczyk, Li Zhou, Eliana Jacobs, Boris Gilyadov, Claudia Kunney, Liqhwa Ncube, Ankit Parekh, Emmanuel Mignot, Fanny M. Elahi, Joseph Winer, Kathleen Poston, Andreas Brink‐Kjaer, Emmanuel H. During   +17 more
wiley   +1 more source

CSF Cytokine Network Organization Predicts Progression Independent of Relapse and MRI Activity in Multiple Sclerosis

Annals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective Progression independent of relapse activity is a major determinant of long‐term disability in multiple sclerosis, but its immunopathologic basis remains incompletely understood. We investigated whether relapse‐independent progression in radiologically stable relapsing–remitting multiple sclerosis is associated with distinct ...
Antonio Bruno, Matteo Conti, Ettore Dolcetti, Federica Azzolini, Angela Borrelli, Roberta Fantozzi, Mario Stampanoni Bassi, Giovanni Galifi, Giuseppe Maccarrone, Luca Montaguti, Marco Cervigni, Maddalena Dal Pozzo, Roberto Furlan, Annamaria Finardi, Girolama Alessandra Marfia, Marco Salvetti, Antonella Conte, Fabio Buttari, Diego Centonze, Luana Gilio   +19 more
wiley   +1 more source

Polynomial Time Algorithm for Shortest Paths in Interval Temporal Graphs

Algorithms
We develop a polynomial time algorithm for the single-source all destinations shortest paths problem for interval temporal graphs (ITGs). While a polynomial time algorithm for this problem is known for contact sequence temporal graphs (CSGs), no such ...
Anuj Jain, Sartaj Sahni
doaj   +1 more source

Impact of decreasing polynomial degree in time needed to factor a 100 digits integer by General Number field sieve algorithm [PDF]

Engineering and Technology Journal, 2012
Factoring is very important in the field of cryptography, specifically in the Rivest, Shamir, Adleman(RSA) public-key cryptosystem, one of the most prevalent methods for transmitting and receiving secret data which its security relies on the fact that ...
Jamal A. Othman
doaj   +1 more source

Simultaneously dominating all spanning trees of a graph

Electronic Journal of Graph Theory and Applications, 2022
We investigate the problem of simultaneously dominating all spanning trees of a given graph. We prove that on 2-connected graphs, a subset of the vertices dominates all spanning trees of the graph if and only if it is a vertex cover.
Sebastian Johann, Sven O. Krumke, Manuel Streicher   +2 more
doaj   +1 more source

A Polynomial-Time Algorithm for Near-Perfect Phylogeny [PDF]

SIAM Journal on Computing, 1996
Summary: A parameterized version of the Steiner tree problem in phylogeny is defined, where the parameter measures the amount by which a phylogeny differs from ``perfection''. This problem is shown to be solvable in polynomial time for any fixed value of the parameter.
David Fernández-Baca, Jens Lagergren
openaire   +2 more sources

dynoGP: Deep Gaussian Processes for Dynamic System Identification

International Journal of Adaptive Control and Signal Processing, EarlyView.
This work introduces a novel class of deep models for system identification, dynamical deep Gaussian processes, which combine the strengths of data‐driven methods, such as those based on neural network architectures, with the ability to output a probability distribution for uncertainty representation.
Alessio Benavoli, Marco Forgione, Dario Piga   +2 more
wiley   +1 more source