Last update: Wed Sep 26 02:11:46 MDT 2018
@Article{Middendorf:1994:MCC, author = "Martin Middendorf", title = "More on the complexity of common superstring and supersequence problems", journal = j-THEOR-COMP-SCI, volume = "125", number = "2", pages = "205--228", day = "28", month = mar, year = "1994", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Mon Jul 19 22:18:00 MDT 1999", bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1994&volume=125&issue=2; http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1994&volume=125&issue=2&aid=1368", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Inst. fur Angewandte Inf. und Formale Beschreibungsverf, Karlsruhe Univ., Germany", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "common superstring; complexity; computational complexity; cyclic variants; permutation variants; shortest common supersequence; shortest common superstring; supersequence problems", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", }