TY  - JOUR
AB  - An abelian pattern describes the set of strings that comprise of the same combination of characters. Given an abelian pattern P and a text T [Epsilon] [Sigma]^n, the task is to find all occurrences of P in T, i.e. all substrings S = T_i...T_j such that the frequency of each character in S matches the specified frequency of that character in P.
In this report we present simple online algorithms for abelian pattern matching, and give a lower bound for online algorithms which is [Omega](n).
DA  - 2008
KW  - String matching
KW  - Pattern matching
KW  - Abelian patterns
KW  - Online algorithms
KW  - Permutation patterns
KW  - Compomers
LA  - eng
PY  - 2008
SN  - 0946-7831
TI  - Online Abelian Pattern Matching
UR  - https://nbn-resolving.org/urn:nbn:de:hbz:361-14345
Y2  - 2024-11-22T02:36:06
ER  -