A (1.4+ϵ)-approximation algorithm for the 2-Max-Duo problem

The maximum duo-preservation string mapping ( Max-Duo ) problem is the complement of the well studied minimum common string partition problem, both of which have applications in many fields including text compression and bioinformatics. k - Max-Duo is the restricted version of Max-Duo , where every...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of combinatorial optimization Vol. 40; no. 3; pp. 806 - 824
Main Authors:	Chen, Yong, Lin, Guohui, Liu, Tian, Luo, Taibo, Su, Bing, Xu, Yao, Zhang, Peng
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.10.2020 Springer Nature B.V
Subjects:	Algorithms Approximation Bioinformatics Combinatorics Convex and Discrete Geometry Degree reduction Mapping Mathematical analysis Mathematical Modeling and Industrial Mathematics Mathematics Mathematics and Statistics Operations Research/Decision Theory Optimization Strings Theory of Computation String partition Duo-preservation string mapping G.4 Algorithm design and analysis Independent set F.2.2 Pattern matching Approximation algorithm G.2.1 Combinatorial algorithms
ISSN:	1382-6905, 1573-2886
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!