Reconstructing Optimal Phylogenetic Trees: A Challenge in Experimental Algorithmics

This publication has 23 references indexed in Scilit:

• Steps toward accurate reconstructions of phylogenies from gene-order data
  Journal of Computer and System Sciences, 2002
• Improving memory performance of sorting algorithms
  ACM Journal of Experimental Algorithmics, 2000
• Epstein–Barr Virus Infection
  New England Journal of Medicine, 2000
• Inferring evolutionary trees with strong combinatorial evidence
  Theoretical Computer Science, 2000
• Hybrid tree reconstruction methods
  ACM Journal of Experimental Algorithmics, 1999
• Matrix multiplication
  ACM Journal of Experimental Algorithmics, 1999
• A few logs suffice to build (almost) all trees (I)
  Random Structures & Algorithms, 1999
• Quartet Puzzling: A Quartet Maximum-Likelihood Method for Reconstructing Tree Topologies
  Molecular Biology and Evolution, 1996
• The influence of caches on the performance of heaps
  ACM Journal of Experimental Algorithmics, 1996
• Analyzing algorithms by simulation
  ACM Computing Surveys, 1992