Counting parameterized border arrays for a binary alphabet

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

24 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationLanguage and Automata Theory and Applications - Third International Conference, LATA 2009, Proceedings
PublisherSpringer Verlag
Pages422-433
Number of pages12
ISBN (Print)9783642009815
DOIs
Publication statusPublished - Jan 1 2009
Event3rd International Conference on Language and Automata Theory and Applications, LATA 2009 - Tarragona, Spain
Duration: Apr 2 2009Apr 8 2009

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5457
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other3rd International Conference on Language and Automata Theory and Applications, LATA 2009
CountrySpain
CityTarragona
Period4/2/094/8/09

Fingerprint

Counting
Binary
Pattern matching
Pattern Matching
Matching Problem
Linear-time Algorithm
Strings
Matching Algorithm
Bijection
Linear Time
Sharing
Valid
Verify
Analogue
Integer
Output

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

I, T., Inenaga, S., Bannai, H., & Takeda, M. (2009). Counting parameterized border arrays for a binary alphabet. In Language and Automata Theory and Applications - Third International Conference, LATA 2009, Proceedings (pp. 422-433). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5457). Springer Verlag. https://doi.org/10.1007/978-3-642-00982-2_36

Counting parameterized border arrays for a binary alphabet. / I, Tomohiro; Inenaga, Shunsuke; Bannai, Hideo; Takeda, Masayuki.

Language and Automata Theory and Applications - Third International Conference, LATA 2009, Proceedings. Springer Verlag, 2009. p. 422-433 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5457).

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

I, T, Inenaga, S, Bannai, H & Takeda, M 2009, Counting parameterized border arrays for a binary alphabet. in Language and Automata Theory and Applications - Third International Conference, LATA 2009, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5457, Springer Verlag, pp. 422-433, 3rd International Conference on Language and Automata Theory and Applications, LATA 2009, Tarragona, Spain, 4/2/09. https://doi.org/10.1007/978-3-642-00982-2_36
I T, Inenaga S, Bannai H, Takeda M. Counting parameterized border arrays for a binary alphabet. In Language and Automata Theory and Applications - Third International Conference, LATA 2009, Proceedings. Springer Verlag. 2009. p. 422-433. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-00982-2_36
I, Tomohiro ; Inenaga, Shunsuke ; Bannai, Hideo ; Takeda, Masayuki. / Counting parameterized border arrays for a binary alphabet. Language and Automata Theory and Applications - Third International Conference, LATA 2009, Proceedings. Springer Verlag, 2009. pp. 422-433 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{9072d03f39224bc1b0da618275071d99,
title = "Counting parameterized border arrays for a binary alphabet",
abstract = "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.",
author = "Tomohiro I and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda",
year = "2009",
month = "1",
day = "1",
doi = "10.1007/978-3-642-00982-2_36",
language = "English",
isbn = "9783642009815",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "422--433",
booktitle = "Language and Automata Theory and Applications - Third International Conference, LATA 2009, Proceedings",
address = "Germany",

}

TY - GEN

T1 - Counting parameterized border arrays for a binary alphabet

AU - I, Tomohiro

AU - Inenaga, Shunsuke

AU - Bannai, Hideo

AU - Takeda, Masayuki

PY - 2009/1/1

Y1 - 2009/1/1

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

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

UR - http://www.scopus.com/inward/record.url?scp=67649999065&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=67649999065&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-00982-2_36

DO - 10.1007/978-3-642-00982-2_36

M3 - Conference contribution

AN - SCOPUS:67649999065

SN - 9783642009815

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 422

EP - 433

BT - Language and Automata Theory and Applications - Third International Conference, LATA 2009, Proceedings

PB - Springer Verlag

ER -