Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 14 of 14 for “"Random words"”.
-
Patterns in random words of context-free grammars
Let Tn be a uniformly randomly selected word of size n from an irreducible unambiguous context-free grammar $H$. We analyze the number of times of seeing a fixed pattern within Tn by constructing a critical multitype branching process (on the context free grammar) that assigns the same probability …
-
Topics on the length of the longest common subsequences, with blocks, in binary random words
… longest common and increasing subsequences in random words is classical in computer science and bioinformatics, and has been well explored over the last few decades. This dissertation studies a generalization of LCIn for two binary random words, namely, it analyzes the asymptotic behavior of …
-
Topics on the longest common subsequences: Simulations, computations, and variance
… of the longest common subsequences (LCSs) of two random words/strings is classical in computer science and bioinformatics. A problem of particular probabilistic interest is to determine the limiting behavior of the expectation and variance of the length of the LCSs, as the length of the random …
-
Random subsequences problems : asymptotics, variance, and quantum statistics.
This work considers some random words combinatorial problems and their applications. The starting point of this endeavor is the following question: given two random words, "how much do they have in common"? Even if this question has emerged independently in various fields, including computer …
-
The most effective way to teach spelling
… instead of useing a pre-determined collection of random words. Additionally, spelling needs to be taught within writing, not as a completely separate subject.
-
The most effective way to teach spelling
… instead of useing a pre-determined collection of random words. Additionally, spelling needs to be taught within writing, not as a completely separate subject.
-
Neural Networks and Optical Character Recognition
… data set consists of: bigrams; trigrams; random words.
-
CREATION: técnica de criatividade para geração de ideias de novos produtos
… new products, with techniques Listing and Random Words / Figures. These latter techniques were not satisfactory in its objective by presenting constraints, not covered in the description, for the participant group. Thus, it was necessary to propose a new technique for the same purpose, the …
-
The effect of using the iPad to enhance sight word acquisition of students with autism
… spectrum disorders in their acquisition of sight words and (b) examine the social validity of using the iPad in the classroom. The participants were two 2nd and two 3rd graders diagnosed with autism spectrum disorders. Baseline data was collected by evaluating student progress of sight word …
-
Topics in percolation and sequence analysis
… and further to longest common subsequences in random words. In the second part, we prove that, in directed last passage site percolation over a $n\times\lfloor n^{\alpha}\rfloor$-grid and for i.i.d.~random weights having finite support, the order of the $r$-th central moment, $1\le r<+\infty$, …
-
Toward the Combinatorial Limit Theory of free Words
Free words are elements of a free monoid, generated over an alphabet via the binary operation of concatenation. Casually speaking, a free word is a finite string of letters. Henceforth, we simply refer to them as words. Motivated by recent advances in the combinatorial limit theory of …
-
Topics in sequence analysis
… the large deviations of the shape of the random RSK Young diagrams, associated with a random word of size n whose letters are independently drawn from an alphabet of size m=m(n). When the letters are drawn uniformly and when both n and m converge together to infinity, m not growing too …
-
Combinatorial motif analysis in yeast gene promoters: the benefits of a biological consideration of motifs
… values of l and d, there will exist many sets of random words in a cluster of gene promoters that appear to form an (l, d)-motif. For these motifs, it will be impossible to distinguish biological motifs from randomly generated motifs. A better formalization of motifs is the (l, f, d)-motif that is …
-
Some New Properties of Random Groups in the Density and Few-Relator Models
… the subjects that lie in the intersection of random group theory and first-order theory, or as traditionally referred to in the field, the first-order theory of free groups (Sela (2006) and Kharlampovich and Myasnikov (2006), among others). In particular, we establish the following two …