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 19 of 19 for “"String Algorithms"”.
-
Data Structures for Efficient String Algorithms
… structures that are mostly useful in the area of string matching and string mining. Our main result is an O(n)-time preprocessing scheme for an array of n numbers such that subsequent queries asking for the position of a minimum element in a specified interval can be answered in constant time …
-
Efficient String Algorithms with Applications in Bioinformatics
… structure of the genome with respect to substrings of specific length and a tolerance to define the number of mismatches. The similarity between reads is measured by using the Hamming distance function. Genome mappability is computed for each position in the string and has several …
-
Efficient String Algorithms for Data Security and Privacy
… heterogeneous data. Furthermore, highly-scalable algorithms for pattern and motif discovery for sequential pattern mining in uncertain sequence data was developed.<br/><br/>To achieve all these, we propose a novel pattern matching technique that caters for the rotational issue responsible for the …
-
Advances in String Algorithms for Information Security Applications
This thesis focuses on introducing novel algorithms in information security through studying successful algorithms in bioinformatics and adapting them to solve some open problems in information security. Although, the problems in both bioinformatics and information security are different, yet, they …
-
Parallel and scalable combinatorial string algorithms on distributed memory systems
… data are built upon combinatorial graph and string algorithms. The advent of high-throughput DNA sequencing is enabling the generation of billions of reads per experiment. Classical and sequential algorithms can no longer deal with these growing data sizes - which for the last 10 years have …
-
Approximate String Matching With Dynamic Programming and Suffix Trees
The importance and the contribution of string matching algorithms to the modern society cannot be overstated. From basic search algorithms such as spell checking and data querying, to advanced algorithms such as DNA sequencing, trend analysis and signal processing, string matching algorithms form …
-
COMPUTATIONAL REPRESENTATION OF LINGUISTIC SEMANTICS FOR REQUIREMENT ANALYSIS IN ENGINEERING DESIGN
… is defined as the meaning of words beyond their string form, part of speech, and syntactic function. Many existing design tools use part of speech tagging and sentence parsing as the foundation of their requirement analysis but ultimately use string algorithms to evaluate requirements. These …
-
RNA-protein interaction prediction: String-based versus feature-based models
… using two different schemes. The first applied string algorithms to extract the most effective string patterns from both sequences and secondary structures. This method resulted in a 93.39% prediction accuracy. The second method used a feature-based approach by combining extracted features from …
-
A Generalization of Square-free Strings
Our research is in the general area of String Algorithms and Combinatorics on Words. Specifically, we study a generalization of square-free strings, shuffle properties of strings, and formalizing the reasoning about finite strings. The existence of infinitely long square-free strings (strings with …
-
Avoided Words, Overabundant Words, Maximal Palindromes and Applicatons
The study of string algorithms is essential for computer science and computational molecular biology. Recently, a number of algorithms on strings appear in many fields, such as pattern matching, combinatorics on words, string processing and automata the-ory, because of their magnitude advances in …
-
LYNDON FACTORS AND PERIODICITIES IN STRINGS
Strings are very simple yet very applicable data structures. Their applicability ranges from modelling DNA, to modelling protein sequences, to information retrieval, to web page searches, and many more. Due to their simplicity, there are few structural properties that could be exploited for …
-
Multiple Protein Structure Alignment and its Applications
… in computational methods is the development of algorithms for aligning multiple protein structures. Although these algorithms can potentially be applied to a number of problems, they have primarily been used for protein core identification. A method that is capable of solving a variety of …
-
Algorithmic Advances in Handling Uncertainty & Regularity in Strings
… single representation is used for a multitude of strings which are by and large similar. For example, in human genomics, the reference genome has been represented as a single sequence so far. Now, with the availability of a vast collection of human genomes, the so called reference cohorts seem …
-
Novel Structural Properties and An Improved Bound for the Number Distinct Squares in a Strings
… on words explore words – often called strings in the com- puter science community, or monoids in mathematics – and their structural properties. One of the most studied question deals with repetitions which are a form of redundancy. The thesis focuses on estimating the maximum number of …
-
Markets, Elections, and Microbes: Data-driven Algorithms from Theory to Practice
Many modern problems in algorithms and optimization are driven by data which often carries with it an element of uncertainty. In this work, we conduct an investigation into algorithmic foundations and applications across three main areas. The first area is online matching algorithms for e-commerce …
-
Repeats in Strings and Application in Bioinformatics
A string is a sequence of symbols, usually called letters, drawn from some alphabet. It is one of the most fundamental and important structures in computing, bioinformatics and mathematics. Computer files, contents of a computer memory, network and satellite signals are all instances of strings. …
-
Practical algorithms for biological sequence analysis: methods and applications
… and proteins can be represented as a sequence or string of characters. In this thesis I present the work I have done to implement new heuristic and exact string algorithms and show how they can be applied with existing algorithms to perform sequence analysis. I present examples of applications of …
-
Algorithms and Lower Bounds for Ordering Problems on Strings
This dissertation presents novel algorithms and conditional lower bounds for a collection of string and text-compression-related problems. These results are unified under the theme of ordering constraint satisfaction. Utilizing the connections to ordering constraint satisfaction, we provide …