Results 281 to 290 of about 3,067,250 (321)
TCR2HLA: Calibrated inference of HLA genotypes from TCR repertoires enables identification of immunologically relevant metaclonotypes. [PDF]
PLoS Comput BiolMayer-Blackwell K +15 more
europepmc +1 more source
A supported decision-making model for idiopathic pulmonary fibrosis based on feature screening and optimized neural network. [PDF]
Sci RepYe H +5 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Line‐graphical degree sequences
Journal of Graph Theory, 1980AbstractA degree sequence π = (d1, d2,…,dp), with d1 ≥ d2 ≥…≥ dp, is line graphical if it is realized by the line graph of some graph. Degree sequences with line‐graphical realizations are characterized for the cases d1 = p ‐ 1, d1 = p ‐ 2, d1 ≤ 3, and d1 = dp.
openaire +1 more source
b-matching degree-sequence polyhedra
Combinatorica, 1991zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cunningham, William H. +1 more
openaire +2 more sources
On Planar Graphical Degree Sequences
SIAM Journal on Applied Mathematics, 1977We determine completely which graphical sequences $d_1 \geqq d_2 \geqq \cdots \geqq d_p $ with $d_1 - d_p = 1$ are planar graphical, and with a small number of exceptions determine the same result when $d_1 - d_p = 2$.We also give simple necessary conditions (in the form of upper bounds on $\sum\nolimits_{i = 1}^k {di} $) for a graphical sequence to be
Schmeichel, E. F., Hakimi, S. L.
openaire +1 more source
ACM Transactions on Database Systems
Recent work has demonstrated the catastrophic effects of poor cardinality estimates on query processing time. In particular, underestimating query cardinality can result in overly optimistic query plans which take orders of magnitude longer to complete than one generated with the true cardinality.
Kyle Deeds +3 more
openaire +1 more source
Recent work has demonstrated the catastrophic effects of poor cardinality estimates on query processing time. In particular, underestimating query cardinality can result in overly optimistic query plans which take orders of magnitude longer to complete than one generated with the true cardinality.
Kyle Deeds +3 more
openaire +1 more source
Spectral Radius and Degree Sequence
Mathematische Nachrichten, 1988AbstractFor a nonregular graph there is exactly one value of p such that the p‐mean of its degree sequence is equal to the spectral radius. We try to investigate the structural content of this so‐called spectral mean characteristic; in particular, we characterize the connected graphs of spectral mean characteristic 2.
openaire +2 more sources
Journal of Graph Theory, 1999
Summary: We explore the convexity of the set of vectors consisting of degree sequences of subgraphs of a given graph. Results of \textit{P. Katerinis} [J. Graph Theory 9, No. 4, 513-521 (1985; Zbl 0664.05047)] and \textit{P. Fraisse}, \textit{P. Hell} and \textit{D. G. Kirkpatrick} [Graphs Comb.
Anstee, R. P., Nam, Yunsun
openaire +2 more sources
Summary: We explore the convexity of the set of vectors consisting of degree sequences of subgraphs of a given graph. Results of \textit{P. Katerinis} [J. Graph Theory 9, No. 4, 513-521 (1985; Zbl 0664.05047)] and \textit{P. Fraisse}, \textit{P. Hell} and \textit{D. G. Kirkpatrick} [Graphs Comb.
Anstee, R. P., Nam, Yunsun
openaire +2 more sources