Change search
ReferencesLink to record
Permanent link

Direct link
Multiplex dispensation order generation for pyrosequencing
Number of Authors: 2
2004 (English)Conference paper (Refereed)
Abstract [en]

This paper introduces the multiplex dispensation order generation problem, a real-life combinatorial problem that arises in the context of analyzing large numbers of short to medium length DNA sequences. The problem is modeled as a constraint optimization problem (COP). We present the COP, its constraint programming formulation, and a custom search procedure. We give some experimental data supporting our design decisions. One of the lessons learnt from this study is that the ease with which the relevant constraints are expressed can be a crucial factor in making design decisions in the COP model.

Place, publisher, year, edition, pages
2004, 1. , 15 p.
National Category
Computer and Information Science
URN: urn:nbn:se:ri:diva-14522OAI: diva2:1035811
CP'2004 Workshop on CSP Techniques with Immediate Application
Available from: 2016-10-13 Created: 2016-10-13

Open Access in DiVA

fulltext(170 kB)0 downloads
File information
File name FULLTEXT01.pdfFile size 170 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Other links

Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

ReferencesLink to record
Permanent link

Direct link