"Nen\u00ED k dispozici"@cs . "11" . . "Nen\u00ED k dispozici"@cs . . "RIV/68407700:21230/04:03100391!RIV/2005/MSM/212305/N" . . "35 ; 40" . . . "Given two strings, pattern P and text T, episode substring of P in T is a minimal substring of T that contains P as a subsequence. The episode matching problem is to find all episode substrings. We present a new data structure called Episode Directed Acyclic Subsequence Graph that can be used to solve the problem very quickly. With the structure, we can find for example all episode substrings or the shortest episode substring in O(mw) time where m is the length of the pattern and w is the number of episode substrings found."@en . "563053" . . "Z(MSM 212300014)" . "FI - Finsk\u00E1 republika" . "episode matching; finite automata; subsequences"@en . "Episode Directed Acyclic Subsequence Graph" . "Nen\u00ED k dispozici"@cs . "21230" . . . . . "Episode Directed Acyclic Subsequence Graph"@en . . "Episode Directed Acyclic Subsequence Graph" . "[C0983C154097]" . "6"^^ . "1"^^ . "1"^^ . "Given two strings, pattern P and text T, episode substring of P in T is a minimal substring of T that contains P as a subsequence. The episode matching problem is to find all episode substrings. We present a new data structure called Episode Directed Acyclic Subsequence Graph that can be used to solve the problem very quickly. With the structure, we can find for example all episode substrings or the shortest episode substring in O(mw) time where m is the length of the pattern and w is the number of episode substrings found." . "RIV/68407700:21230/04:03100391" . . "Episode Directed Acyclic Subsequence Graph"@en . . "Nordic Journal of Computing" . "1" . . "1236-6064" . "Tron\u00ED\u010Dek, Zden\u011Bk" . .