By Topic

Exact and heuristic algorithms for the DNA fragment assembly problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Y. Jing ; Dept. of Comput. Sci., San Jose State Univ., CA, USA ; S. Khuri

As more and more public and private genomic assemblies are available, the need for comparison of different computation methods used in the DNA fragment assembly becomes apparent. In this work, we design, implement, and test four heuristic algorithms for assembling DNA fragments. We also design, implement and test an exact algorithm to solve the fragment assembly problem.

Published in:

Bioinformatics Conference, 2003. CSB 2003. Proceedings of the 2003 IEEE

Date of Conference:

11-14 Aug. 2003