Improved Tag Set Design and Multiplexing Algorithms for Universal Arrays

Details Improved Tag Set Design and Multiplexing Algorithms for Universal Arrays Improved Tag Set Design and Multiplexing Algorithms for Universal Arrays

2005-02-10

arxiv.org/abs/cs/0502054v1

Computer Science

Data Structures and Algorithms

Scientific paper

In this paper we address two optimization problems arising in the design of genomic assays based on universal tag arrays. First, we address the universal array tag set design problem. For this problem, we extend previous formulations to incorporate antitag-to-antitag hybridization constraints in addition to constraints on antitag-to-tag hybridization specificity, establish a constructive upper bound on the maximum number of tags satisfying the extended constraints, and propose a simple greedy tag selection algorithm. Second, we give methods for improving the multiplexing rate in large-scale genomic assays by combining primer selection with tag assignment. Experimental results on simulated data show that this integrated optimization leads to reductions of up to 50% in the number of required arrays.

Affiliated with

Also associated with

No associations

Rating

Improved Tag Set Design and Multiplexing Algorithms for Universal Arrays 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 Improved Tag Set Design and Multiplexing Algorithms for Universal Arrays, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Improved Tag Set Design and Multiplexing Algorithms for Universal Arrays will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-54760