文章基本信息

标题：Pattern Discovery in Colored Strings
本地全文：下载
作者：Zsuzsanna Lipt{'a}k ; Simon J. Puglisi ; Massimiliano Rossi 等
期刊名称：LIPIcs : Leibniz International Proceedings in Informatics
电子版ISSN：1868-8969
出版年度：2020
卷号：160
页码：12:1-12:14
DOI：10.4230/LIPIcs.SEA.2020.12
出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
摘要：We consider the problem of identifying patterns of interest in colored strings. A colored string is a string in which each position is colored with one of a finite set of colors. Our task is to find substrings that always occur followed by the same color at the same distance. The problem is motivated by applications in embedded systems verification, in particular, assertion mining. The goal there is to automatically infer properties of the embedded system from the analysis of its simulation traces. We show that the number of interesting patterns is upper-bounded by ð'ª(nÂ²) where n is the length of the string. We introduce a baseline algorithm with ð'ª(nÂ²) running time which identifies all interesting patterns for all colors in the string satisfying certain minimality conditions. When one is interested in patterns related to only one color, we provide an algorithm that identifies patterns in ð'ª(nÂ²log n) time, but is faster than the first algorithm in practice, both on simulated and on real-world patterns.
关键词：property testing; suffix tree; pattern mining