Episode Directed Acyclic Subsequence Graph

Result code in 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>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Episode Directed Acyclic Subsequence Graph

Original language description

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.

Czech name

Není k dispozici

Czech description

Není k dispozici

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

IN - Informatics

OECD FORD branch

—

Project

—

Continuities

Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year

2004

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

Nordic Journal of Computing

ISSN

1236-6064

e-ISSN

—

Volume of the periodical

11

Issue of the periodical within the volume

1

Country of publishing house

FI - FINLAND

Number of pages

6

Pages from-to

35-40

UT code for WoS article

—

EID of the result in the Scopus database

—