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 7 of 7 for “"Longest Common Subsequences"”.

  1. Topics on the longest common subsequences: Simulations, computations, and variance

    The study 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 …

    gatech Repository record for Topics on the longest common subsequences: Simulations, computations, and variance (opens in a new tab)

  2. Topics on the length of the longest common subsequences, with blocks, in binary random words

    The study of LIn, the length of the longest increasing subsequences, and of LCIn, the length of the 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 …

    gatech Repository record for Topics on the length of the longest common subsequences, with blocks, in binary random words (opens in a new tab)

  3. Topics in percolation and sequence analysis

    … first passage site percolation, 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 …

    gatech Repository record for Topics in percolation and sequence analysis (opens in a new tab)

  4. Utilizing Big Data in Identification and Correction of OCR Errors

    … for correction. We then use a combination of the Longest Common Subsequences (LCS) and Bayesian estimates to automatically pick the proper candidate. Our experimental results on a small set of historical newspaper data show a recall and precision of 51% and 100%, respectively. The work in this …

    unlv Repository record for Utilizing Big Data in Identification and Correction of OCR Errors (opens in a new tab) Download PDF for Utilizing Big Data in Identification and Correction of OCR Errors (opens in a new tab)

  5. Comparison of sequences generated by a hidden Markov model

    The length $LC_n$ of the longest common subsequences of two strings $X = (X_1, \ldots, X_n)$ and $Y = (Y_1, \ldots, Y_n)$ is way to measure the similarity between $X$ and $Y$. We study the asymptotic behavior of $LC_n$ when the two strings are generated by a hidden Markov model $(Z, (X, Y))$. The …

    gatech Repository record for Comparison of sequences generated by a hidden Markov model (opens in a new tab)

  6. Scientific Application Acceleration Utilizing Heterogeneous Architectures

    … learning. The third, and final, study is the longest common subsequences problem, which attempts to enumerate comparisons between sequences (namely, DNA sequences). The results for the aforementioned applications with varying problem sizes and architectural configurations are presented and …

    clemson Repository record for Scientific Application Acceleration Utilizing Heterogeneous Architectures (opens in a new tab)

  7. Mikrostimulátor

    Teoretická část diplomové práce se věnuje vysvětlení dějů, ke kterým dochází při stimulaci tkání elektrickým proudem. K popisu jevů na molekulární a buněčné úrovni je využito významné analogie s elektrickými obvody. Modely membrány a buňky jsou nezbytné pro porozumění chování komplexnějších útvarů, …

    brno-tech Repository record for Mikrostimulátor (opens in a new tab)