Results 211 to 220 of about 4,192 (267)

Imputef: imputation of polyploid genotype classes and allele frequencies. [PDF]

BMC Genomics
Paril J, Cogan NOI, Malmberg MM.
europepmc   +1 more source

Light curve analysis and evolutionary status of four newly identified short-period eclipsing binaries. [PDF]

Sci Rep
Darwish MS, Abdelkawy AGA, Hamed GM.
europepmc   +1 more source

Relational Humor and Identity Framing in the "Virgin vs. Chad" Meme Format. [PDF]

Behav Sci (Basel)
Postigo-Fuentes AY.
europepmc   +1 more source

Approaching Hypothetical RbTl in Experiments and Theory - X-ray Structure Determination of Cs_1-<i>x</i>Rb<i>_x</i>Tl (<i>x</i> = 0.18, 0.42) and a Solid Solution K_1-<i>x</i>Rb<i>_x</i>Tl (<i>x</i> ≤ 0.69). [PDF]

Inorg Chem
Schwinghammer VF, Khan SA, Tiefenthaler SM, Kovářík T, Minár J, Gärtner S.   +5 more
europepmc   +1 more source

SAIGE-GPU: accelerating genome- and phenome-wide association studies using GPUs. [PDF]

Bioinformatics
Rodriguez A, Kim Y, Nandi TN, Keat K, Kumar R, Conery M, Bhukar R, Liu M, Hessington J, Maheshwari K, VA Million Veteran Program , Begoli E, Tourassi G, Muralidhar S, Natarajan P, Voight BF, Cho K, Gaziano JM, Damrauer SM, Liao KP, Zhou W, Huffman JE, Verma A, Madduri RK.   +23 more
europepmc   +1 more source

Observable signatures of general relativistic dynamics in compact binaries

, 2009
R. N. Lang
openalex   +1 more source

A benchmark for binary star interaction with a supermassive black hole in general relativity [PDF]

Megha Sharma, Alexander Heger, Daniel J. Price, Emilio Tejeda, Evgeni Grishin, Luis A. Manzaneda, Alessandro A. Trani   +6 more
openalex  

A binary merger product as the direct progenitor of a Type II-P supernova

Niu* Z, Sun* N, Zapartas* E, Souropanis D, Cui Y, Maund JR, Andrews JJ, Briel MM, Fraser M, Gossage S, Kruckow MU, Liotine C, Liu Z, Srivas PM, Teng E, Wang X, Yang Y, Liu J.   +17 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Generating Binary Trees Lexicographically

SIAM Journal on Computing, 1977
We represent a binary tree by the level numbers of its leaves from left to right. Thus every binary tree of n leaves corresponds to a sequence of n numbers. We first give the necessary and sufficient conditions for a sequence to represent a binary tree; then we give an algorithm for generating all the feasible sequences lexicographically as a list ...
Ruskey, F., Hu, T. C.
openaire   +1 more source