## Abstract

Multi-track string is an N-tuple strings of length n. For two multi-track strings T = (t_{1}; t_{2};⋯; t_{N}) of length n and ℙ = (p_{1}; p_{2}; ⋯, p_{M}) of length m, permuted pattern matching is a problem to find all positions i such that ℙ is permuted match with T[i : i+M]. We propose three new algorithms for permuted pattern matching based on the KMP algorithm. The first algorithm is an exact matching algorithm that runs in O(nN) time after O(mM)-time preprocessing. The second and third algorithms are filtering algorithms that run in O(n(N + σ)) after O(m(M + σ))-time preprocessing, where σ is the size of alphabet. Experiments show that our algorithms run faster than AC automaton based algorithm that proposed by Katsura et al. [5].

Original language | English |
---|---|

Pages (from-to) | 100-107 |

Number of pages | 8 |

Journal | CEUR Workshop Proceedings |

Volume | 1548 |

Publication status | Published - 2016 |

Event | Student Research Forum Papers and Posters at SOFSEM 2016, SOFSEM-SP 2016 - Harrachov, Czech Republic Duration: 2016 Jan 23 → 2016 Jan 28 |

## Keywords

- KMP algorithm
- Multi-track
- String matching

## ASJC Scopus subject areas

- Computer Science(all)