Efficient solutions for the far from most string problem

Paola Festa () and Panos Pardalos ()

Annals of Operations Research, 2012, vol. 196, issue 1, 663-682

Abstract: Computational molecular biology has emerged as one of the most exciting interdisciplinary fields. It has currently benefited from concepts and theoretical results obtained by different scientific research communities, including genetics, biochemistry, and computer science. In the past few years it has been shown that a large number of molecular biology problems can be formulated as combinatorial optimization problems, including sequence alignment problems, genome rearrangement problems, string selection and comparison problems, and protein structure prediction and recognition. This paper provides a detailed description of string selection and string comparison problems. For finding good-quality solutions of a particular class of string comparison molecular biology problems, known as the far from most string problem, we propose new heuristics, including a Greedy Randomized Adaptive Search Procedure (GRASP) and a Genetic Algorithm (GA). Computational results indicate that these randomized heuristics find better quality solutions compared with results produced by the best state-of-the-art heuristic approach. Copyright Springer Science+Business Media, LLC 2012

Keywords: Computational biology; Molecular structure prediction; Protein and sequences alignment; Combinatorial optimization; Metaheuristics (search for similar items in EconPapers)
Date: 2012
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1007/s10479-011-1028-7 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:196:y:2012:i:1:p:663-682:10.1007/s10479-011-1028-7

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-011-1028-7

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().