A Beam Search for the Longest Common Subsequence Problem Guided by a Novel Approximate Expected Length Calculation
Title
A Beam Search for the Longest Common Subsequence Problem Guided by a Novel Approximate Expected Length Calculation
Identifier
/unibl/sci/idNaucniRad:28191
Type
See all items with this valueConference Paper
Date
Bibliographic Citation
M. Đukanović, G. Raidl, C. Blum, A Beam Search for the Longest Common Subsequence Problem Guided by a Novel Approximate Expected Length Calculation, LNCS, pp. 154 - 167, Sep, 2020
page start
154
page end
167
presented at
The 5th Conference on Machine Learning, Optimization and Data science
Is Part Of
list of authors
Position: 5737 (161 views)