Results 261 to 270 of about 80,890 (284)

BABAPPAlign: a multiple sequence alignment engine with a learned residue-level scoring function. [PDF]

Bioinformatics
Sinha K.
europepmc   +1 more source

Non-vectorial integration of intersectional short-pulse stimulation enables enhanced deep brain modulation and effective seizure control. [PDF]

Commun Med (Lond)
Földi T, Szoboszlay M, Chadaide Z, Radics B, Horváth B, Vecsernyés E, Langó I, Ráfi P, Pejin A, Barcsai L, Kozák G, Forgó N, Furuglyás K, Nagy O, Nagy AJ, Laszlovszky T, Somogyvári Z, Lőrincz ML, Devinsky O, Berényi A.   +19 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Representation of zero-sum invariants by sets of zero-sum sequences over a finite abelian group

Periodica Mathematica Hungarica, 2021
Let \((G,+)\) be a finite abelian group with identity element \(0\). Denote by \(\mathcal{F}(G)\) the set of finite sequences over \(G\). For a sequence \(T\in\mathcal{F}(G)\) and an element \(g\in G\) denote by \(v_g(T)\) the multiplicity of \(g\) in \(T\).
Weidong Gao, Wanzhen Hui, Gao Weidong
exaly   +4 more sources

On the structure of long zero-sum free sequences and n-zero-sum free sequences over finite cyclic groups

Archiv Der Mathematik, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Weidong Gao, Yuanlin Li, Pingzhi Yuan
exaly   +2 more sources

On zero-sum sequences of prescribed length

Aequationes mathematicae, 2006
Let k ≥ 1 be any integer. Let G be a finite abelian group of exponent n. Let sk(G) be the smallest positive integer t such that every sequence S in G of length at least t has a zero-sum subsequence of length kn. We study this constant for groups \(G \cong {\user2{{\mathbb{Z}}}}^{d}_{n}\) when d = 3 or 4. In particular, we prove, as a main result, that \
Weidong Gao, Ravindranathan Thangadurai
openaire   +1 more source

ON A PROPERTY OF MINIMAL ZERO-SUM SEQUENCES AND RESTRICTED SUMSETS

Bulletin of the London Mathematical Society, 2005
Let \(G\) be an additively written abelian group, and let \(S\) be a sequence in \(G\backslash \{0\}\) with length \(| S | \geq 4\). Suppose that \(S\) is a product of two subsequences, say \(S=BC\) such that the element \(g+h\) occurs in the sequence \(S\) whenever \(g \cdot h\) is a subsequence of \(B\) or \(C\).
Gao, Weidong, Geroldinger, Alfred
openaire   +2 more sources

On the order of elements in long minimal zero-sum sequences

Periodica Mathematica Hungarica, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Weidong Gao 0001, Alfred Geroldinger
openaire   +2 more sources