A Parthenogenetic Algorithm for the Founder Sequence Reconstruction Problem


The maximum fragment length (MFL) is an important computational model for solving the founder sequence reconstruction problem. Benedettini et al. presented a meta-heuristic algorithm BACKFORTH based on iterative greedy method. The BACKFORTH algorithm starts with a single initial solution, and iteratively alternates between a partial destruction and… (More)
DOI: 10.4304/jcp.8.11.2934-2941


8 Figures and Tables

Slides referencing similar topics