An approximate A* algorithm and its application to the SCS problem

Authors:
Gaia Nicosia;Gianpaolo Oriolo
Affiliations:
Dipartimento di Informatica e Automazione, Università "Roma Tre", via della Vasca Navale 79, 00146 Rome, Italy;Dipartimento di Informatica, Sistemi e Produzione, Università di Roma "Tor Vergata", via del Politecnico 1, 00133 Rome, Italy
Venue:
Theoretical Computer Science
Year:
2003

Citing 7
Cited 2

Heuristics: intelligent search strategies for computer problem solving

Heuristics: intelligent search strategies for computer problem solving
More on the complexity of common superstring and supersequence problems

Theoretical Computer Science
On the Approximation of Shortest Common Supersequencesand Longest Common Subsequences

SIAM Journal on Computing
Enhanced A algorithms for multiple alignments: optimal alignments for several sequences and k-opt approximate alignments for large cases

Theoretical Computer Science - Special issue: Genome informatics
The Complexity of Some Problems on Subsequences and Supersequences

Journal of the ACM (JACM)
Approximation algorithms for the shortest common supersequence

Nordic Journal of Computing
Problem-Solving Methods in Artificial Intelligence

Problem-Solving Methods in Artificial Intelligence

Heuristic shortest path algorithms for transportation applications: state of the art

Computers and Operations Research
An enhanced beam search algorithm for the Shortest Common Supersequence Problem

Engineering Applications of Artificial Intelligence

Quantified Score

Hi-index	5.23

Visualization

Abstract

In this paper we deal with algorithm A* and its application to the problem of finding the shortest common supersequence of a set of sequences. A* is a powerful search algorithm which may be used to carry out concurrently the construction of a network and the solution of a shortest path problem on it. We prove a general approximation property of A* which, by building a smaller network, allows us to find a solution with a given approximation ratio. This is particularly useful when dealing with large instances of some problem. We apply this approach to the solution of the shortest common supersequence problem and show its effectiveness.