TY - JOUR
T1 - Position heaps for permuted pattern matching on multi-track strings
AU - Katsura, Takashi
AU - Otomo, Yuhei
AU - Narisawa, Kazuyuki
AU - Shinohara, Ayumi
PY - 2015
Y1 - 2015
N2 - A multi-set of N strings of length n is called a multi-track string. The permuted pattern matching is the problem that given two multi-track strings T = {t1,⋯, tN} of length n and ℙ = {p1,⋯, pN} of length m, outputs all positions i such that {p1,⋯,pN} = {t1[i: i + m - 1],⋯, tN [i: i + m - 1]} We propose two new indexing structures for multi-track stings. One is a time-efficient structure for T that needs O(nN) space and enables us to solve the problem in O(m2 N + occ) time, where occ is the number of occurrences of the pattern ℙ in the text T. The other is memory-efficient, it requires only O(n) space, whereas the matching consumes O(m2 N2 + occ) time. We show that both of them can be constructed in O(nN) time.
AB - A multi-set of N strings of length n is called a multi-track string. The permuted pattern matching is the problem that given two multi-track strings T = {t1,⋯, tN} of length n and ℙ = {p1,⋯, pN} of length m, outputs all positions i such that {p1,⋯,pN} = {t1[i: i + m - 1],⋯, tN [i: i + m - 1]} We propose two new indexing structures for multi-track stings. One is a time-efficient structure for T that needs O(nN) space and enables us to solve the problem in O(m2 N + occ) time, where occ is the number of occurrences of the pattern ℙ in the text T. The other is memory-efficient, it requires only O(n) space, whereas the matching consumes O(m2 N2 + occ) time. We show that both of them can be constructed in O(nN) time.
KW - Indexing structure
KW - Multi-track
KW - String matching
UR - http://www.scopus.com/inward/record.url?scp=84926040458&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84926040458&partnerID=8YFLogxK
M3 - Article
AN - SCOPUS:84926040458
VL - 1326
SP - 41
EP - 53
JO - [No source information available]
JF - [No source information available]
ER -