Search For:

Displaying 1-7 out of 7 total
Constructing and Drawing Regular Planar Split Networks
Found in: IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
By Binh Nguyen, Andreas Spillner, Andreas Spillner, Andreas Spillner, Binh Nguyen, Vincent Moulton, Vincent Moulton, Vincent Moulton
Issue Date:March 2012
pp. 395-407
Split networks are commonly used to visualize collections of bipartitions, also called splits, of a finite set. Such collections arise, for example, in evolutionary studies. Split networks can be viewed as a generalization of phylogenetic trees and may be ...
     
SuperQ: Computing Supernetworks from Quartets
Found in: IEEE/ACM Transactions on Computational Biology and Bioinformatics
By Stefan Grunewald,Andreas Spillner,Sarah Bastkowski,Anja Bogershausen,Vincent Moulton
Issue Date:January 2013
pp. 151-160
Supertrees are a commonly used tool in phylogenetics to summarize collections of partial phylogenetic trees. As a generalization of supertrees, phylogenetic supernetworks allow, in addition, the visual representation of conflict between the trees that is n...
 
Constructing and Drawing Regular Planar Split Networks
Found in: IEEE/ACM Transactions on Computational Biology and Bioinformatics
By Andreas Spillner,Binh T. Nguyen,Vincent Moulton
Issue Date:March 2012
pp. 395-407
Split networks are commonly used to visualize collections of bipartitions, also called splits, of a finite set. Such collections arise, for example, in evolutionary studies. Split networks can be viewed as a generalization of phylogenetic trees and may be ...
 
Metrics on Multilabeled Trees: Interrelationships and Diameter Bounds
Found in: IEEE/ACM Transactions on Computational Biology and Bioinformatics
By Katharina T. Huber, Andreas Spillner, Radosław Suchecki, Vincent Moulton
Issue Date:July 2011
pp. 1029-1040
Multilabeled trees or MUL-trees, for short, are trees whose leaves are labeled by elements of some nonempty finite set X such that more than one leaf may be labeled by the same element of X. This class of trees includes phylogenetic trees and tree shapes. ...
 
Computing Phylogenetic Diversity for Split Systems
Found in: IEEE/ACM Transactions on Computational Biology and Bioinformatics
By Andreas Spillner, Binh T. Nguyen, Vincent Moulton
Issue Date:April 2008
pp. 235-244
In conservation biology it is a central problem to measure, predict, and preserve biodiversity as species face extinction. In 1992 Faith proposed measuring the diversity of a collection of species in terms of their relationships on a phylogenetic tree, and...
 
SuperQ: Computing Supernetworks from Quartets
Found in: IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
By Andreas Spillner, Anja Bogershausen, Sarah Bastkowski, Stefan Grunewald, Vincent Moulton
Issue Date:January 2013
pp. 151-160
Supertrees are a commonly used tool in phylogenetics to summarize collections of partial phylogenetic trees. As a generalization of supertrees, phylogenetic supernetworks allow, in addition, the visual representation of conflict between the trees that is n...
     
Metrics on Multilabeled Trees: Interrelationships and Diameter Bounds
Found in: IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
By Andreas Spillner, Katharina T. Huber, Rados law Suchecki, Vincent Moulton
Issue Date:July 2011
pp. 1029-1040
Multilabeled trees or MUL-trees, for short, are trees whose leaves are labeled by elements of some nonempty finite set X such that more than one leaf may be labeled by the same element of X. This class of trees includes phylogenetic trees and tree shapes. ...
     
 1