Bioinformatics Vol. 19 no. 2 2003
Pages 285-286
© 2003 Oxford University Press
Applications Note |
An efficient algorithm for minimal primer set selection
Department of Research and Development, U-Vision Biotech Inc., 3F 132, Ln 235, Pao-Chiao Rd, Hsin-Tien City 231 Taipei, Taiwan
Received on June 12, 2002
; revised on July 29, 2002
; accepted on August 6, 2002
Summary: We have developed U-PRIMER, a primer design program, to compute a minimal primer set (MPS) for any given set of DNA sequences. The U-PRIMER algorithm, which uses automatic variable fixing and automatic redundant constraint elimination to tackle the binary integer programming problem associated with the MPS selection problem. The program has been tested successfully with 32 adipocyte development-related genes and 9 TB-specific genes to obtain their respective MPSs.
Availability: A free copy of U-PRIMER implemented in C++ programming language is available from http://www.u-vision-biotech.com
Contact: cmtzeng{at}u-vision-biotech.com
* To whom correspondence should be addressed.
![]()
CiteULike
Connotea
Del.icio.us What's this?
This article has been cited by other articles:
![]() |
M. Leber, L. Kaderali, A. Schonhuth, and R. Schrader A fractional programming approach to efficient DNA melting temperature calculation Bioinformatics, May 15, 2005; 21(10): 2375 - 2382. [Abstract] [Full Text] [PDF] |
||||
