Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Marko Djukanović"'
Autor:
Aleksandar Kartelj, Marko Djukanović
Publikováno v:
Journal of Big Data, Vol 10, Iss 1, Pp 1-28 (2023)
Abstract In this paper, we solve the well-known symbolic regression problem that has been intensively studied and has a wide range of applications. To solve it, we propose an efficient metaheuristic-based approach, called RILS-ROLS. RILS-ROLS is base
Externí odkaz:
https://doaj.org/article/b7a031cefb2445d398f69f9aa8046259
Autor:
Marko Djukanović, Aleksandar Kartelj, Dragan Matić, Milana Grbić, Christian Blum, Günther R. Raidl
Publikováno v:
Digital.CSIC. Repositorio Institucional del CSIC
instname
instname
We consider the constrained longest common subsequence problem with an arbitrary set of input strings as well as an arbitrary set of pattern strings. This problem has applications, for example, in computational biology where it serves as a measure of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a3253330aeefddb8df4de25310902744
http://hdl.handle.net/10261/282381
http://hdl.handle.net/10261/282381
Autor:
Bojan Nikolic, Aleksandar Kartelj, Marko Djukanovic, Milana Grbic, Christian Blum, Günther Raidl
Publikováno v:
Mathematics, Vol 9, Iss 13, p 1515 (2021)
The longest common subsequence (LCS) problem is a prominent NP–hard optimization problem where, given an arbitrary set of input strings, the aim is to find a longest subsequence, which is common to all input strings. This problem has a variety of a
Externí odkaz:
https://doaj.org/article/441d8924fa8b473ea3c15bb41c9b6618