Mathematical Foundations of Computer Science 2005
From MaRDI portal
Publication:5492909
DOI10.1007/11549345zbMath1156.68394OpenAlexW2494705596MaRDI 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
Related Items (14)
A linear time algorithm for shortest cyclic cover of strings ⋮ A survey on combinatorial optimization in dynamic environments ⋮ A Probabilistic PTAS for Shortest Common Superstring ⋮ A probabilistic PTAS for shortest common superstring ⋮ Why Greed Works for Shortest Common Superstring Problem ⋮ Reoptimization of the shortest common superstring problem ⋮ Solving SCS for bounded length strings in fewer than \(2^n\) steps ⋮ Applying Small-Scale DNA Signatures as an Aid in Assembling Soybean Chromosome Sequences ⋮ Restricted and swap common superstring: a multivariate algorithmic perspective ⋮ Approximating Shortest Superstring Problem Using de Bruijn Graphs ⋮ Reoptimization of the Shortest Common Superstring Problem ⋮ Why greed works for shortest common superstring problem ⋮ Practical lower and upper bounds for the Shortest Linear Superstring ⋮ Superstrings with multiplicities
This page was built for publication: Mathematical Foundations of Computer Science 2005