Finding Longest Common Subsequences: New anytime A∗ search results

Title

Finding Longest Common Subsequences: New anytime A∗ search results

Identifier

/unibl/sci/idNaucniRad:28190

Type

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

Date

See all items with this value2020-10

Bibliographic Citation

M. Đukanović, G. Raidl, C. Blum, Finding Longest Common Subsequences: New anytime A∗ search results, APPLIED SOFT COMPUTING, Vol. 95, pp. Article - 106499, Oct, 2020

page start

Article

page end

106499

Is Part Of

See all items with this valueAPPLIED SOFT COMPUTING
See all items with this value1568-4946

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: 5983 (48 views)