Пожалуйста, используйте этот идентификатор, чтобы цитировать или ссылаться на этот ресурс:
http://elar.urfu.ru/handle/10995/51252
Полная запись метаданных
Поле DC | Значение | Язык |
---|---|---|
dc.contributor.author | Gorbenko, A. | en |
dc.contributor.author | Popov, V. | en |
dc.date.accessioned | 2024-03-21T08:50:56Z | - |
dc.date.available | 2024-03-21T08:50:56Z | - |
dc.date.issued | 2012 | - |
dc.identifier.citation | Gorbenko A. The c-fragment longest arc-preserving common subsequence problem / Anna Gorbenko, Vladimir Popov // IAENG International Journal of Computer Science. — 2012. — Vol. 39. — № 3. — P. 231-238. | en |
dc.identifier.issn | 1819-656X | - |
dc.identifier.other | 43518 | id |
dc.identifier.other | http://www.scopus.com/inward/record.url?partnerID=8YFLogxK&scp=84868704018 | m |
dc.identifier.other | 7324afbd-395b-4b4a-9983-082d61575bd5 | pure_uuid |
dc.identifier.uri | http://elar.urfu.ru/handle/10995/51252 | - |
dc.description.abstract | Arc-annotated sequences are useful in representing the structural information of RNA and protein sequences. In particular, arc-annotated sequences are useful in describing the secondary and tertiary structures of RNA and protein sequences. Structure comparison for RNA and for protein sequences has become a central computational problem bearing many challenging computer science questions. The longest arc-preserving common subsequence problem has been introduced as a framework for studying the similarity of arc-annotated sequences. It is a sound and meaningful mathematical formalization of comparing the secondary structures of molecular sequences. In this paper, we consider two special cases of the longest arc-preserving common subsequence problem, efragment LAPCS (unlimited, plain), c-fragment LAPCS (unlimited, unlimited). In particular, we consider a parameterized version of the 1-fragment LAPCS (unlimited, plain) problem, parameterized by the length l of the desired subsequence. We show W[1]-completeness of the problem. Also, we describe an approach to solve c-fragment LAPCS (unlimited, unlimited). This approach is based on constructing logical models for the problem. | en |
dc.format.mimetype | application/pdf | en |
dc.language.iso | en | en |
dc.publisher | Springer Netherlands | en |
dc.source | IAENG International Journal of Computer Science | en |
dc.subject | ARC-ANNOTATION | en |
dc.subject | LOGICAL MODELS | en |
dc.subject | LONGEST COMMON SUBSEQUENCE | en |
dc.subject | PARAMETERIZED COMPLEXITY | en |
dc.subject | W[1]-COMPLETE | en |
dc.subject | ARC-ANNOTATION | en |
dc.subject | COMPUTATIONAL PROBLEM | en |
dc.subject | LOGICAL MODELS | en |
dc.subject | LONGEST ARC-PRESERVING COMMON SUBSEQUENCES | en |
dc.subject | LONGEST COMMON SUBSEQUENCES | en |
dc.subject | PARAMETERIZED | en |
dc.subject | PARAMETERIZED COMPLEXITY | en |
dc.subject | PROTEIN SEQUENCES | en |
dc.subject | SECONDARY AND TERTIARY STRUCTURES | en |
dc.subject | SECONDARY STRUCTURES | en |
dc.subject | STRUCTURAL INFORMATION | en |
dc.subject | RNA | en |
dc.title | The c-fragment longest arc-preserving common subsequence problem | en |
dc.type | Article | en |
dc.type | info:eu-repo/semantics/publishedVersion | en |
dc.type | info:eu-repo/semantics/article | en |
dc.identifier.scopus | 84868704018 | - |
local.affiliation | Ural Federal University, Department of Intelligent Systems, Robotics of Mathematics and Computer Science Institute, 620083 Ekaterinburg, Russian Federation | en |
local.contributor.employee | Горбенко Анна Андреевна | ru |
local.contributor.employee | Попов Владимир Юрьевич | ru |
local.description.firstpage | 231 | - |
local.description.lastpage | 238 | - |
local.issue | 3 | - |
local.volume | 39 | - |
local.contributor.department | Институт естественных наук и математики | ru |
local.identifier.pure | 1075841 | - |
local.identifier.eid | 2-s2.0-84868704018 | - |
Располагается в коллекциях: | Научные публикации ученых УрФУ, проиндексированные в SCOPUS и WoS CC |
Файлы этого ресурса:
Файл | Описание | Размер | Формат | |
---|---|---|---|---|
2-s2.0-84868704018.pdf | 1,4 MB | Adobe PDF | Просмотреть/Открыть |
Все ресурсы в архиве электронных ресурсов защищены авторским правом, все права сохранены.