TY - GEN

T1 - Faster online elastic degenerate string matching

AU - Aoyama, Kotaro

AU - Nakashima, Yuto

AU - I, Tomohiro

AU - Inenaga, Shunsuke

AU - Bannai, Hideo

AU - Takeda, Masayuki

N1 - Funding Information:
Acknowledgements This work was supported by JSPS KAKENHI Grant Numbers JP17H06923 (YN), JP17H01697 (SI), JP16H02783 (HB), and JP25240003 (MT).
Publisher Copyright:
© 2018 Yoshifumi Sakai; licensed under Creative Commons License CC-BY.

PY - 2018/5/1

Y1 - 2018/5/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85048268511&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85048268511&partnerID=8YFLogxK

U2 - 10.4230/LIPIcs.CPM.2018.9

DO - 10.4230/LIPIcs.CPM.2018.9

M3 - Conference contribution

AN - SCOPUS:85048268511

T3 - Leibniz International Proceedings in Informatics, LIPIcs

SP - 91

EP - 910

BT - 29th Annual Symposium on Combinatorial Pattern Matching, CPM 2018

A2 - Zhu, Binhai

A2 - Navarro, Gonzalo

A2 - Sankoff, David

PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing

T2 - 29th Annual Symposium on Combinatorial Pattern Matching, CPM 2018

Y2 - 2 July 2018 through 4 July 2018

ER -