The Constrained Longest Common Subsequence Problem for Degenerate Strings

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F07%3A03133390" target="_blank" >RIV/68407700:21230/07:03133390 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

The Constrained Longest Common Subsequence Problem for Degenerate Strings

Popis výsledku v původním jazyce

In this paper, we present a finite automata based algorithm for solving the constrained longest common subsequence problem for degenerate strings. A string is a sequence of symbols from a given alphabet. A subsequence u of a string x is obtained by deleting some characters from x (not necessarily contiguous). Given two strings x and y, u is a common subsequence of x and y, if u is a subsequence of both x and y. And, u is a longest common subsequence (LCS) of x and y, if it is the longest among all suchsubsequences. Given two strings x and y, the LCS problem aims to compute a longest common subsequence of them. We study a newer variant of the classic LCS problem, namely the Constrained LCS problem (CLCS). In CLCS, the computed longest common subsequence must also be a supersequence of a third given string, say z.

Název v anglickém jazyce

The Constrained Longest Common Subsequence Problem for Degenerate Strings

Popis výsledku anglicky

In this paper, we present a finite automata based algorithm for solving the constrained longest common subsequence problem for degenerate strings. A string is a sequence of symbols from a given alphabet. A subsequence u of a string x is obtained by deleting some characters from x (not necessarily contiguous). Given two strings x and y, u is a common subsequence of x and y, if u is a subsequence of both x and y. And, u is a longest common subsequence (LCS) of x and y, if it is the longest among all suchsubsequences. Given two strings x and y, the LCS problem aims to compute a longest common subsequence of them. We study a newer variant of the classic LCS problem, namely the Constrained LCS problem (CLCS). In CLCS, the computed longest common subsequence must also be a supersequence of a third given string, say z.

Druh

D - Stať ve sborníku

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

<a href="/cs/project/GA201%2F06%2F1039" target="_blank" >GA201/06/1039: Analýza a zpracování textu</a><br>

Návaznosti

Z - Vyzkumny zamer (s odkazem do CEZ)

Rok uplatnění

2007

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ů

Název statě ve sborníku

Twelfth International Conference on Implementation and Application of Automata

ISBN

978-3-540-76335-2

ISSN

—

e-ISSN

—

Počet stran výsledku

3

Strana od-do

309-311

Název nakladatele

Springer-Verlag

Místo vydání

Berlin

Místo konání akce

Prague

Datum konání akce

16. 7. 2007

Typ akce podle státní příslušnosti

EUR - Evropská akce

Kód UT WoS článku

—