Permuted pattern matching algorithms on multi-track strings
From MaRDI portal
Publication:2003324
DOI10.3390/a12040073zbMath1461.68267OpenAlexW2936029001MaRDI QIDQ2003324
Ryo Yoshinaka, Diptarama Hendrian, Kazuyuki Narisawa, Ayumi Shinohara, Yohei Ueki
Publication date: 8 July 2019
Published in: Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3390/a12040073
Cites Work
- Unnamed Item
- Generalized pattern matching and periodicity under substring consistent equivalence relations
- Position heaps: a simple and dynamic text indexing data structure
- AC-automaton update algorithm for semi-dynamic dictionary matching
- Permuted Pattern Matching on Multi-track Strings
- A fast string searching algorithm
- Suffix Arrays: A New Method for On-Line String Searches
- Efficient randomized pattern-matching algorithms
- Efficient string matching
- Fast Pattern Matching in Strings
- Filtering Multi-set Tree: Data Structure for Flexible Matching Using Multi-track Data
This page was built for publication: Permuted pattern matching algorithms on multi-track strings