𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Improved LP-based algorithms for the closest string problem

✍ Scribed by F. Della Croce; F. Salassa

Book ID
108107043
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
122 KB
Volume
39
Category
Article
ISSN
0305-0548

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An improved algorithm for solving the ba
An improved algorithm for solving the banded cyclic string-to-string correction problem
✍ Chung Kuo-Liang πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 339 KB

The banded cyclic string-to-string correction (BCSSC) problem is a generalized version of the cyclic string-to-string correction (CSSC) problem, and has some applications in stereo matching and speech recognition. This note presents an improved algorithm for solving the BCSSC problem and the time co

A Reliable Randomized Algorithm for the
A Reliable Randomized Algorithm for the Closest-Pair Problem
✍ Martin Dietzfelbinger; Torben Hagerup; Jyrki Katajainen; Martti Penttonen πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 361 KB

The following two computational problems are studied: Duplicate grouping: Assume that n items are given, each of which is labeled by an Γ„ 4 integer key from the set 0, . . . , U y 1 . Store the items in an array of size n such that items with the same key occupy a contiguous segment of the array. C