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 20 of 37 for “"approximate string matching"”.
-
Approximate String Matching
… implementations in practice. Second, we cover approximate string matching in bidirectional indices. To improve the running time and make higher error rates suitable for index-based searches, we introduce an integer linear program for finding optimal search strategies. We show that it is …
-
Approximate string matching with pumping
… for computing edit distances between two strings is extended to compute the distance between a string and a class of strings represented by a regular expression. The result allows arbitrary pumping of symbols and substrings. The extended algorithm has the same complexity as the …
-
Approximate string matching for high-throughput sequencing
… sequencing DNA reads, based on state of the art approximate string matching algorithms and data structures. Read mapping is a fundamental step of any HTS data analysis pipeline in resequencing projects, where DNA reads are reassembled by aligning them back to a previously known reference genome. …
-
Parallel approximate string matching applied to occluded object recognition
This thesis develops an algorithm for approximate string matching and applies it to the problem of partially occluded object recognition. The algorithm measures the similarity of differing strings by scanning for matching substrings between strings. The length and number of matching substrings …
-
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 …
-
Approximate string matching methods for duplicate detection and clustering tasks
Approximate string matching methods are utilized by a vast number of duplicate detection and clustering applications in various knowledge domains. The application area is expected to grow due to the recent significant increase in the amount of digital data and knowledge sources. Despite the large …
-
A multiprocessor parallel approach to bit-parallel approximate string matching
… be successfully applied along with bit-parallel approximate string matching algorithms to solve practical bioinformatics problems. It will demonstrate that nearly optimal speedup can be achieved with a cluster of between two and eight workstations using MPI (Message Passing Interface), directly …
-
A multiprocessor parallel approach to bit-parallel approximate string matching
… be successfully applied along with bit-parallel approximate string matching algorithms to solve practical bioinformatics problems. It will demonstrate that nearly optimal speedup can be achieved with a cluster of between two and eight workstations using MPI (Message Passing Interface), directly …
-
Optimum Search Schemes for Approximate String Matching Using Bidirectional FM-Index
… is to derive optimal search schemes for approximate string matching using bidirectional FM-index, and utilize them in increasing the speed of such searches. Such a problem arises in computer science with many applications. Approximate string matching problem is also central in …
-
OCRspell: An interactive spelling correction system for OCR errors in text
… is based on static and dynamic device mappings, approximate string matching, and n-gram analysis. Our statistically based, Bayesian system incorporates a learning feature that collects confusion information at the collection and document levels. An evaluation of the new system is presented as …
-
The Automatic Grouping of Sensor Data Layers Using Semantic Clustering and Classification to Group Semantically Similar Sensor Data Layers
… bottom up approach that uses text processing, approximate string matching, and semantic string matching of data layers. Text processing includes normalization and tokenization to standardize syntactic differences in the naming. Approximate string matching techniques include Levenshtein …
-
Temporal Graph Record Linkage and k-Safe Approximate Match
… processing, using the Soundex as the primary approximate string matching method. The Soundex has been found to be unreliable both as a phonetic and as an approximate string matching method. We found that their data, in many cases, has more than one value per field, suggesting that the data …
-
String matching and indexing with suffix data structures
… text so that the occurrences of any given query string in the text can be located efficiently. An occurrence or match may be imprecise, allowing some deviations from the actual query. This gives rise to a family of interesting string matching problems like exact and approximate string matching, …
-
Reading Key Figures from Annual Reports
… extract a given key figure, it is found that an approximate string matching algorithm performs best, achieving an extraction accuracy of 92.9% on training documents and 89.6% on test documents. Accurate extraction is hampered by noise, so different image processing techniques are explored. The …
-
Improving Short DNA Sequence Alignment with Parallel Computing
… we require mapping algorithms that make use of approximate string matching and string indexing methods. To date, few mapping algorithms have been tailored to handle the massive amounts of output generated by newly available sequencing technologies. In otrder to handle this large amount of data, …
-
Advances in String Algorithms for Information Security Applications
… it comes to identifying and solving them using Stringology techniques. Different successful bioinformatics algorithms have been studied and introduced to solve different security problems such as malware detection, biometrics and big data. Firstly, we present a dynamic computer malware detection …
-
TagLine: Information Extraction for Semi-Structured Text Elements In Medical Progress Notes
… informatics. Decision trees and Levenshtein approximate string matching techniques were tested and compared on 5,055 unseen lines of text. The performance of the decision tree method was found to be superior to the fuzzy string match method on this task. Decision trees achieved an overall …
-
Structure and Evolution of Legislation Networks
… data accuracy in network analysis and improved approximate string matching techniques. We demonstrate network data-sets withmore than 98 percent precision and recall. The linear growth in legislation network size reflects a fixed capacity for parliament to pass laws. Also, the exponential growth …
Page 1 of 2