Iskalni niz:
išči po
išči po
išči po
išči po
Vrsta gradiva:
Jezik:
Št. zadetkov: 3
Efficient search algorithms for the restricted longest common subsequence problem
Marko Djukanović, Aleksandar Kartelj, Tome Eftimov, Jaume Reixach, C. Blum
Objavljeni znanstveni prispevek na konferenci
Oznake: računalništvo;internet;algoritmi;
This paper deals with the restricted longest common subsequence (RLCS) problem, an extension of the well-studied longest common subsequence problem involving two sets of strings: the input strings and the restricted strings. This problem has applications in bioinformatics, particularly in identifyin ...
Leto: 2024 Vir: Univerza v Novi Gorici (UNG)
ǂA ǂbiased random key genetic algorithm for solving the longest common square subsequence problem
Jaume Reixach, Christian Blum, Marko Djukanović, Günther R. Raidl
Izvirni znanstveni članek
Oznake: Beam search;BS;genetic algorithms;GAs;greedy information;longest common subsequences;LCSs;
This article considers the longest common square subsequence (LCSqS) problem, a variant of the longest common subsequence (LCS) problem in which solutions must be square strings. A square string can be expressed as the concatenation of a string with itself. The LCSqS problem has applications in bioi ...
Leto: 2025 Vir: Repozitorij Univerze v Novi Gorici (RUNG)
ǂA ǂneural network based guidance for a BRKGA
Jaume Reixach, Christian Blum, Marko Djukanović, Günther R. Raidl
Objavljeni znanstveni prispevek na konferenci
Oznake: genetic algorithms;neural networks;longest common subsequences;beam search;
In this work we apply machine learning to better guide a biased random key genetic algorithm (Brkga) for the longest common square subsequence (LCSqS) problem. The problem is a variant of the well-known longest common subsequence (LCS) problem in which valid solutions are square strings. A string is ...
Leto: 2024 Vir: Repozitorij Univerze v Novi Gorici (RUNG)
Št. zadetkov: 3
Ključne besede:
Leto izdaje:
Avtorji:
Repozitorij:
Tipologija:
Jezik: