Results 141 to 150 of about 2,112 (254)

Unbiased pangenome graphs. [PDF]

open access: yesBioinformatics, 2023
Garrison E, Guarracino A.
europepmc   +1 more source

Nigerian English: History, functions and features

open access: yesWorld Englishes, EarlyView.
Abstract This article offers a comprehensive overview of Nigerian English, a rapidly expanding variety of world Englishes, recognised as one of the fastest‐growing varieties of English globally in numerical terms. This article has four aims. First, it discusses the historical developments of English in Nigeria with reference to the events that led to ...
Kingsley O. Ugwuanyi   +1 more
wiley   +1 more source

Graphical models for topological groups: A case study on countable Stone spaces

open access: yesBulletin of the London Mathematical Society, EarlyView.
Abstract By analogy with the Cayley graph of a group with respect to a finite generating set or the Cayley–Abels graph of a totally disconnected, locally compact group, we detail countable connected graphs associated to Polish groups that we term Cayley–Abels–Rosendal graphs.
Beth Branman   +3 more
wiley   +1 more source

Steiner Transitive-Closure Spanners of d-Dimensional Posets

open access: green, 2010
Piotr Berman   +5 more
openalex   +2 more sources

Transitive closure algorithms based on graph traversal [PDF]

open access: bronze, 1993
Yannis Ioannidis   +2 more
openalex   +1 more source

Comparative efficacy and safety of intravenous racemic ketamine, repetitive transcranial magnetic stimulation and electroconvulsive therapy for Stage 2 or higher treatment‐resistant depression: A systematic review and network meta‐analysis

open access: yesPsychiatry and Clinical Neurosciences Reports, Volume 4, Issue 3, September 2025.
Considering the drawbacks of electroconvulsive therapy (ECT), intravenous racemic ketamine (IV ketamine) and repetitive transcranial magnetic stimulation (rTMS) may be preferable alternative treatments as they demonstrate no apparent inferiority in antidepressant efficacy.
Itsuki Terao   +6 more
wiley   +1 more source

The Generic Circular Triangle‐Free Graph

open access: yesJournal of Graph Theory, Volume 109, Issue 4, Page 426-445, August 2025.
ABSTRACT In this article, we introduce the generic circular triangle‐free graph C 3 and propose a finite axiomatization of its first‐order theory. In particular, our main results show that a countable graph G embeds into C 3 if and only if it is a { K 3 , K 1 + 2 K 2 , K 1 + C 5 , C 6 }‐free graph.
Manuel Bodirsky, Santiago Guzmán‐Pro
wiley   +1 more source

Home - About - Disclaimer - Privacy