Faster online elastic degenerate string matching

Kotaro Aoyama, Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

Research output: Chapter in Book/Report/Conference proceedingConference contribution

7 Citations (Scopus)

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 √mlogm+ 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(nm2 + N) time.

Original languageEnglish
Title of host publication29th Annual Symposium on Combinatorial Pattern Matching, CPM 2018
EditorsBinhai Zhu, Gonzalo Navarro, David Sankoff
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Pages91-910
Number of pages820
ISBN (Electronic)9783959770743
DOIs
Publication statusPublished - May 1 2018
Event29th Annual Symposium on Combinatorial Pattern Matching, CPM 2018 - Qingdao, China
Duration: Jul 2 2018Jul 4 2018

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume105
ISSN (Print)1868-8969

Other

Other29th Annual Symposium on Combinatorial Pattern Matching, CPM 2018
CountryChina
CityQingdao
Period7/2/187/4/18

All Science Journal Classification (ASJC) codes

  • Software

Cite this