Directed Acyclic Subsequence Graph - overview

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F03%3A03089712" target="_blank" >RIV/68407700:21230/03:03089712 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Directed Acyclic Subsequence Graph - overview

Original language description

The subsequence matching problem is to decide, for given strings S and T, whether S is a subsequence of T. The string S is called the pattern and the string T the text. We consider the case of multiple texts and show how to solve the subsequence matchingproblem in time linear in the length of the pattern. For this purpose we build an automaton that accepts all subsequences of given texts. We prove an upper bound for its number of states. Furthermore, we consider a modification of the subsequence matching problem: given a string S and a finite language L, we are to decide whether S is a subsequence of any string in L.

Czech name

—

Czech description

—

Type

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

CEP classification

JD - Use of computers, robotics and its application

OECD FORD branch

—

Project

<a href="/en/project/GA201%2F01%2F1433" target="_blank" >GA201/01/1433: Pattern Matching</a><br>

Continuities

Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year

2003

Confidentiality

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

Name of the periodical

Journal of Discrete Algorithms

ISSN

1570-8667

e-ISSN

—

Volume of the periodical

1

Issue of the periodical within the volume

3-4

Country of publishing house

DE - GERMANY

Number of pages

26

Pages from-to

255-280

UT code for WoS article

—

EID of the result in the Scopus database

—