By Topic

Optimization techniques for string selection and comparison problems in genomics

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Meneses, C.N. ; Dept. of Ind. & Syst. Eng., Florida Univ., Gainesville, FL, USA ; Oliveira, C.A.S. ; Pardalos, P.M.

In this article, a discussion of optimization issues occurring in the area of genomics such as string comparison and selection problems are discussed. With this objective, an important part of the existing results in this area will be discussed. The problems that are of interest in this paper include the closest string problem (CSP), closest substring problem (CSSP), farthest string problem (FSP), farthest substring problem (FSSP), and far from most string (FFMSP) problem. The paper presents a detailed view of the most important problems occurring in the area of string comparison and selection, using the Hamming distance measure is given.

Published in:

Engineering in Medicine and Biology Magazine, IEEE  (Volume:24 ,  Issue: 3 )