SplitsTree

More documents

Recommendations

Info

Splits and splits graphs • Any given system of splits can be represented by a splits graph G. G Note that: • G is a tree iff is compatible (e.g. Neighbor-Joining) • G is outer- labeled- planar iff is circular (e.g. Neighbor-Net, Net, Bryant & Moulton 2002) • G is usually planar or only mildy non-planar iff is weakly compatible (e.g. Split Decomposition) • G is always subgraph of n-dim. hypercube (e.g. recoding of sequences, spectral analysis, median networks, consensus networks, Z-super networks) (Theory of splits worked out by Bandelt and Dress 1992)
<strong>SplitsTree</strong> 3. 2 Implements split decomposition and related methods First version developed with Rainer Wetzel in 1995 Current version 3.2 in C++ using Tcl-TkTk Runs under Linux, Unix, Windows and MacOS
Page 1 and 2: SplitsTree4 - a Java Framework for
Page 3 and 4: Trees vs networks • Evolutionary
Page 5 and 6: Computed using Neighbor-Joining Tre
Page 7: Networks and splits Cut-set of para
Page 11 and 12: Data flow in SplitsTree Taxa Taxa a
Page 13 and 14: SplitsTree Windows
Page 15 and 16: SplitsTree Editor
Page 17 and 18: Individual Gene Trees ITS03 40 taxa
Page 19 and 20: Individual Gene Trees SSU03 40 taxa
Page 21 and 22: Gene Trees as Super Network
Page 23 and 24: Gene Trees as Super Network ITS03+
Page 25 and 26: Gene Trees as Super Network ITS00+
Page 27 and 28: Exponential Explosion Methods like
Page 29 and 30: All splits of 50 Gene Trees on Arch
Page 31 and 32: Summary SplitsTree provides a fram

SplitsTree

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?