Пожалуйста, используйте этот идентификатор, чтобы цитировать или ссылаться на этот ресурс: http://elar.urfu.ru/handle/10995/51252
Полная запись метаданных
Поле DCЗначениеЯзык
dc.contributor.authorGorbenko, A.en
dc.contributor.authorPopov, V.en
dc.date.accessioned2024-03-21T08:50:56Z-
dc.date.available2024-03-21T08:50:56Z-
dc.date.issued2012-
dc.identifier.citationGorbenko 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.issn1819-656X-
dc.identifier.other43518id
dc.identifier.otherhttp://www.scopus.com/inward/record.url?partnerID=8YFLogxK&scp=84868704018m
dc.identifier.other7324afbd-395b-4b4a-9983-082d61575bd5pure_uuid
dc.identifier.urihttp://elar.urfu.ru/handle/10995/51252-
dc.description.abstractArc-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.mimetypeapplication/pdfen
dc.language.isoenen
dc.publisherSpringer Netherlandsen
dc.sourceIAENG International Journal of Computer Scienceen
dc.subjectARC-ANNOTATIONen
dc.subjectLOGICAL MODELSen
dc.subjectLONGEST COMMON SUBSEQUENCEen
dc.subjectPARAMETERIZED COMPLEXITYen
dc.subjectW[1]-COMPLETEen
dc.subjectARC-ANNOTATIONen
dc.subjectCOMPUTATIONAL PROBLEMen
dc.subjectLOGICAL MODELSen
dc.subjectLONGEST ARC-PRESERVING COMMON SUBSEQUENCESen
dc.subjectLONGEST COMMON SUBSEQUENCESen
dc.subjectPARAMETERIZEDen
dc.subjectPARAMETERIZED COMPLEXITYen
dc.subjectPROTEIN SEQUENCESen
dc.subjectSECONDARY AND TERTIARY STRUCTURESen
dc.subjectSECONDARY STRUCTURESen
dc.subjectSTRUCTURAL INFORMATIONen
dc.subjectRNAen
dc.titleThe c-fragment longest arc-preserving common subsequence problemen
dc.typeArticleen
dc.typeinfo:eu-repo/semantics/publishedVersionen
dc.typeinfo:eu-repo/semantics/articleen
dc.identifier.scopus84868704018-
local.affiliationUral Federal University, Department of Intelligent Systems, Robotics of Mathematics and Computer Science Institute, 620083 Ekaterinburg, Russian Federationen
local.contributor.employeeГорбенко Анна Андреевнаru
local.contributor.employeeПопов Владимир Юрьевичru
local.description.firstpage231-
local.description.lastpage238-
local.issue3-
local.volume39-
local.contributor.departmentИнститут естественных наук и математикиru
local.identifier.pure1075841-
local.identifier.eid2-s2.0-84868704018-
Располагается в коллекциях:Научные публикации ученых УрФУ, проиндексированные в SCOPUS и WoS CC

Файлы этого ресурса:
Файл Описание РазмерФормат 
2-s2.0-84868704018.pdf1,4 MBAdobe PDFПросмотреть/Открыть


Все ресурсы в архиве электронных ресурсов защищены авторским правом, все права сохранены.