Results 261 to 270 of about 9,538,132 (298)

Prioritization of deleterious mutations informs genomic prediction and increases the rate of gain in common bean (Phaseolus vulgaris L.), a simulation study. [PDF]

Theor Appl Genet
Cordoba-Novoa H, Hoyos-Villegas V.
europepmc   +1 more source

Neurovascular Contacts in the Pathophysiology of Neuralgic Amyotrophy: An Observational Study

Annals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective Neuralgic amyotrophy (NA) is a prevalent, monophasic, multifocal immune‐mediated neuropathy. A distinctive characteristic of the disease is the occurrence of nerve or fascicle constrictions and torsions (NA‐associated focal nerve lesions, NAFL). The pathophysiology underlying this phenomenon remains to be fully elucidated.
Johannes Fabian Holle, Andreas Leha, Volker Limmroth, Wolfram Windisch, Maximilian Zimmermann   +4 more
wiley   +1 more source

Association Between Motor Pathway Damage and Motor Deficit in Upper and Lower Limb in People With MS

Annals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective Corticospinal tract damage is common in people with MS, but the degree of clinical symptoms varies. We hypothesize that corticospinal tract lesions are more extensive and severe in people with MS with motor impairments in both upper and lower limbs.
Mathilde Liffran, Malo Gaubert, Alice Dufey, Elise Bannier, Audrey Rico, Jean‐Christophe Ferré, Raphaël Chouteau, Laure Michel, Emmanuelle Le Page, Virginie Callot, Bertrand Audoin, Sarah Demortière, Benoît Combès, Anne Kerbrat   +13 more
wiley   +1 more source

Altering the dosage of meiotic crossover-associated RING finger proteins affects crossover number and interference in Drosophila. [PDF]

G3 (Bethesda)
Frantz E, Santa Rosa P, McMahan S, Sekelsky J.   +3 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

On Cross Parsons Numbers

Graphs and Combinatorics, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ku, Cheng Yeaw, Wong, Kok Bin
openaire   +4 more sources

Crossing Number and Weighted Crossing Number of Near-Planar Graphs

Algorithmica, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sergio Cabello, Bojan Mohar
openaire   +1 more source

The Crossing Number of Twisted Graphs

Graphs and Combinatorics, 2022
The complete twisted graph \(T_n\) is a complete simple topological graph with vertices \(v_1, v_2, \dots, v_n\) such that two edges \(v_iv_j\) and \(v_pv_q\) cross if and only if ...
Bernardo M. Ábrego, Silvia Fernández-Merchant, Ana Paulina Figueroa, Juan José Montellano-Ballesteros, Eduardo Rivera-Campo   +4 more
openaire   +3 more sources

On stable crossing numbers

Journal of Graph Theory, 1978
AbstractResults giving the exact crossing number of an infinite family of graphs on some surface are very scarce. In this paper we show the following: for G = Qn × K4.4, cry(G)‐m(G) = 4m, for 0 ⩽ = m ⩽ 2n. A generalization is obtained, for certain repeated cartesian products of bipartite graphs. Nonorientable analogs are also developed.
Paul C. Kainen, Arthur T. White
openaire   +1 more source

The Minor Crossing Number

SIAM Journal on Discrete Mathematics, 2006
The minor crossing number of a graph G is defined as the minimum crossing number of all graphs that contain G as a minor. Basic properties of this new invariant are presented. We study topological structure of graphs with bounded minor crossing number and obtain a new strong version of a lower bound based on the genus.
Drago Bokal, Gasper Fijavz, Bojan Mohar
openaire   +2 more sources

A Crossing Lemma for the Pair-Crossing Number

2014
The pair-crossing number of a graph G, pcrG, is the minimum possible number of pairs of edges that cross each other possibly several times in a drawing of G. It is known that there is a constant ci¾?1/64 such that for every not too sparse graph G with n vertices and m edges ${\mbox{pcr}}G \geq c \frac{m^3}{n^2}$ .
Eyal Ackerman, Marcus Schaefer 0001
openaire   +1 more source