Results 151 to 160 of about 1,167,245 (202)

Boosting multiplexing capabilities for error-robust spatial transcriptomic methods using a set exchange approach. [PDF]

Sci Adv
Boström J, Zapaɫa M, Adameyko I.
europepmc   +1 more source

Unbiased and error-detecting combinatorial pooling experiments with balanced constant-weight Gray codes for consecutive positives detection. [PDF]

Bioinformatics
He G, Kovaleva VA, Barton C, Thomas PG, Pogorelyy MV, Meyer HV, Huang Q.   +6 more
europepmc   +1 more source

Multimodal learning for scalable representation of high-dimensional medical data. [PDF]

Front Digit Health
Alsaafin A, Shafique A, Alfasly S, Kalari KR, Tizhoosh HR.   +4 more
europepmc   +1 more source

Integrating commonsense knowledge with GPT embeddings for emotion classification. [PDF]

MethodsX
Yadav U, Dasarwar P, Asudani D.
europepmc   +1 more source

Synteny and linkage decay in bacteriophage pangenomes

Fendley JM, Molari M, Neher RA, Shraiman BI.   +3 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Phylogeny Numbers of Generalized Hamming Graphs

Bulletin of the Malaysian Mathematical Sciences Society, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chengyang Qian, Yaokun Wu, Yanzhen Xiong
openaire   +2 more sources

Graphs over Graded Rings and Relation with Hamming Graph

Bulletin of the Malaysian Mathematical Sciences Society, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shahram Mehry, Saadoun Mahmoudi
openaire   +2 more sources

Matchings in Lattice Graphs and Hamming Graphs

Combinatorics, Probability and Computing, 1994
In this paper we solve the following problem on the lattice graph L(m1,…,mn) and the Hamming graph H(m1,…,mn), generalizing a result of Felzenbaum-Holzman-Kleitman on the n-dimensional cube (all mi = 2): Characterize the vectors (s1.…,sn) such that there exists a maximum matching in L, respectively, H with exactly si edges in the ith direction.
Aigner, Martin, Klimmek, Regina
openaire   +2 more sources

An upper bound on the number of relevant variables for Boolean functions on the Hamming graph

Discrete Mathematics
The spectrum of a complex-valued function $f$ on $\mathbb{Z}_{q}^n$ is the set $\{|u|:u\in \mathbb{Z}_q^n~\mathrm{and}~\widehat{f}(u)\neq 0\}$, where $|u|$ is the Hamming weight of $u$ and $\widehat{f}$ is the Fourier transform of $f$.
A. Valyuzhenich
semanticscholar   +1 more source