Simon's congruence pattern matching

The Simon's congruence problem is to determine whether or not two strings have the same set of subsequences of length no greater than a given integer, and the problem can be answered in linear time. We consider the Simon's congruence pattern matching problem that looks for all substrings o...

Celý popis

Podrobná bibliografia

Vydané v:	Theoretical computer science Ročník 994; s. 114478
Hlavní autori:	Kim, Sungmin, Ko, Sang-Ki, Han, Yo-Sub
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 01.05.2024
Predmet:	Data structure Pattern matching Simon's congruence String algorithm String algorithm Simon's congruence Data structure Pattern matching
ISSN:	0304-3975, 1879-2294
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!