| Títol: | Tabu search for the founder sequence reconstruction problem: a preliminary study |
| Autor: | Roli, Andrea
Blum, Christian |
| Altres autors/autores: | Universitat Politècnica de Catalunya. Departament de Llenguatges i Sistemes Informàtics |
| Matèries: | Àrees temàtiques de la UPC::Informàtica::Intel·ligència artificial
Heuristic programming
Programació heurística |
| Tipus de document: | Article |
| Descripció: | The problem of inferring ancestral genetic information in terms of a set of founders of a given population arises in various biological contexts. In optimization terms, this problem can be formulated as a
combinatorial string problem. The main problem of existing techniques, both exact and heuristic, is that their time complexity scales exponentially, which makes them impractical for solving large-scale instances. We developed a new constructive heuristic and a tabu search method with
the explicit aim of providing solutions in a reduced amount of computation time. Experimental results show that when the number of founders grows, our algorithms have advantages over the ones proposed in the
literature. |
| Altres identificadors i accés: | Roli, A.; Blum, C. Tabu search for the founder sequence reconstruction problem: a preliminary study. "Lecture notes in computer science", 2009, vol. 5518, p. 1035-1042.
0302-9743
http://hdl.handle.net/2117/7130
http://dx.doi.org/10.1007/978-3-642-02481-8_157 |
| Disponible al dipòsit: | E-prints UPC
|
| Comparteix: |
|
Tots els ítems dipositats a UPCommons estan protegits per drets d'autor.
|
