All Figures

$\begin{figure} \par\includegraphics[width=9cm,clip]{5098fig1.eps} \end{figure}$ Figure 1: Best tree with 14 galaxies obtained by a maximum parsimony analysis of 24 characters as described in the text. It has 167 steps, the consistency $\rm index=0.68$ , retention $\rm index=0.75$ , rescaled consistency $\rm index=0.51$ . Numbers at each node are bootstrap ( above) and decay ( below) values. Bootstrap percentages are obtained after 1000 resamplings of the characters. Decay indexes correspond to the minimum number of character-state changes to be added to the tree length to break the corresponding node.
Open with DEXTER

In the text

$\begin{figure} \par\includegraphics[width=9cm,clip]{5098fig2.eps} \end{figure}$ Figure 2: This tree with the 36 dwarf galaxies of the Local Group is the strict consensus of those 1041 most parsimonious trees that have 317 steps each. Groups corresponding to sub-structures are indicated and discussed in the text.
Open with DEXTER

In the text

$\begin{figure} \par\includegraphics[width=15cm,clip]{5098f3p1.eps} \end{figure}$ Figure 3: Colour-coded projection of characters with the convention that the white code is always the lowest value of the corresponding parameter. Small squares at the leaves (before galaxy name) indicate a documented value for that character. The other leaves are given a value deduced from a parsimony analysis, providing a prediction for the corresponding galaxy. The colour code for galaxy names is given at the end of figure. Morphology is plotted but was not used to derive the tree.
Open with DEXTER

In the text

$\begin{figure} \par\includegraphics[width=15cm,clip]{5098f3p2.eps} \end{figure}$ Figure 3: continued.
Open with DEXTER

In the text

$\begin{figure} \par\includegraphics[width=15cm,clip]{5098f3p3.eps} \end{figure}$ Figure 3: continued.
Open with DEXTER

In the text

$\begin{figure} \par\includegraphics[width=9cm,clip]{5098fig2.eps} \end{figure}$	Figure 2: This tree with the 36 dwarf galaxies of the Local Group is the strict consensus of those 1041 most parsimonious trees that have 317 steps each. Groups corresponding to sub-structures are indicated and discussed in the text.
Open with DEXTER

$\begin{figure} \par\includegraphics[width=15cm,clip]{5098f3p2.eps} \end{figure}$	Figure 3: continued.
Open with DEXTER