Results 1 to 10 of about 630 (124)

Asymptotic Analysis of the kth Subword Complexity [PDF]

Entropy, 2020
Patterns within strings enable us to extract vital information regarding a string’s randomness. Understanding whether a string is random (Showing no to little repetition in patterns) or periodic (showing repetitions in patterns) are described by a ...
Lida Ahmadi, Mark Daniel Ward
doaj   +5 more sources

Subword complexity and power avoidance [PDF]

Theoretical Computer Science, 2019
We begin a systematic study of the relations between subword complexity of infinite words and their power avoidance. Among other things, we show that -- the Thue-Morse word has the minimum possible subword complexity over all overlap-free binary words and all $(\frac 73)$-power-free binary words, but not over all $(\frac 73)^+$-power-free binary words;
Jeffrey Shallit
exaly   +5 more sources

On Correlation Polynomials and Subword Complexity [PDF]

Discrete Mathematics & Theoretical Computer Science, 2007
We consider words with letters from a $q-ary$ alphabet $\mathcal{A}$. The kth subword complexity of a word $w ∈\mathcal{A}^*$ is the number of distinct subwords of length $k$ that appear as contiguous subwords of $w$.
Irina Gheorghiciuc, Mark Daniel Ward
doaj   +2 more sources

BioSemAF-BiLSTM: a protein sequence feature extraction framework based on semantic and evolutionary information [PDF]

Frontiers in Genetics
S-sulfenylation is a critical post-translational modification that plays an important role in regulating protein function, redox signaling, and maintaining cellular homeostasis.
Zihan Zhang, Yixuan Wang
doaj   +2 more sources

Subword Complexes and Kalai's Conjecture on Reconstruction of Spheres. [PDF]

Discrete Comput Geom
Abstract A famous theorem in polytope theory states that the combinatorial type of a simplicial polytope is completely determined by its facet-ridge graph. This celebrated result was proven by Blind and Mani (Aequationes Math 34(2–3):287–297, 1987, https://doi.org/10.1007/BF01830678), via a non-constructive proof using topological tools from ...
Ceballos C, Doolittle J.
europepmc   +4 more sources

On the joint subword complexity of automatic sequences

Theoretical Computer Science, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yossi Moshe
exaly   +3 more sources

On the subword complexity of Thue–Morse polynomial extractions

Theoretical Computer Science, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yossi Moshe
exaly   +2 more sources

Super-stationary set, subword problem and the complexity

Discrete Mathematics, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bo Tan, Hui Rao, Yu-Mei Xue
exaly   +3 more sources

On the subword complexity of iteratively generated infinite words

Discrete Applied Mathematics, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
exaly   +3 more sources

The subword complexity of a class of infinite binary words

Advances in Applied Mathematics, 2007
29 pages, 2 ...
exaly   +3 more sources