Improved tag set design and multiplexing algorithms for universal arrays

Authors:
Ion I. MÄƒndoiu;Claudia PrÄƒjescu;DragoÅŸ TrincÄƒ
Affiliations:
CSE Department, University of Connecticut, Storrs, CT;CSE Department, University of Connecticut, Storrs, CT;CSE Department, University of Connecticut, Storrs, CT
Venue:
Transactions on Computational Systems Biology II
Year:
2005

Citing 3
Cited 1

Towards optimally multiplexed applications of universal DNA tag systems

RECOMB '03 Proceedings of the seventh annual international conference on Research in computational molecular biology
Design Flow Enhancements for DNA Arrays

ICCD '03 Proceedings of the 21st International Conference on Computer Design
Improved tag set design and multiplexing algorithms for universal arrays

ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part II

High-Throughput SNP genotyping by SBE/SBH

ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 alphabetic tree search 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.