Carregant...
Carregant...

Vés al contingut (premeu Retorn)

A randomized iterated greedy algorithm for the founder sequence reconstruction problem

Autor
Benedettini, S.; Blum, C.; Roli, A.
Tipus d'activitat
Article en revista
Revista
Lecture notes in computer science
Data de publicació
2010-04
Número
6073
Pàgina inicial
37
Pàgina final
51
DOI
https://doi.org/10.1007/978-3-642-13800-3_4 Obrir en finestra nova
Repositori
http://hdl.handle.net/2117/11411 Obrir en finestra nova
Resum
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. Basing our work on previous ideas outlined in [1], we developed a randomized itera...
Citació
Benedettini, S.; Blum, C.; Roli, A. A randomized iterated greedy algorithm for the founder sequence reconstruction problem. "Lecture notes in computer science", Abril 2010, núm. 6073, p. 37-51.
Grup de recerca
ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals

Participants