Solving large double digestion problems for DNA restriction mapping by using branch-and-bound integer linear programming

Loading...
Thumbnail Image

View/Download File

Persistent link to this item

Statistics
View Statistics

Journal Title

Journal ISSN

Volume Title

Title

Solving large double digestion problems for DNA restriction mapping by using branch-and-bound integer linear programming

Published Date

2007-10

Publisher

Type

Preprint

Abstract

Keywords

Description

Related to

Replaces

License

Series/Report Number

Funding information

Isbn identifier

Doi identifier

Previously Published Citation

Suggested citation

Wu, Zhijun; Zhang, Yin. (2007). Solving large double digestion problems for DNA restriction mapping by using branch-and-bound integer linear programming. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/5386.

Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.