Efficient parameterized string matching

In parameterized string matching the pattern P matches a substring t of the text T if there exist a bijective mapping from the symbols of P to the symbols of t. We give simple and practical algorithms for finding all such pattern occurrences in sublinear time on average. The algorithms work for a si...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Information processing letters 2006-11, Vol.100 (3), p.91-96
Hauptverfasser:	Fredriksson, Kimmo, Mozgovoy, Maxim
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Automata. Abstract machines. Turing machines Automation Bit-parallelism Computer science control theory systems Data processing. List processing. Character string processing Exact sciences and technology Information processing Mapping Memory organisation. Data processing Parameterized string matching Software Studies Suffix automaton Theoretical computing
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	In parameterized string matching the pattern P matches a substring t of the text T if there exist a bijective mapping from the symbols of P to the symbols of t. We give simple and practical algorithms for finding all such pattern occurrences in sublinear time on average. The algorithms work for a single and multiple patterns.
ISSN:	0020-0190 1872-6119
DOI:	10.1016/j.ipl.2006.06.009