Skip to main content


Phylogenetics: New data, new challenges

Edited by Vincent Moulton, Mike Steel and Tandy Warnow

View all collections published in Algorithms for Molecular Biology.

  1. Research

    The space of phylogenetic mixtures for equivariant models

    The selection of an evolutionary model to best fit given molecular data is usually a heuristic choice. In his seminal book, J. Felsenstein suggested that certain linear equations satisfied by the expected prob...

    Marta Casanellas, Jesús Fernández-Sánchez and Anna M Kedzierska

    Algorithms for Molecular Biology 2012 7:33

    Published on: 28 November 2012

  2. Research

    Maximum Parsimony on Phylogenetic networks

    Phylogenetic networks are generalizations of phylogenetic trees, that are used to model evolutionary events in various contexts. Several different methods and criteria have been introduced for reconstructing p...

    Lavanya Kannan and Ward C Wheeler

    Algorithms for Molecular Biology 2012 7:9

    Published on: 2 May 2012

  3. Research

    Computing evolutionary distinctiveness indices in large scale analysis

    We present optimal linear time algorithms for computing the Shapley values and 'heightened evolutionary distinctiveness' (HED) scores for the set of taxa in a phylogenetic tree. We demonstrate the efficiency o...

    Iain Martyn, Tyler S Kuhn, Arne O Mooers, Vincent Moulton and Andreas Spillner

    Algorithms for Molecular Biology 2012 7:6

    Published on: 13 April 2012

  4. Research

    MRL and SuperFine+MRL: new supertree methods

    Supertree methods combine trees on subsets of the full taxon set together to produce a tree on the entire set of taxa. Of the many supertree methods, the most popular is MRP (Matrix Representation with Parsimo...

    Nam Nguyen, Siavash Mirarab and Tandy Warnow

    Algorithms for Molecular Biology 2012 7:3

    Published on: 26 January 2012