1. Электронный научный архив УрФУ
  2. 00. Общеуниверситетские коллекции
  3. Научные публикации ученых УрФУ, проиндексированные в SCOPUS и WoS CC
Please use this identifier to cite or link to this item: http://elar.urfu.ru/handle/10995/51217
Title: On the longest common subsequence problem
Authors: Gorbenko, A.
Popov, V.
Issue Date: 2012
Publisher: American Chemical Society (ACS)
Citation: Gorbenko A. On the longest common subsequence problem / Anna Gorbenko, Vladimir Popov // Applied Mathematical Sciences. — 2012. — Vol. 6. — № 113-116. — P. 5781-5787.
Abstract: In this paper we consider an approach to solve the longest common subsequence problem. This approach is based on constructing logical models for the problem.
Keywords: LOGICAL MODEL
NP-COMPLETE
SATISFIABILITY PROBLEM
THE LONGEST COMMON SUBSEQUENCE PROBLEM
URI: http://elar.urfu.ru/handle/10995/51217
SCOPUS ID: 84867314998
PURE ID: 1073611
ISSN: 1312-885X
Appears in Collections:Научные публикации ученых УрФУ, проиндексированные в SCOPUS и WoS CC

Files in This Item:
File Description SizeFormat 
2-s2.0-84867314998.pdf75,75 kBAdobe PDFView/Open
Show full item record


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.