𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Approximating the Spanning Star Forest Problem and Its Application to Genomic Sequence Alignment

✍ Scribed by Nguyen, C. Thach; Shen, Jian; Hou, Minmei; Sheng, Li; Miller, Webb; Zhang, Louxin

Book ID
118180858
Publisher
Society for Industrial and Applied Mathematics
Year
2008
Tongue
English
Weight
230 KB
Volume
38
Category
Article
ISSN
0097-5397

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An approximate Aβˆ— algorithm and its appl
An approximate Aβˆ— algorithm and its application to the SCS problem
✍ Gaia Nicosia; Gianpaolo Oriolo πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 123 KB

In this paper we deal with algorithm A \* and its application to the problem of ΓΏnding 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