ArchivIA - Archivio istituzionale dell'Universita' di Catania >
Tesi >
Tesi di dottorato >
Area 01 - Scienze matematiche e informatiche >
Utilizza questo identificativo per citare o creare un link a questo documento:
http://hdl.handle.net/10761/186
|
Data: | 4-mag-2011 |
Autori: | Giaquinta, Emanuele |
Titolo: | Advancements in finite-state methods for string matching |
Abstract: | This thesis illustrates some advancements in finite-state methods for solving the string-matching problem and some of its variants. Finite-state automata are central building blocks in string matching algorithms. In particular, the ones relevant for the present study are the Knuth-Morris-Pratt and the suffix automaton as well as their generalizations for the multiple-string-matching problem, i.e., the Aho-Corasick automaton and the automaton induced from the DAWG (Directed Acyclic Word Graph) for a set of strings. In this work I present novel encodings, based on the bit-parallelism technique, of the nondeterministic versions of the aforementioned automata and also illustrate two methods to parallelize a recent algorithm based on the nondeterministic suffix automaton. I further discuss the approximate-string-matching problem. I also show a new simple result concerning the pattern-matching-with-swaps problem and present a new distance function that is defined in terms of edit operations which involve strings rather than single characters. I also present an algorithm, based on dynamic programming and on the DAWG, to solve the approximate-string-matching problem under this distance. I finally discuss the compressed-string-matching problem and present novel results that concern searching in texts encoded with Huffman codes and with the Burrows-Wheeler transform. |
In | Area 01 - Scienze matematiche e informatiche
|
Full text:
File |
Dimensioni | Formato | Consultabilità |
phd_thesis.pdf | 1,41 MB | Adobe PDF | Visualizza/apri
|
|
Tutti i documenti archiviati in ArchivIA sono protetti da copyright. Tutti i diritti riservati.
|