Authors: Ejaz, Tahir
Title: Abelian pattern matching in strings
Language (ISO): en
Abstract: Abelian pattern matching is a new class of pattern matching problems. In abelian patterns, the order of the characters in the substrings does not matter, e.g. the strings abbc and babc represent the same abelian pattern a+2b+c. Therefore, unlike classical pattern matching, we do not look for an exact (ordered) occurrence of a substring, rather the aim here is to find any permutation of a given combination of characters that represents the given abelian pattern. In this thesis, we study the problem of abelian pattern matching in strings in a systematic manner, and present several algorithms for exact as well as approximate abelian pattern matching. We also present different strategies for indexing the input text to make the abelian pattern matching more efficient.
Subject Headings: Abelian patterns
permutation patterns
pattern matching
Subject Headings (RSWK): Mustervergleich
Issue Date: 2010-06-29
Appears in Collections:LS 11

Files in This Item:
File Description SizeFormat 
PhD_Thesis.pdfDNB1.16 MBAdobe PDFView/Open
PhD_Thesis.ps1.74 MBPostscriptView/Open

This item is protected by original copyright

Items in Eldorado are protected by copyright, with all rights reserved, unless otherwise indicated.