A supertree algorithm for higher taxa /

od Daniel, Philip (Philip James)
Izdano 2003

Counting consistent phylogenetic trees is #P-complete /

od Bordewich, M. (Magnus)
Izdano 2003

Supertree algorithms for ancestral divergence dates and nested taxa /

Izdano 2003

A framework for representing reticulate evolution /

od Baroni, Mihaela
Izdano 2003

Cyclic permutations and evolutionary trees /

od Semple, Charles
Izdano 2002

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

od Bordewich, M. (Magnus)
Izdano 2004

Identifying phylogenetic trees /

od Bordewich, M. (Magnus)
Izdano 2004

Phylogenetic clocks /

od Semple, Charles
Izdano 2004

A platform for supertree algorithms /

od Daniel, Philip (Philip James)
Izdano 2004

Identifying X-trees with few characters /

od Bordewich, M. (Magnus)
Izdano 2004

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

od Semple, Charles
Izdano 1999

Tree reconstruction via a closure operation on partial splits /

od Semple, Charles
Izdano 1999

Tree reconstruction from multi-state characters /

od Semple, Charles
Izdano 2001

Hybrids in real time /

od Baroni, Mihaela
Izdano 2005

Fast computation of compatibility for phylogenies with nested taxa /

od Berry, Vincent
Izdano 2005

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

od Bordewich, M. (Magnus)
Izdano 2004

A cluster reduction for computing the subtree distance between phylogenies /

od Linz, Simone
Izdano 2008

Optimizing phylogenetic diversity with ecological constraints /

od Faller, Beáta
Izdano 2007

Note on the hybridization number and subtree distance in phylogenetics /

od Humphries, Peter J.
Izdano 2008

Hybridization in non-binary trees /

od Linz, Simone
Izdano 2008