Improved Tag Set Design and Multiplexing Algorithms for Universal Arrays
| dc.creator | Mandoiu, Ion I. | |
| dc.creator | Prajescu, Claudia | |
| dc.creator | Trinca, Dragos | |
| dc.date | 2005-02-10 | |
| dc.date.accessioned | 2026-07-07T03:22:31Z | |
| dc.date.available | 2026-07-07T03:22:31Z | |
| dc.description | 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. | |
| dc.identifier | https://arxiv.org/abs/cs/0502054 | |
| dc.identifier | http://arxiv.org/abs/cs/0502054 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/32628 | |
| dc.subject | Data Structures and Algorithms | |
| dc.subject | F.2.2 | |
| dc.title | Improved Tag Set Design and Multiplexing Algorithms for Universal Arrays | |
| dc.type | text |