Mathematical Foundations of Computer Science 2005
From MaRDI portal
Publication:5492909
DOI10.1007/11549345zbMath1156.68394MaRDI QIDQ5492909
Publication date: 20 October 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11549345
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Related Items
Approximating Shortest Superstring Problem Using de Bruijn Graphs, Unnamed Item, Unnamed Item, A probabilistic PTAS for shortest common superstring, Restricted and swap common superstring: a multivariate algorithmic perspective, Reoptimization of the shortest common superstring problem, Why greed works for shortest common superstring problem, Solving SCS for bounded length strings in fewer than \(2^n\) steps, A linear time algorithm for shortest cyclic cover of strings, A survey on combinatorial optimization in dynamic environments, Applying Small-Scale DNA Signatures as an Aid in Assembling Soybean Chromosome Sequences, A Probabilistic PTAS for Shortest Common Superstring, Why Greed Works for Shortest Common Superstring Problem, Reoptimization of the Shortest Common Superstring Problem