Faster online elastic degenerate string matching

研究成果: 著書/レポートタイプへの貢献会議での発言

4 引用 (Scopus)

抄録

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.

元の言語英語
ホスト出版物のタイトル29th Annual Symposium on Combinatorial Pattern Matching, CPM 2018
編集者Binhai Zhu, Gonzalo Navarro, David Sankoff
出版者Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ページ91-910
ページ数820
ISBN(電子版)9783959770743
DOI
出版物ステータス出版済み - 5 1 2018
イベント29th Annual Symposium on Combinatorial Pattern Matching, CPM 2018 - Qingdao, 中国
継続期間: 7 2 20187 4 2018

出版物シリーズ

名前Leibniz International Proceedings in Informatics, LIPIcs
105
ISSN(印刷物)1868-8969

その他

その他29th Annual Symposium on Combinatorial Pattern Matching, CPM 2018
中国
Qingdao
期間7/2/187/4/18

All Science Journal Classification (ASJC) codes

  • Software

これを引用

Aoyama, K., Nakashima, Y., Tomohiro, I., Inenaga, S., Bannai, H., & Takeda, M. (2018). Faster online elastic degenerate string matching. : B. Zhu, G. Navarro, & D. Sankoff (版), 29th Annual Symposium on Combinatorial Pattern Matching, CPM 2018 (pp. 91-910). (Leibniz International Proceedings in Informatics, LIPIcs; 巻数 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; Tomohiro, I.; Inenaga, Shunsuke; Bannai, Hideo; Takeda, Masayuki.

29th Annual Symposium on Combinatorial Pattern Matching, CPM 2018. 版 / 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; 巻 105).

研究成果: 著書/レポートタイプへの貢献会議での発言

Aoyama, K, Nakashima, Y, Tomohiro, I, Inenaga, S, Bannai, H & Takeda, M 2018, Faster online elastic degenerate string matching. : B Zhu, G Navarro & D Sankoff (版), 29th Annual Symposium on Combinatorial Pattern Matching, CPM 2018. Leibniz International Proceedings in Informatics, LIPIcs, 巻. 105, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, pp. 91-910, 29th Annual Symposium on Combinatorial Pattern Matching, CPM 2018, Qingdao, 中国, 7/2/18. https://doi.org/10.4230/LIPIcs.CPM.2018.9
Aoyama K, Nakashima Y, Tomohiro I, Inenaga S, Bannai H, Takeda M. Faster online elastic degenerate string matching. : Zhu B, Navarro G, Sankoff D, 編集者, 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 ; Tomohiro, I. ; Inenaga, Shunsuke ; Bannai, Hideo ; Takeda, Masayuki. / Faster online elastic degenerate string matching. 29th Annual Symposium on Combinatorial Pattern Matching, CPM 2018. 編集者 / 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 I. Tomohiro 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 - Tomohiro, I.

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

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 -