Iskalni niz:
išči po
išči po
išči po
išči po
Vrsta gradiva:
Jezik:
Št. zadetkov: 2
Izvirni znanstveni članek
Oznake: longest common subsequences;constrained sequences;combinatorial problems;
The constrained longest common subsequence (CLCS) problem was introduced as a specific measure of similarity between molecules. It is a special case of the constrained sequence alignment problem and of the longest common subsequence (LCS) problem, which are both well-studied problems in the scientif ...
Leto: 2021 Vir: Repozitorij Univerze v Novi Gorici (RUNG)
Objavljeni znanstveni prispevek na konferenci
Oznake: longest common subsequences;constrained subsequences;beam search;
Given a set of two input strings and a pattern string, the constrained longest common subsequence problem deals with finding a longest string that is a subsequence of both input strings and that contains the given pattern string as a subsequence. This problem has various applications, especially in ...
Leto: 2020 Vir: Repozitorij Univerze v Novi Gorici (RUNG)
Št. zadetkov: 2
Ključne besede:
Leto izdaje:
Avtorji:
Repozitorij:
Tipologija:
Jezik: