New variants of pattern matching with constants and variables

研究成果: Conference contribution

抄録

Given a text and a pattern over two types of symbols called constants and variables, the parameterized pattern matching problem is to find all occurrences of substrings of the text that the pattern matches by substituting a variable in the text for each variable in the pattern, where the substitution should be injective. The function matching problem is a variant of it that lifts the injection constraint. In this paper, we discuss variants of those problems, where one can substitute a constant or a variable for each variable of the pattern. We give two kinds of algorithms for both problems, a convolution-based method and an extended KMP-based method, and analyze their complexity.

本文言語English
ホスト出版物のタイトルSOFSEM 2018
ホスト出版物のサブタイトルTheory and Practice of Computer Science - 44th International Conference on Current Trends in Theory and Practice of Computer Science, Proceedings
編集者Jirí Wiedermann, A Min Tjoa, Stefan Biffl, Ladjel Bellatreche, Jan van Leeuwen
出版社Springer Verlag
ページ611-623
ページ数13
ISBN(印刷版)9783319731162
DOI
出版ステータスPublished - 2018
イベント44th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2018 - Krems, Austria
継続期間: 2018 1 292018 2 2

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
10706 LNCS
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

Other

Other44th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2018
国/地域Austria
CityKrems,
Period18/1/2918/2/2

ASJC Scopus subject areas

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「New variants of pattern matching with constants and variables」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル