Counting parameterized border arrays for a binary alphabet

Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

研究成果: Chapter in Book/Report/Conference proceedingConference contribution

26 被引用数 (Scopus)

抄録

The parameterized pattern matching problem is a kind of pattern matching problem, where a pattern is considered to occur in a text when there exists a renaming bijection on the alphabet with which the pattern can be transformed into a substring of the text. A parameterized border array (p-border array) is an analogue of a border array of a standard string, which is also known as the failure function of the Morris-Pratt pattern matching algorithm. In this paper we present a linear time algorithm to verify if a given integer array is a valid p-border array for a binary alphabet. We also show a linear time algorithm to compute all binary parameterized strings sharing a given p-border array. In addition, we give an algorithm which computes all p-border arrays of length at most n, where n is a a given threshold. This algorithm runs in time linear in the number of output p-border arrays.

本文言語英語
ホスト出版物のタイトルLanguage and Automata Theory and Applications - Third International Conference, LATA 2009, Proceedings
出版社Springer Verlag
ページ422-433
ページ数12
ISBN(印刷版)9783642009815
DOI
出版ステータス出版済み - 1 1 2009
イベント3rd International Conference on Language and Automata Theory and Applications, LATA 2009 - Tarragona, スペイン
継続期間: 4 2 20094 8 2009

出版物シリーズ

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

その他

その他3rd International Conference on Language and Automata Theory and Applications, LATA 2009
国/地域スペイン
CityTarragona
Period4/2/094/8/09

All Science Journal Classification (ASJC) codes

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

フィンガープリント

「Counting parameterized border arrays for a binary alphabet」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル