Results 271 to 280 of about 926,750 (319)

Correction: <i>Juglans regia</i> and <i>Pfaffia paniculata</i> extracts: implications for periodontal disease treatment and correlation with Alzheimer's risk. [PDF]

Front Cell Infect Microbiol
Miranda DG, Carrouel F, Attik N, Araujo GF, Lopes NFDS, Marcucci MC, Rodrigues FP, Caires GA, Vigerelli H, Godoi BH, Pacheco-Soares C, Ramos LP.   +11 more
europepmc   +1 more source

Elucidating the protective role of quercetin against lipopolysaccharide-induced necroptosis in broiler thymus: insights from Nrf2/PERK signaling based on network pharmacology and experimental validation. [PDF]

Redox Rep
Xia Y, Xie R, Huo X, Chen K, Li S, Xu S, Li S.   +6 more
europepmc   +1 more source

Information theory for hypergraph similarity. [PDF]

Sci Adv
Felippe H, Kirkley A, Battiston F.
europepmc   +1 more source

Etiology and Epidemiology of Acute Lower Respiratory Infections Among Hospitalized Pediatric Patients in Northeastern China: A Retrospective Study from 2023 to 2025. [PDF]

Infect Drug Resist
Zhao HY, Zhang SY, Wang R, Zhang XY, Wang XF.   +4 more
europepmc   +1 more source

Transcription factor SOX4 promotes proliferation, invasion and lymphatic metastasis of laryngeal squamous cell carcinoma via PTBP2 activation. [PDF]

Front Oncol
Kong D, Hao J, Yang J, Xin Y, Cao H, Li Q, He B, Wang B.   +7 more
europepmc   +1 more source

Kumskova M, Flora GD, Nayak MK, et al. Platelet defects in patients and mice with Ehlers-Danlos syndrome. Blood. 2026;147(9):987-997.

Blood
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Specifying Knowledge Graph with Data Graph, Information Graph, Knowledge Graph, and Wisdom Graph

International Journal of Software Innovation, 2018
Knowledge graphs have been widely adopted, in large part owing to their schema-less nature. It enables knowledge graphs to grow seamlessly and allows for new relationships and entities as needed. A knowledge graph is a graph constructed by representing each item, entity and user as nodes, and linking those nodes that interact with each other via edges.
Yucong Duan, Lixu Shao, Gongzhu Hu
openaire   +1 more source

Graph Decomposition of Slim Graphs

Graphs and Combinatorics, 1999
Let \(H\) be a fixed graph. An \(H\)-decomposition of an input graph \(G\) is a partition of the edge set of \(G\) such that each part forms a subgraph isomorphic to \(H\). This problem is known to be NP-complete as soon as \(H\) has a component with at least three edges. (This was conjectured by Holyer, and proved independently by \textit{D. Dor} and \
Yair Caro, Raphael Yuster
openaire   +2 more sources