Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CPM.2018.9
URN: urn:nbn:de:0030-drops-87016
URL: https://drops.dagstuhl.de/opus/volltexte/2018/8701/
Aoyama, Kotaro ; Nakashima, Yuto ; I, Tomohiro ; Inenaga, Shunsuke ; Bannai, Hideo ; Takeda, Masayuki
Faster Online Elastic Degenerate String Matching
| pdf-format: |
|
Abstract
An Elastic-Degenerate String [Iliopoulus et al., LATA 2017] is a sequence of sets of strings, which was recently proposed as a way to model a set of similar sequences. We give an online algorithm for the Elastic-Degenerate String Matching (EDSM) problem that runs in O(nm sqrt{m log m} + N) time and O(m) working space, where n is the number of elastic degenerate segments of the text, N is the total length of all strings in the text, and m is the length of the pattern. This improves the previous algorithm by Grossi et al. [CPM 2017] that runs in O(nm^2 + N) time.
BibTeX - Entry
@InProceedings{aoyama_et_al:LIPIcs:2018:8701,
author = {Kotaro Aoyama and Yuto Nakashima and Tomohiro I and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda},
title = {{Faster Online Elastic Degenerate String Matching}},
booktitle = {Annual Symposium on Combinatorial Pattern Matching (CPM 2018)},
pages = {9:1--9:10},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-074-3},
ISSN = {1868-8969},
year = {2018},
volume = {105},
editor = {Gonzalo Navarro and David Sankoff and Binhai Zhu},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2018/8701},
URN = {urn:nbn:de:0030-drops-87016},
doi = {10.4230/LIPIcs.CPM.2018.9},
annote = {Keywords: elastic degenerate pattern matching, boolean convolution}
}
| Keywords: | elastic degenerate pattern matching, boolean convolution | |
| Seminar: | Annual Symposium on Combinatorial Pattern Matching (CPM 2018) | |
| Issue date: | 2018 | |
| Date of publication: | 18.05.2018 |
