English
español
Navegación por Autor Djukanovic, Marco
Mostrando resultados 1 a 8 de 8
Derechos | Preview | Fecha Public. | Título | Autor(es) | Tipo |
openAccess | | 2019 | A Beam Search for the Longest Common Subsequence Problem Guided by a Novel Approximate Expected Length Calculation | Djukanovic, Marco; Raidl, Günther; Blum, Christian CSIC ORCID | capítulo de libro |
closedAccess | | 18-feb-2019 | A Heuristic Approach for Solving the Longest Common Square Subsequence Problem | Djukanovic, Marco; Raidl, Günther; Blum, Christian CSIC ORCID | comunicación de congreso |
openAccess | | 2021 | An A* search algorithm for the constrained longest common subsequence problem | Djukanovic, Marco; Berger, Christoph; Raidl, Günther; Blum, Christian CSIC ORCID | artículo |
openAccess | | 2020 | Anytime algorithms for the longest common palindromic subsequence problem | Djukanovic, Marco; Raidl, Günther; Blum, Christian CSIC ORCID | artículo |
openAccess | | 2020 | Finding Longest Common Subsequences: New anytime A∗ search results | Djukanovic, Marco; Raidl, Günther; Blum, Christian CSIC ORCID | artículo |
openAccess | | 2020 | On Solving a Generalized Constrained Longest Common Subsequence Problem | Djukanovic, Marco; Berger, Christoph; Raidl, Günther; Blum, Christian CSIC ORCID | capítulo de libro |
openAccess | | 2020 | On the Use of Decision Diagrams for Finding Repetition-Free Longest Common Subsequences | Horn, Matthias; Djukanovic, Marco; Blum, Christian CSIC ORCID ; Raidl, Günther | capítulo de libro |
closedAccess | | 2021 | Solving longest common subsequence problems via a transformation to the maximum clique problem | Blum, Christian CSIC ORCID ; Djukanovic, Marco; Santini, Alberto; Jiang, Hua; Li, Chu-Min; Manyà, Felip CSIC ORCID ; Raidl, G.R. | artículo |