Št. zadetkov: 18
Izvirni znanstveni članek
Oznake:
number partitioning problem;hybrid metaheuristics;MILP models;local search;
The multidimensional multi-way number partitioning problem takes as input a set of n vectors with a fixed dimension m≥2, and aims to find a partitioning of this set into k≥2 non-empty subsets, such that the sums per coordinate across all subsets are as similar as possible. The problem has applicatio ...
Leto:
2023
Vir:
Repozitorij Univerze v Novi Gorici (RUNG)
Izvirni znanstveni članek
Oznake:
longest common subsequence problem;hybrid metaheuristic;beam search;anytime column search;
The Longest Common Subsequence (LCS) problem aims at finding a longest string that is a subsequence of each string from a given set of input strings. This problem has applications, in particular, in the context of bioinformatics, where strings represent DNA or protein sequences. Existing approaches ...
Leto:
2020
Vir:
Repozitorij Univerze v Novi Gorici (RUNG)
Doktorska disertacija
Oznake:
combinatorial optimization;stringology;bioinformatics;anytime algorithms;best-first search;beam search;maximum clique problem;variable neighbourhood search;hybrid metaheuristics;
This thesis provides several new algorithms for solving prominent string problems from the literature, most of these being variants of the well-known longest common subsequence (LCS) problem. Given a set of input strings, a longest common subsequence is a string of maximum length that can be obtaine ...
Leto:
2020
Vir:
Repozitorij Univerze v Novi Gorici (RUNG)
Izvirni znanstveni članek
Oznake:
longest common palindromic;subsequence problem;anytime algorithms;beam search;hybrid algorithms;
The longest common palindromic subsequence (LCPS) problem aims at finding a longest string that appears as a subsequence in each of a set of input strings and is a palindrome at the same time. The problem is a special variant of the well known longest common subsequence problem and has applications ...
Leto:
2020
Vir:
Repozitorij Univerze v Novi Gorici (RUNG)
Objavljeni znanstveni prispevek na konferenci
Oznake:
string problems;expected value;beam search;
The longest common subsequence problem (LCS) aims at finding a longest string that appears as subsequence in each of a given set of input strings. This is a well known -hard problem which has been tackled by many heuristic approaches. Among them, the best performing ones are based on beam search (BS ...
Leto:
2019
Vir:
Repozitorij Univerze v Novi Gorici (RUNG)
Objavljeni znanstveni prispevek na konferenci
Oznake:
longest common subsequence problem;reduced variable neighborhood search;beam search;hybrid metaheuristic;expected value;
The longest common square subsequence (LCSqS) problem, a variant of the longest common subsequence (LCS) problem, aims at finding a subsequence common to all input strings that is, at the same time, a square subsequence. So far the LCSqS was solved only for two input strings. We present a heuristic ...
Leto:
2020
Vir:
Repozitorij Univerze v Novi Gorici (RUNG)
Objavljeni znanstveni prispevek na konferenci
Oznake:
longest common palindromic subsequence problem;A* search;beam search;hybrid optimization techniques;
The longest common palindromic subsequence (LCPS) problem requires to find a longest palindromic string that appears as subsequence in each string from a given set of input strings. The algorithms that can be found in the related literature are specific for LCPS problems with only two input strings. ...
Leto:
2019
Vir:
Repozitorij Univerze v Novi Gorici (RUNG)
Objavljeni znanstveni prispevek na konferenci
Oznake:
A* search;artificial intelligence;longest common subsequence;
This paper considers the constrained longest common subsequence problem with an arbitrary set of input strings and an arbitrary set of pattern strings as input. The problem has applications, for example, in computational biology, serving as a measure of similarity among different molecules that are ...
Leto:
2022
Vir:
Repozitorij Univerze v Novi Gorici (RUNG)
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)
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)