Mustrite leidmine superpositsioonigraafides
| dc.contributor.advisor | Tombak, Mati | et |
| dc.contributor.author | Loorits, Neeme | et |
| dc.contributor.other | Tartu Ülikool. Matemaatika-informaatikateaduskond | et |
| dc.contributor.other | Tartu Ülikool. Arvutiteaduse instituut | et |
| dc.date.accessioned | 2013-09-09T09:41:22Z | |
| dc.date.available | 2013-09-09T09:41:22Z | |
| dc.date.issued | 2012 | et |
| dc.description.abstract | Kä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.abstract | This 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.identifier.uri | http://hdl.handle.net/10062/32996 | |
| dc.language.iso | en | et |
| dc.publisher | Tartu Ülikool | et |
| dc.subject.other | magistritööd | et |
| dc.subject.other | informaatika | et |
| dc.subject.other | infotehnoloogia | et |
| dc.subject.other | informatics | en |
| dc.subject.other | infotechnology | en |
| dc.title | Mustrite leidmine superpositsioonigraafides | et |
| dc.title.alternative | Pattern Matching for Superpositional Graphs | et |
| dc.type | Thesis | et |