Middendorf, Martin; Manlove, David F. Combined super-/substring and super-/subsequence problems. (English) Zbl 1068.68114 Theor. Comput. Sci. 320, No. 2-3, 247-267 (2004). MSC: 68R15 68Q17 68Q25 68W05 PDFBibTeX XMLCite \textit{M. Middendorf} and \textit{D. F. Manlove}, Theor. Comput. Sci. 320, No. 2--3, 247--267 (2004; Zbl 1068.68114) Full Text: DOI Link
Branke, Jürgen; Middendorf, Martin; Schneider, Frerk Improved heuristics and a genetic algorithm for finding short supersequences. (English) Zbl 0897.90121 OR Spektrum 20, No. 1, 39-45 (1998). MSC: 90B35 68T05 PDFBibTeX XMLCite \textit{J. Branke} et al., OR Spektrum 20, No. 1, 39--45 (1998; Zbl 0897.90121) Full Text: DOI
Middendorf, Martin More on the complexity of common superstring and supersequence problems. (English) Zbl 0795.68093 Theor. Comput. Sci. 125, No. 2, 205-228 (1994). MSC: 68Q25 68R15 PDFBibTeX XMLCite \textit{M. Middendorf}, Theor. Comput. Sci. 125, No. 2, 205--228 (1994; Zbl 0795.68093) Full Text: DOI
Middendorf, M. The shortest common nonsubsequence problem is NP-complete. (English) Zbl 0776.68061 Theor. Comput. Sci. 108, No. 2, 365-369 (1993). Reviewer: M.Middendorf MSC: 68Q25 68Q45 PDFBibTeX XMLCite \textit{M. Middendorf}, Theor. Comput. Sci. 108, No. 2, 365--369 (1993; Zbl 0776.68061) Full Text: DOI