Please use this identifier to cite or link to this item:
http://hdl.handle.net/11375/29309
Title: | PATTERN MATCHING ON INDETERMINATE STRINGS WITH PREFIX ARRAYS |
Authors: | Dehghani, Hossein |
Advisor: | Mhaskar, Neerja |
Department: | Computing and Software |
Keywords: | Pattern_matching_algorithms;Algorithms |
Publication Date: | 2024 |
Abstract: | Uncertainty is prevalent in diverse datasets. This uncertainty is modelled by a string generalization termed as indeterminate string – a string containing one or more sub- sets of the alphabet as letters (known as indeterminate letters). In this thesis we revisit the pattern matching problem on indeterminate strings. We introduce innovative algorithms leveraging established techniques like KMP and BM, coupled with an exhaustive experimental evaluation focusing on both time complexity and runtime performance. Additionally, the thesis explores a novel encoding methodology for indeterminate strings, assessing its impact on runtime efficiency. Through rigorous analysis and experimentation, this study not only expands the theoretical framework of indeterminate pattern matching but also provides practical insights that will impact data processing in real-world applications. |
URI: | http://hdl.handle.net/11375/29309 |
Appears in Collections: | Open Access Dissertations and Theses |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
PATTERN MATCHING ON INDETERMINATE STRINGS.pdf | 1.15 MB | Adobe PDF | View/Open |
Items in MacSphere are protected by copyright, with all rights reserved, unless otherwise indicated.