Improved heuristics and a genetic algorithm for finding short supersequences

DOI10.1007/BF01545528zbMath0897.90121OpenAlexW1965396158MaRDI QIDQ1384223

Martin Middendorf, Frerk Schneider, Juergen Branke

Publication date: 13 April 1998

Published in: OR Spektrum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01545528

zbMATH Keywords

heuristicsgenetic algorithmshortest common supersequencemajority merge

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Deterministic scheduling theory in operations research (90B35)

Related Items (1)

Hybridizations of Metaheuristics With Branch & Bound Derivates

Cites Work

• 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
• Unnamed Item

This page was built for publication: Improved heuristics and a genetic algorithm for finding short supersequences