| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1706387 | Applied Mathematical Modelling | 2011 | 6 Pages |
Abstract
A known class of computational problems in molecular biology is the consensus string problem, to which belongs the problem of string selection via comparison. This paper deals with one of these problems called Closest String Problem (CSP). A novel definition of CSP is provided, based upon the Pareto optimality notion, to obtain most useful sequences. Also, a zero-one optimization model to solve the new defined CSP is introduced. Finally, a comparison between the new definition (model) and a current one is given.
Keywords
Related Topics
Physical Sciences and Engineering
Engineering
Computational Mechanics
Authors
M. Soleimani-damaneh,