The complexity of deriving multi trees from

Vincent Moulton

Description

The complexity of deriving multi-trees from sets of bipartitions Vincent Moulton, School of Computing Sciences

• multi-trees


• modelling polyploidy


• bengt oxelman


• computing sciences


• multiple possibilties


• joint work

Sujets

• Moulton
• Computer science

Informations

• Publié par: pefav
• Nombre de lectures: 12
• Langue: English
• Poids de l'ouvrage: 6 Mo

Extrait

The complexity of deriving multi-trees from sets of bipartitions

Vincent Moulton, School of Computing Sciences