标题:The Longest Common Exemplar Subsequence Problem
作者:Zhang S.; Wang R.; Zhu D.; Jiang H.; Feng H.; Guo J.; Liu X.
作者机构:[Zhang, S] School of Computer Science and Technology, Shandong University, China;[ Wang, R] School of Computer Science and Technology, Shandong Univer 更多
通讯作者:Zhu, D(dmzhu@sdu.edu.cn)
通讯作者地址:[Zhu, D] School of Computer Science and Technology, Shandong UniversityChina;
来源:Proceedings - 2018 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2018
出版年:2019
页码:92-95
DOI:10.1109/BIBM.2018.8621304
关键词:algorithm; dynamic programming; exemplar subsequence; genome; s-span
摘要:In this paper, we propose to find order conserved subsequences of genomes by finding longest common exemplar subsequences of the genomes. The longest common exemplar subsequence problem is given by two genomes, asks to find a common exemplar subsequence of them, such that the exemplar subsequence length is maximized.We focus on genomes whose genes of the same gene family are in at most s spans. We propose a dynamic programming algorithm with time complexity O(s4smn) to find a longest common exemplar subsequence of two genomes with one genome admitting s span genes of the same gene family, where m, n stand for the gene numbers of those two given genomes. Our algorithm can be extended to find longest common exemplar subsequences of more than one genomes. © 2018 IEEE.
收录类别:SCOPUS
资源类型:期刊论文
原文链接:https://www.scopus.com/inward/record.uri?eid=2-s2.0-85062515280&doi=10.1109%2fBIBM.2018.8621304&partnerID=40&md5=2dc5a6345eb74a76df6e994b1dd52b22
TOP