The longest common parameterized subsequence problem

Please use this identifier to cite or link to this item: http://elar.urfu.ru/handle/10995/51138

Title:	The longest common parameterized subsequence problem
Authors:	Gorbenko, A. Popov, V.
Issue Date:	2012
Publisher:	Pleiades Publishing Ltd
Citation:	Gorbenko A. The longest common parameterized subsequence problem / Anna Gorbenko, Vladimir Popov // Applied Mathematical Sciences. — 2012. — Vol. 6. — № 57-60. — P. 2851-2855.
Abstract:	In this paper we describe an approach to solve the problem of the longest common parameterized subsequence. This approach is based on constructing logical models for LCPS.
Keywords:	LOGICAL MODELS NP-COMPLETE PARAMETERIZED PATTERN MATCHING
URI:	http://elar.urfu.ru/handle/10995/51138
SCOPUS ID:	84863753788
PURE ID:	1078667
ISSN:	1312-885X
Appears in Collections:	Научные публикации ученых УрФУ, проиндексированные в SCOPUS и WoS CC

Files in This Item:

File	Description	Size	Format
2-s2.0-84863753788.pdf		81,55 kB	Adobe PDF	View/Open