skip to main content

DOE PAGESDOE PAGES

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

Authors:
; ; ; ; ;
Publication Date:
Type:
Published Article
Journal Name:
Theoretical Computer Science
Additional Journal Information:
Journal Name: Theoretical Computer Science Journal Volume: 530 Journal Issue: C; Journal ID: ISSN 0304-3975
Publisher:
Elsevier
Sponsoring Org:
USDOE
Country of Publication:
Netherlands
Language:
English
OSTI Identifier:
1433386

Chen, Wenbin, Chen, Zhengzhang, Samatova, Nagiza F., Peng, Lingxi, Wang, Jianxiong, and Tang, Maobin. Solving the maximum duo-preservation string mapping problem with linear programming. Netherlands: N. p., Web. doi:10.1016/j.tcs.2014.02.017.
Chen, Wenbin, Chen, Zhengzhang, Samatova, Nagiza F., Peng, Lingxi, Wang, Jianxiong, & Tang, Maobin. Solving the maximum duo-preservation string mapping problem with linear programming. Netherlands. doi:10.1016/j.tcs.2014.02.017.
Chen, Wenbin, Chen, Zhengzhang, Samatova, Nagiza F., Peng, Lingxi, Wang, Jianxiong, and Tang, Maobin. 2014. "Solving the maximum duo-preservation string mapping problem with linear programming". Netherlands. doi:10.1016/j.tcs.2014.02.017.
@article{osti_1433386,
title = {Solving the maximum duo-preservation string mapping problem with linear programming},
author = {Chen, Wenbin and Chen, Zhengzhang and Samatova, Nagiza F. and Peng, Lingxi and Wang, Jianxiong and Tang, Maobin},
abstractNote = {},
doi = {10.1016/j.tcs.2014.02.017},
journal = {Theoretical Computer Science},
number = C,
volume = 530,
place = {Netherlands},
year = {2014},
month = {4}
}