Exact and Approximation Algorithms for DNA Tag Set Design

Details Exact and Approximation Algorithms for DNA Tag Set Design Exact and Approximation Algorithms for DNA Tag Set Design

2005-03-23

arxiv.org/abs/cs/0503057v1

Computer Science

Data Structures and Algorithms

Scientific paper

In this paper we propose new solution methods for designing tag sets for use in universal DNA arrays. First, we give integer linear programming formulations for two previous formalizations of the tag set design problem, and show that these formulations can be solved to optimality for instance sizes of practical interest by using general purpose optimization packages. Second, we note the benefits of periodic tags, and establish an interesting connection between the tag design problem and the problem of packing the maximum number of vertex-disjoint directed cycles in a given graph. We show that combining a simple greedy cycle packing algorithm with a previously proposed alphabetic tree search strategy yields an increase of over 40% in the number of tags compared to previous methods.

Affiliated with

Also associated with

No associations

Rating

Exact and Approximation Algorithms for DNA Tag Set Design does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Exact and Approximation Algorithms for DNA Tag Set Design, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Exact and Approximation Algorithms for DNA Tag Set Design will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-134727