Anytime algorithms for the longest common palindromic subsequence problem

Title

Anytime algorithms for the longest common palindromic subsequence problem

Identifier

/unibl/sci/idNaucniRad:28188
info:doi/https://doi.org/10.1016/j.cor.2019.104827

Type

See all items with this valueAcademic Article
See all items with this valuetext

Date

See all items with this value2020-02

Bibliographic Citation

M. Đukanović, G. Raidl, C. Blum, Anytime algorithms for the longest common palindromic subsequence problem, COMPUTERS & OPERATIONS RESEARCH, Vol. 114, pp. Article - 104827, Feb, 2020

page start

Article

page end

104827

Is Part Of

See all items with this valueCOMPUTERS & OPERATIONS RESEARCH
See all items with this value0305-0548

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: 692 (209 views)