In the last two decades, the study of gene structure and function and molecular genetics have become some of the most prominent sub-fields of molecular biology. Computational molecular biology has emerged as one of the most exciting interdisciplinary fields, riding on the success of the ongoing Human Genome Project, which culminated in the 2001 announcement of the complete sequencing of the human genome. The field has currently benefited from concepts and theoretical results obtained by different scientific research communities, including genetics, biochemistry, and computer science. It is only in the past few years that 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 some among the most interesting molecular biology problems that can be formulated as combinatorial optimization problems and proposes a new heuristic to find improved solutions for a particular class of them, known as the far from most string problem.

On some optimization problems in molecular biology

FESTA, PAOLA
2007

Abstract

In the last two decades, the study of gene structure and function and molecular genetics have become some of the most prominent sub-fields of molecular biology. Computational molecular biology has emerged as one of the most exciting interdisciplinary fields, riding on the success of the ongoing Human Genome Project, which culminated in the 2001 announcement of the complete sequencing of the human genome. The field has currently benefited from concepts and theoretical results obtained by different scientific research communities, including genetics, biochemistry, and computer science. It is only in the past few years that 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 some among the most interesting molecular biology problems that can be formulated as combinatorial optimization problems and proposes a new heuristic to find improved solutions for a particular class of them, known as the far from most string problem.
File in questo prodotto:
File Dimensione Formato  
MBS6738_Festa.pdf

non disponibili

Tipologia: Documento in Post-print
Licenza: Accesso privato/ristretto
Dimensione 217.55 kB
Formato Adobe PDF
217.55 kB Adobe PDF   Visualizza/Apri   Richiedi una copia
MBS6738_Festa.pdf

non disponibili

Tipologia: Documento in Post-print
Licenza: Accesso privato/ristretto
Dimensione 217.55 kB
Formato Adobe PDF
217.55 kB Adobe PDF   Visualizza/Apri   Richiedi una copia

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11588/104756
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 27
  • ???jsp.display-item.citation.isi??? 20
social impact