A supertree algorithm for higher taxa /

per Daniel, Philip (Philip James)
Publicat 2003

Counting consistent phylogenetic trees is #P-complete /

per Bordewich, M. (Magnus)
Publicat 2003

Supertree algorithms for ancestral divergence dates and nested taxa /

Publicat 2003

A framework for representing reticulate evolution /

per Baroni, Mihaela
Publicat 2003

Cyclic permutations and evolutionary trees /

per Semple, Charles
Publicat 2002

Computing the rooted subtree prune and distance is NP-hard /

per Bordewich, M. (Magnus)
Publicat 2004

Identifying phylogenetic trees /

per Bordewich, M. (Magnus)
Publicat 2004

Phylogenetic clocks /

per Semple, Charles
Publicat 2004

A platform for supertree algorithms /

per Daniel, Philip (Philip James)
Publicat 2004

Identifying X-trees with few characters /

per Bordewich, M. (Magnus)
Publicat 2004

A characterization for a set of partial partitions to define an X-tree /

per Semple, Charles
Publicat 1999

Tree reconstruction via a closure operation on partial splits /

per Semple, Charles
Publicat 1999

Tree reconstruction from multi-state characters /

per Semple, Charles
Publicat 2001

Hybrids in real time /

per Baroni, Mihaela
Publicat 2005

Fast computation of compatibility for phylogenies with nested taxa /

per Berry, Vincent
Publicat 2005

Computing the minimum number of hybridisation events for a consistent evolutionary history /

per Bordewich, M. (Magnus)
Publicat 2004

A cluster reduction for computing the subtree distance between phylogenies /

per Linz, Simone
Publicat 2008

Optimizing phylogenetic diversity with ecological constraints /

per Faller, Beáta
Publicat 2007

Note on the hybridization number and subtree distance in phylogenetics /

per Humphries, Peter J.
Publicat 2008

Hybridization in non-binary trees /

per Linz, Simone
Publicat 2008