Abelian pattern matching in strings

dc.contributor.advisor	Rahmann, Sven
dc.contributor.author	Ejaz, Tahir
dc.contributor.referee	Böcker, Sebastian
dc.date.accepted	2010-01-11
dc.date.accessioned	2010-06-29T14:41:02Z
dc.date.available	2010-06-29T14:41:02Z
dc.date.issued	2010-06-29
dc.description.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.	en
dc.identifier.uri	http://hdl.handle.net/2003/27280
dc.identifier.uri	http://dx.doi.org/10.17877/DE290R-15618
dc.identifier.urn	urn:nbn:de:hbz:290-2003/27280-1
dc.language.iso	en	de
dc.subject	Abelian patterns	en
dc.subject	permutation patterns	en
dc.subject	pattern matching	en
dc.subject.ddc	004
dc.subject.rswk	Mustervergleich	de
dc.subject.rswk	Algorithmus	de
dc.title	Abelian pattern matching in strings	en
dc.type	Text	de
dc.type.publicationtype	doctoralThesis	de
dcterms.accessRights	open access

Files

Now showing 1 - 2 of 2

Now showing 1 - 1 of 1