Exact and Heuristic Approaches for the Longest Common Palindromic Subsequence Problem

Title

Exact and Heuristic Approaches for the Longest Common Palindromic Subsequence Problem

Identifier

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

Type

See all items with this valueConference Paper
See all items with this valuetext

Date

See all items with this value2021-06

Bibliographic Citation

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

page start

199

page end

214

presented at

The 12th Conference Learning and Intelligent Optimization

Is Part Of

See all items with this valueLecture Notes in Computer Science

Relation

See all items with this valuePrirodno-matematički fakultet

list of authors

See all items with this valueMarko Đukanović
See all items with this valueGuenther Raidl
See all items with this valueChristian Blum

Position: 5880 (37 views)