Results 1 
4 of
4
Binary jumbled pattern matching on trees and treelike structures
 IN PROC. OF THE 21ST ANNUAL EUROPEAN SYMPOSIUM ON ALGORITHM (ESA 2013
, 2013
"... Binary jumbled pattern matching asks to preprocess a binary string S in order to answer queries (i, j) which ask for a substring of S that is of length i and has exactly j 1bits. This problem naturally generalizes to vertexlabeled trees and graphs by replacing “substring ” with “connected subgr ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
(Show Context)
Binary jumbled pattern matching asks to preprocess a binary string S in order to answer queries (i, j) which ask for a substring of S that is of length i and has exactly j 1bits. This problem naturally generalizes to vertexlabeled trees and graphs by replacing “substring ” with “connected subgraph”. In this paper, we give an O(n2 / log2 n)time solution for trees, matching the currently best bound for (the simpler problem of) strings. We also give an O(g2/3n4/3/(logn)4/3)time solution for strings that are compressed by a grammar of size g. This solution improves the known bounds when the string is compressible under many popular compression schemes. Finally, we prove that the problem is fixedparameter tractable with respect to the treewidth w of the graph, even for a constant number of different vertexlabels, thus improving the previous best nO(w) algorithm [ICALP’07].
Proceedings of
, 2013
"... abaab abaaba ababa ababaab aa ba baabaabab aababaabaab ab aa ba ba abaa babaaba ..."
Abstract
 Add to MetaCart
(Show Context)
abaab abaaba ababa ababaab aa ba baabaabab aababaabaab ab aa ba ba abaa babaaba