Exact and Heuristic Approaches for the Longest Common Palindromic Subsequence Problem

Naslov

Exact and Heuristic Approaches for the Longest Common Palindromic Subsequence Problem

Identifikator

/unibl/sci/idNaucniRad:28193
info:doi/https://doi.org/10.1007/978-3-030-05348-2_18

Tip

Pronađite slične unoseConference Paper
Pronađite slične unosetext

Datum

Pronađite slične unose2021-06

Bibliografski citat

M. Đukanović, G. Raidl, C. Blum, Exact and Heuristic Approaches for the Longest Common Palindromic Subsequence Problem, Lecture Notes in Computer Science, pp. 199 - 214, Jun, 2021

Početna stranica

199

Krajnja stranica

214

Prezentovano

The 12th Conference Learning and Intelligent Optimization

Je dio

Lecture Notes in Computer Science

Veza

Pronađite slične unosePrirodno-matematički fakultet

Lista autora

Pronađite slične unoseMarko Đukanović
Pronađite slične unoseGuenther Raidl
Pronađite slične unoseChristian Blum

Position: 5911 (37 views)