Searching for Most Parsimonious Trees with Simulated Evolutionary Optimization

@inproceedings{Moilanen1999SearchingFM,
  title={Searching for Most Parsimonious Trees with Simulated Evolutionary Optimization},
  author={Atte Moilanen},
  year={1999}
}
This study describes novel algorithms for searching for most parsimonious trees. These algorithms are implemented as a parsimony computer program, PARSIGAL, which performs well even with difficult data sets. For high level search, PARSIGAL uses an evolutionary optimization algorithm, which feeds good tree candidates to a branch-swapping local search procedure. This study also describes an extremely fast method of recomputing state sets for binary characters (additive or nonadditive characters… CONTINUE READING