Sprungmarken

Servicenavigation

Eldorado - Resources for and from Research, Teaching and Studying

Hauptnavigation

Bereichsnavigation

Eldorado >
Fakultäten >
04 Fakultät für Informatik >
LS 11 >

Please use this identifier to cite or link to this item: http://hdl.handle.net/2003/27280

View Statistics View Statistics
Authors: Ejaz, Tahir
Title: Abelian pattern matching in strings
Language: English
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
Algorithmus
Issue Date: 2010-06-29
Appears in Collections:LS 11

Files in This Item:

File SizeFormat
PhD_Thesis.pdf1.16 MBAdobe PDFView/Open
PhD_Thesis.ps1.74 MBPostscriptView/Open

 



All resources in the repository are protected by copyright.  Feedback | University Library and ITMC of the Technische Universität Dortmund - Impressum