Není k dispozici

Kód výsledku v IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F04%3A03100391" target="_blank" >RIV/68407700:21230/04:03100391 - isvavai.cz</a>
Výsledek na webu
—
DOI - Digital Object Identifier
—

Jazyk výsledku
angličtina
Název v původním jazyce
Episode Directed Acyclic Subsequence Graph
Popis výsledku v původním jazyce
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.
Název v anglickém jazyce
Episode Directed Acyclic Subsequence Graph
Popis výsledku anglicky
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.

Druh
J<sub>x</sub> - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
CEP obor
IN - Informatika
OECD FORD obor
—

Rok uplatnění
2004
Kód důvěrnosti údajů
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Podobné výsledky(10)