Results 261 to 270 of about 157,845 (305)
Machine Learning Analysis of Risk Factors for Catheter-Associated Urinary Tract Infections in Stroke Patients and Their Impact on Healthcare Quality. [PDF]
Int J Gen MedLu L, Li X, Cai D, Mei C, Hong X, Xie J.
europepmc +1 more source
Benznidazole therapy improves pressure overload and cardiac electrical profile in an experimental model of Angiotensin II infusion-induced hypertension: Mechanistic insights. [PDF]
PLoS Oneda Silva Pinheiro AP +9 more
europepmc +1 more source
The Efficacy and Safety of Teplizumab in the Treatment of Stage 3 Type 1 Diabetes: A Systematic Review and Meta-Analysis of Randomized Controlled Trials. [PDF]
Diabetes Metab Syndr ObesSun Q, Zhao G.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Journal of Graph Theory, 1995
AbstractWe study a class of perfect graphs which, because they generalize interval graphs, we call pseudo‐interval graphs. Like interval graphs, their vertices correspond to intervals of a linearly ordered set, but a modified definition of intersection is used in order to determine edges.
Erik O. Brauner +2 more
openaire +1 more source
AbstractWe study a class of perfect graphs which, because they generalize interval graphs, we call pseudo‐interval graphs. Like interval graphs, their vertices correspond to intervals of a linearly ordered set, but a modified definition of intersection is used in order to determine edges.
Erik O. Brauner +2 more
openaire +1 more source
A CHARACTERIZATION OF COMPARABILITY GRAPHS AND OF INTERVAL GRAPHS
Canadian Journal of Mathematics, 1964Let < be a non-reflexive partial ordering defined on a set P. Let G(P, <) be the undirected graph whose vertices are the elements of P, and whose edges (a, b) connect vertices for which either a < b or b < a. A graph G with vertices P for which there exists a partial ordering < such that G = G(P, <) is called a comparability graph.In §
Gilmore, P. C., Hoffman, A. J.
openaire +2 more sources
ACM Transactions on Algorithms, 2012
We introduce a generalization of interval graphs, which we call Dotted Interval Graphs (DIG). A dotted interval graph is an intersection graph of arithmetic progressions (dotted intervals). Coloring of dotted interval graphs naturally arises in the context of high throughput genotyping.
Yonatan Aumann +4 more
openaire +1 more source
We introduce a generalization of interval graphs, which we call Dotted Interval Graphs (DIG). A dotted interval graph is an intersection graph of arithmetic progressions (dotted intervals). Coloring of dotted interval graphs naturally arises in the context of high throughput genotyping.
Yonatan Aumann +4 more
openaire +1 more source
International Journal of Data Mining, Modelling and Management, 2018
Frequent subgraph mining is a difficult data mining problem aiming to find the exact set of frequent subgraphs into a database of graphs. Current subgraph mining approaches make use of the canonical encoding which is one of the key operations. It is well known that canonical encodings have an exponential time complexity.
Amina, Kemmar +2 more
openaire +2 more sources
Frequent subgraph mining is a difficult data mining problem aiming to find the exact set of frequent subgraphs into a database of graphs. Current subgraph mining approaches make use of the canonical encoding which is one of the key operations. It is well known that canonical encodings have an exponential time complexity.
Amina, Kemmar +2 more
openaire +2 more sources