An approximate \(A^{\ast}\) algorithm and its application to the SCS problem.
type: Item
instance of: scholarly article
title: An approximate \(A^{\ast}\) algorithm and its application to the SCS problem.
zbMATH Open document ID: 1044.68033
DOI: 10.1016/S0304-3975(02)00085-3
author: Gaia Nicosia
author: Gianpaolo Oriolo
published in: Theoretical Computer Science
publication date: 2003-08-17T00:00:00Z
Mathematics Subject Classification ID: 68P10
zbMATH DE Number: 1965247
zbMATH Keywords: \(A^{\ast}\) algorithm
zbMATH Keywords: Shortest common supersequence
zbMATH Keywords: Approximation
MaRDI profile type: Publication
cites work: Q4858904
cites work: Enhanced \(A^{*}\) algorithms for multiple alignments: optimal alignments for several sequences and k-opt approximate alignments for large cases
cites work: On the Approximation of Shortest Common Supersequences and Longest Common Subsequences
cites work: The Complexity of Some Problems on Subsequences and Supersequences
cites work: More on the complexity of common superstring and supersequence problems
cites work: The shortest common supersequence problem over binary alphabet is NP- complete
description: scientific article; zbMATH DE number 1965247