Improved heuristics and a genetic algorithm for finding short supersequences
From MaRDI portal
Publication:1384223
DOI10.1007/BF01545528zbMath0897.90121MaRDI QIDQ1384223
Martin Middendorf, Juergen Branke, Frerk Schneider
Publication date: 13 April 1998
Published in: OR Spektrum (Search for Journal in Brave)
68T05: Learning and adaptive systems in artificial intelligence
90B35: Deterministic scheduling theory in operations research
Cites Work
- Unnamed Item
- The shortest common supersequence problem over binary alphabet is NP- complete
- Theory and algorithms for plan merging
- More on the complexity of common superstring and supersequence problems
- The Complexity of Some Problems on Subsequences and Supersequences
- On the Approximation of Shortest Common Supersequences and Longest Common Subsequences