We introduce a method to generate multivariate series of symbols from a finite alphabet with agiven hierarchical structure of similarities based on the Hamming distance. The target hierarchical structureof similarities is arbitrary, for instance the one obtained by some hierarchical clustering method applied toan empirical matrix of similarities. The method that we present here is based on a generating mechanismthat does not make use of mutation rate, which is widely used in phylogenetic analysis. Here we use theproposed simulation method to investigate the relationship between the bootstrap value associated witha node of a phylogeny and the probability of finding that node in the true phylogeny. The results of thisanalysis are compared with those obtained in the literature according to an evolutionary model with aper-symbol constant mutation rate. We observe that the relationship between the bootstrap value of anode and the probability of the corresponding clade being correct is sensitive to both the length of dataseries and the length of the branch connecting the node to its closest ancestor in the phylogenetic tree,whereas such a relationship is only slightly affected by the topology of the true phylogeny and by theabsolute value of similarity.
|Numero di pagine||8|
|Rivista||THE EUROPEAN PHYSICAL JOURNAL. B, CONDENSED MATTER PHYSICS|
|Stato di pubblicazione||Published - 2008|
All Science Journal Classification (ASJC) codes