DOE OSTI · 1433386
Solving the maximum duo-preservation string mapping problem with linear programming
Abstract
Not Available
Keep this discovery
Explore connections, maps & timelines
Chen, Wenbin, Chen, Zhengzhang, Samatova, Nagiza F., Peng, Lingxi, Wang, Jianxiong, Tang, Maobin. 2014-04-01. Solving the maximum duo-preservation string mapping problem with linear programming. https://doi.org/10.1016/j.tcs.2014.02.017
Cite the original work for its findings. Save a collection to share your selection of sources.