"Solving the maximum duo-preservation string mapping problem with linear ..."

Wenbin Chen et al. (2014)

> Home

Details and statistics

DOI: 10.1016/J.TCS.2014.02.017

access: open

type: Journal Article

metadata version: 2023-06-02

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/tcs/ChenCSPWT14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/ChenCSPWT14
Wenbin Chen, Zhengzhang Chen, Nagiza F. Samatova, Lingxi Peng, Jianxiong Wang, Maobin Tang:
Solving the maximum duo-preservation string mapping problem with linear programming. Theor. Comput. Sci. 530: 1-11 (2014)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.