Show simple item record

dc.contributor.authorBenedettini, Stefano
dc.contributor.authorBlum, Christian
dc.contributor.authorRoli, Andrea
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Llenguatges i Sistemes Informàtics
dc.identifier.citationBenedettini, 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.
dc.description.abstractThe 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 iterated greedy algorithm that is able to provide good solutions in a short time span. The experimental evaluation shows that our algorithm is currently the best approximate technique, especially when large problem instances are concerned.
dc.format.extent15 p.
dc.subjectÀrees temàtiques de la UPC::Informàtica::Informàtica teòrica::Algorísmica i teoria de la complexitat
dc.subject.lcshGreedy algorithm
dc.subject.lcshMathematical optimization
dc.subject.lcshProblem solving metaheuristic
dc.titleA randomized iterated greedy algorithm for the founder sequence reconstruction problem
dc.subject.lemacOptimització matemàtica
dc.contributor.groupUniversitat Politècnica de Catalunya. ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals
dc.description.peerreviewedPeer Reviewed
dc.rights.accessRestricted access - publisher's policy
dc.description.versionPostprint (published version)
local.citation.authorBenedettini, S.; Blum, C.; Roli, A.
local.citation.publicationNameLecture notes in computer science

Files in this item


This item appears in the following Collection(s)

Show simple item record

All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder