An optimization modelling for string selection in molecular biology using Pareto optimality |
| |
| Authors: | M Soleimani-damaneh |
| |
| Institution: | School of Mathematics, Statistics and Computer Science, College of Science, University of Tehran, Tehran, Iran;Center of Excellence in Biomathematics, University of Tehran, Tehran 14176-14411, Iran |
| |
| 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: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
