Show simple item record

dc.contributor.advisorTombak, Matiet
dc.contributor.authorLoorits, Neemeet
dc.contributor.otherTartu Ülikool. Matemaatika-informaatikateaduskondet
dc.contributor.otherTartu Ülikool. Arvutiteaduse instituutet
dc.date.accessioned2013-09-09T09:41:22Z
dc.date.available2013-09-09T09:41:22Z
dc.date.issued2012et
dc.identifier.urihttp://hdl.handle.net/10062/32996
dc.description.abstractKäesolev magistritöö esitab algoritmi mustrite leidmiseks superpositsioonigraafides. Algoritm leiab mustrite arvu ajaga O(kn), kus n on teksti pikkus ja k mustri pikkus. Samasugune ajaline keerukus kehtib ka mustrite leidmisel lahutatavates permutatsioonides.et
dc.description.abstractThis master's thesis presents a pattern matching algorithm for superpositional graphs which counts a number of matches with time complexity O(kn), where n is a length of a text and k is a length of a pattern. Consequently, the same time complexity is achieved for the case, when both text and pattern are separable permutations.et
dc.language.isoenet
dc.publisherTartu Ülikoolet
dc.subject.othermagistritöödet
dc.subject.otherinformaatikaet
dc.subject.otherinfotehnoloogiaet
dc.subject.otherinformaticsen
dc.subject.otherinfotechnologyen
dc.titleMustrite leidmine superpositsioonigraafideset
dc.title.alternativePattern Matching for Superpositional Graphset
dc.typeThesiset


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record