"A Beam Search for the Longest Common Subsequence Problem Guided by a Novel ..."

Marko Djukanovic, Günther R. Raidl, Christian Blum (2019)

> Home

Details and statistics

DOI: 10.1007/978-3-030-37599-7_14

access: closed

type: Conference or Workshop Paper

metadata version: 2020-03-27

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/mod/DjukanovicR019
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/mod/DjukanovicR019
Marko Djukanovic, Günther R. Raidl, Christian Blum:
A Beam Search for the Longest Common Subsequence Problem Guided by a Novel Approximate Expected Length Calculation. LOD 2019: 154-167

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.