Results 1 to 10 of about 1,541,664 (157)
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 +7 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 +3 more sources
The Maximal Subword Complexity of Quasiperiodic Infinite Words [PDF]
Electronic Proceedings in Theoretical Computer Science, 2010 We provide an exact estimate on the maximal subword complexity for quasiperiodic infinite words. To this end we give a representation of the set of finite and of infinite words having a certain quasiperiod q via a finite language derived from q.
Ronny Polley, Ludwig Staiger
doaj +3 more sources
BioSemAF-BiLSTM: a protein sequence feature extraction framework based on semantic and evolutionary information [PDF]
Frontiers in GeneticsS-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
A federated deep learning framework with distributed hybrid character-level and attention mechanisms for scalable and cost-efficient fake news detection [PDF]
Scientific ReportsFake news detection is an essential task for media and news organizations to maintain the trust and reliability of the published content. Due to the rapid growth of online users and the spread of misinformation through malicious sources, the fake news ...
K. Nithya, C. R. Dhivyaa
doaj +2 more sources
Applying a uniform marked morphism to a word [PDF]
Discrete Mathematics & Theoretical Computer Science, 1999 We describe the relationship between different parameters of the initial word and its image obtained by application of a uniform marked morphism. The functions described include the subword complexity, frequency of factors, and the recurrence function ...
Anna Frid
doaj +3 more sources
The subword complexity of polynomial subsequences of the Thue–Morse sequence
Comptes Rendus. Mathématique, 2022 Let $\mathbf{t}=(t(n))_{n\geqslant 0}$ be the Thue–Morse sequence in $0,1$. J.-P. Allouche and J. Shallit asked in 2003 whether the subword complexity of the subsequence $(t(n^2))_{n\geqslant 0}$ attains the maximal value.
Shen, Zhao
doaj +1 more source
Electronic Proceedings in Theoretical Computer Science, 2011 Partial words are sequences over a finite alphabet that may contain wildcard symbols, called holes, which match or are compatible with all letters; partial words without holes are said to be full words (or simply words). Given an infinite partial word w,
Francine Blanchet-Sadri +4 more
doaj +1 more source
On infinite permutations [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 We define an infinite permutation as a sequence of reals taken up to the order, or, equivalently, as a linear ordering of a finite or countable set. Then we introduce and characterize periodic permutations; surprisingly, for each period $t$ there is an ...
Dmitri G. Fon-Der-Flaass, Anna E. Frid
doaj +1 more source
EURASIP Journal on Audio, Speech, and Music Processing, 2023 This article presents the research work on improving speech recognition systems for the morphologically complex Malayalam language using subword tokens for language modeling.
Kavya Manohar, Jayan A R, Rajeev Rajan
doaj +1 more source