Results 51 to 60 of about 1,103,073 (309)
Enumeration of Some Classes of Words Avoiding Two Generalized Patterns of Length Three
Journal of Automata, Languages and Combinatorics, Volume 14, Number 2, 2009, 129 ...
Bernini, Antonio +2 more
openaire +2 more sources
Unary patterns under permutations [PDF]
Thue characterized completely the avoidability of unary patterns. Adding function variables gives a general setting capturing avoidance of powers, avoidance of patterns with palindromes, avoidance of powers under coding, and other questions of recent ...
Currie, James D. +3 more
core +1 more source
Text Analysis of Patent Abstracts
Text analysis involves the deconstruction of information within a text. This includes text structure, text pattern, linguistic features, lexical analysis, and syntactic analysis.
Yvonne Tsai
doaj +1 more source
Normal, Abby Normal, Prefix Normal
A prefix normal word is a binary word with the property that no substring has more 1s than the prefix of the same length. This class of words is important in the context of binary jumbled pattern matching.
A. Amir +14 more
core +1 more source
Translational cancer research and its implementation through competitively selected Comprehensive Cancer Centers across Europe should be the primary policy focus for addressing the increasing cancer burden in Europe and counteract the present main strategy to convert cancer to a chronic disease.
Manuel Heitor +2 more
wiley +1 more source
A Fast Method for Blind Identification of Punctured Convolutional Codes [PDF]
The existing method for blind identification of a punctured convolutional code involves searching for dual words and the puncturing pattern exhaustively.
S. N. Han, M. Zhang, X. H. Li
doaj
Purpose: The aim of the present study was to explore fine lexical tuning in Dutch infant-directed speech (IDS) addressed to congenitally deaf infants who received a cochlear implant (CI) early in life (<2 years of age) in comparison with children with
Lotte Odijk, Steven Gillis
doaj +1 more source
Deterministic indexing for packed strings [PDF]
Given a string S of length n, the classic string indexing problem is to preprocess S into a compact data structure that supports efficient subsequent pattern queries.
Bille, Philip +2 more
core +3 more sources
Age‐Related Characteristics of SYT1‐Associated Neurodevelopmental Disorder
ABSTRACT Objectives We describe the clinical manifestations and developmental abilities of individuals with SYT1‐associated neurodevelopmental disorder (Baker‐Gordon syndrome) from infancy to adulthood. We further describe the neuroradiological and electrophysiological characteristics of the condition at different ages, and explore the associations ...
Sam G. Norwitz +3 more
wiley +1 more source
Efficient pattern matching in compressed text via bit-parallel word-based encoding
This paper introduces an optimized algorithm designed to accelerate compressed word matching using advanced bit-parallelism techniques, resulting in a high-performance solution. The proposed algorithm (BIT_COMP) uses the concept of word-based tagged code
Rajesh Prasad +3 more
doaj +1 more source

