### 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(nm^{2} + N) time.

Original language | English |
---|---|

Title of host publication | 29th Annual Symposium on Combinatorial Pattern Matching, CPM 2018 |

Editors | Binhai Zhu, Gonzalo Navarro, David Sankoff |

Publisher | Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing |

Pages | 91-910 |

Number of pages | 820 |

ISBN (Electronic) | 9783959770743 |

DOIs | |

Publication status | Published - May 1 2018 |

Event | 29th Annual Symposium on Combinatorial Pattern Matching, CPM 2018 - Qingdao, China Duration: Jul 2 2018 → Jul 4 2018 |

### Publication series

Name | Leibniz International Proceedings in Informatics, LIPIcs |
---|---|

Volume | 105 |

ISSN (Print) | 1868-8969 |

### Other

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

Country | China |

City | Qingdao |

Period | 7/2/18 → 7/4/18 |

### All Science Journal Classification (ASJC) codes

- Software

### Cite this

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

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*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

}

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 -