A Simple Algorithm for Solving for the Generalized Longest Common Subsequence (LCS) Problem with a Substring Exclusion Constraint

Author： Zhu Daxin Wang Xiaodong

Publisher： MDPI

E-ISSN： 1999-4893|6|3|485-493

ISSN： 1999-4893

Source： Algorithms, Vol.6, Iss.3, 2013-08, pp. : 485-493

Access to resources Favorite

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Application of Imperialist Competitive Algorithm on Solving the Traveling Salesman Problem

By Xu Shuhui Wang Yong Huang Aiqin

Algorithms, Vol. 7, Iss. 2, 2014-05 ,pp. : 229-242

MDPI

Access to resources Recommend Favorite

An Asynchronous Message-Passing Distributed Algorithm for the Generalized Local Critical Section Problem †

By Kamei Sayaka Kakugawa Hirotsugu

Algorithms, Vol. 10, Iss. 2, 2017-03 ,pp. : 38-38

MDPI

Access to resources Recommend Favorite

Solving the Examination Timetabling Problem in GPUs

By Kolonias Vasileios Goulas George Gogos Christos Alefragis Panayiotis Housos Efthymios

Algorithms, Vol. 7, Iss. 3, 2014-07 ,pp. : 295-327

MDPI

Access to resources Recommend Favorite

A Two-Stage Method to Test the Robustness of the Generalized Approximate Message Passing Algorithm

By You Qingshan Luo Yongjie Wan Qun

Algorithms, Vol. 9, Iss. 4, 2016-11 ,pp. : 79-79

MDPI

Access to resources Recommend Favorite

A Tensor Decomposition Based Multiway Structured Sparse SAR Imaging Algorithm with Kronecker Constraint

By Gao Yu-Fei Cong Xun-Chao Yang Yue Wan Qun Gui Guan

Algorithms, Vol. 10, Iss. 1, 2016-12 ,pp. : 2-2

MDPI

Access to resources Recommend Favorite