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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Journal of combinatorial optimization Ročník 40; číslo 3; s. 806 - 824
Hlavní autoři:	Chen, Yong, Lin, Guohui, Liu, Tian, Luo, Taibo, Su, Bing, Xu, Yao, Zhang, Peng
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 01.10.2020 Springer Nature B.V
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!