A note on shortest superstrings with flipping

DOI10.1016/0020-0190(92)90084-9zbMath0774.68051OpenAlexW2057864425MaRDI QIDQ1208439

Tao Jiang, Ming Li, Ding-Zhu Du

Publication date: 16 May 1993

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(92)90084-9

zbMATH Keywords

approximation algorithmsDNA sequencing\(NP\)-hard

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Related Items (5)

Inferring a tree from walks ⋮ On the greedy algorithm for the shortest common superstring problem with reversals ⋮ Fast RNC and NC algorithms for finding a maximal set of paths with an application ⋮ Practical lower and upper bounds for the Shortest Linear Superstring ⋮ Superstrings with multiplicities

Cites Work

• Unnamed Item
• A greedy approximation algorithm for constructing shortest common superstrings
• On finding minimal length superstrings
• Approximation algorithms for the shortest common superstring problem

This page was built for publication: A note on shortest superstrings with flipping