A \(2_3^2\) superstring approximation algorithm
type: Item
instance of: scholarly article
title: A \(2_3^2\) superstring approximation algorithm
zbMATH Open document ID: 0936.68027
DOI: 10.1016/S0166-218X(98)00065-1
author: Chris Armen
author: Clifford Stein
published in: Discrete Applied Mathematics
publication date: 2000-05-25T00:00:00Z
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 1268154
zbMATH Keywords: shortest superstring
MaRDI profile type: Publication
cites work: Improved length bounds for the shortest superstring problem
cites work: Linear approximation of shortest superstrings
cites work: Rotations of Periodic Strings and Short Superstrings
cites work: Q3619797
cites work: Parallel and sequential approximation of shortest superstrings
cites work: Uniqueness Theorems for Periodic Functions
cites work: On the worst-case performance of some algorithms for the asymmetric traveling salesman problem
cites work: On finding minimal length superstrings
cites work: An efficient algorithm for the all pairs suffix-prefix problem
cites work: Approximating shortest superstrings with constraints
cites work: Combinatorial algorithms for DNA sequence assembly
cites work: Q4739657
cites work: Q4859180
cites work: \boldmath A $2\frac12$-Approximation Algorithm for Shortest Superstring
cites work: Approximation algorithms for the shortest common superstring problem
description: scientific article; zbMATH DE number 1268154