ISSN: 2310-757X
Please use this identifier to cite or link to this item:
http://elar.urfu.ru/handle/10995/26842| Title: | On reoptimization of the shortest common superstring problem |
| Authors: | Popov, V. |
| Issue Date: | 2013 |
| Citation: | Popov V. On reoptimization of the shortest common superstring problem / V. Popov // Applied Mathematical Sciences. — 2013. — Vol. 7. — № 21-24. — P. 1195-1197. |
| Abstract: | In general, a reoptimization gives us a possibility to obtain a solution for a larger instance from a solution for a smaller instance. In this paper, we consider a possibility of usage of a reoptimization to solve the shortest common superstring problem. |
| Keywords: | COMMON SUPERSTRING HAMMING DISTANCE REOPTIMIZATION |
| URI: | http://elar.urfu.ru/handle/10995/26842 |
| SCOPUS ID: | 84873460271 |
| PURE ID: | 905992 |
| ISSN: | 1312-885X |
| Appears in Collections: | Научные публикации ученых УрФУ, проиндексированные в SCOPUS и WoS CC |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| scopus-2013-0076.pdf | 63,63 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.