Faster online elastic degenerate string matching

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

4 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

Aoyama, K., Nakashima, Y., I, T., Inenaga, S., Bannai, H., & Takeda, M. (2018). Faster online elastic degenerate string matching. In B. Zhu, G. Navarro, & D. Sankoff (Eds.), 29th Annual Symposium on Combinatorial Pattern Matching, CPM 2018 (pp. 91-910). (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 105). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.CPM.2018.9

Faster online elastic degenerate string matching. / Aoyama, Kotaro; Nakashima, Yuto; I, Tomohiro; Inenaga, Shunsuke; Bannai, Hideo; Takeda, Masayuki.

29th Annual Symposium on Combinatorial Pattern Matching, CPM 2018. ed. / Binhai Zhu; Gonzalo Navarro; David Sankoff. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2018. p. 91-910 (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 105).

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

Aoyama, K, Nakashima, Y, I, T, Inenaga, S, Bannai, H & Takeda, M 2018, Faster online elastic degenerate string matching. in B Zhu, G Navarro & D Sankoff (eds), 29th Annual Symposium on Combinatorial Pattern Matching, CPM 2018. Leibniz International Proceedings in Informatics, LIPIcs, vol. 105, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, pp. 91-910, 29th Annual Symposium on Combinatorial Pattern Matching, CPM 2018, Qingdao, China, 7/2/18. https://doi.org/10.4230/LIPIcs.CPM.2018.9
Aoyama K, Nakashima Y, I T, Inenaga S, Bannai H, Takeda M. Faster online elastic degenerate string matching. In Zhu B, Navarro G, Sankoff D, editors, 29th Annual Symposium on Combinatorial Pattern Matching, CPM 2018. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. 2018. p. 91-910. (Leibniz International Proceedings in Informatics, LIPIcs). https://doi.org/10.4230/LIPIcs.CPM.2018.9
Aoyama, Kotaro ; Nakashima, Yuto ; I, Tomohiro ; Inenaga, Shunsuke ; Bannai, Hideo ; Takeda, Masayuki. / Faster online elastic degenerate string matching. 29th Annual Symposium on Combinatorial Pattern Matching, CPM 2018. editor / Binhai Zhu ; Gonzalo Navarro ; David Sankoff. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2018. pp. 91-910 (Leibniz International Proceedings in Informatics, LIPIcs).
@inproceedings{6640289347fb4d82add821aee260a52d,
title = "Faster online elastic degenerate string matching",
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.",
author = "Kotaro Aoyama and Yuto Nakashima and Tomohiro I and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda",
year = "2018",
month = "5",
day = "1",
doi = "10.4230/LIPIcs.CPM.2018.9",
language = "English",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",
pages = "91--910",
editor = "Binhai Zhu and Gonzalo Navarro and David Sankoff",
booktitle = "29th Annual Symposium on Combinatorial Pattern Matching, CPM 2018",

}

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

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

ER -