Solving the maximum duo-preservation string mapping problem with linear programming

@article{Chen2014SolvingTM,
  title={Solving the maximum duo-preservation string mapping problem with linear programming},
  author={Wenbin Chen and Zhengzhang Chen and Nagiza F. Samatova and Lingxi Peng and Jianxiong Wang and Maobin Tang},
  journal={Theor. Comput. Sci.},
  year={2014},
  volume={530},
  pages={1-11}
}
Article history: Received 27 November 2011 Received in revised form 12 February 2014 Accepted 16 February 2014 Communicated by V.Th. Paschos 

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 11 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 21 references

Approximation algorithms for the maximum duo-preservation string mapping problem, in: ICFIT

  • W. Chen, Z. Zheng, N. F. Samatova
  • 2010
Highly Influential
2 Excerpts

Waleń, Reversal distance for strings with duplicates: linear time approximation using hitting set, in: WAOA

  • T. P. Kolman
  • 2006
1 Excerpt

Similar Papers

Loading similar papers…