Publication:4944967
From MaRDI portal
zbMath0946.68019MaRDI QIDQ4944967
Publication date: 17 October 2000
68N17: Logic programming
Related Items
Approximating Shortest Superstring Problem Using de Bruijn Graphs, A probabilistic PTAS for shortest common superstring, Restricted and swap common superstring: a multivariate algorithmic perspective, A greedy randomized adaptive search procedure with path relinking for the shortest superstring problem, Superstring Graph: A New Approach for Genome Assembly, On the Shortest Common Superstring of NGS Reads, Restricted Common Superstring and Restricted Common Supersequence