ISSN: 2310-757X
Please use this identifier to cite or link to this item:
http://elar.urfu.ru/handle/10995/27259| Title: | On multiple occurrences shortest common superstring problem |
| Authors: | Gorbenko, A. Popov, V. |
| Issue Date: | 2013 |
| Citation: | Gorbenko A. On multiple occurrences shortest common superstring problem / A. Gorbenko, V. Popov // Applied Mathematical Sciences. — 2013. — Vol. 7. — № 13-16. — P. 641-644. |
| Abstract: | In this paper, we consider multiple occurrences shortest common superstring problem. In particular, we consider an approach to solve the problem. This approach is based on an explicit reduction from the problem to the satisfiability problem. |
| Keywords: | MULTIPLE OCCURRENCES SHORTEST COMMON SUPERSTRING PROBLEM NP-COMPLETE SATISFIABILITY PROBLEM |
| URI: | http://elar.urfu.ru/handle/10995/27259 |
| SCOPUS ID: | 84873285989 |
| PURE ID: | 905679 |
| ISSN: | 1312-885X |
| Appears in Collections: | Научные публикации ученых УрФУ, проиндексированные в SCOPUS и WoS CC |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| scopus-2013-0070.pdf | 71,36 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.