2 resultados para Minimum spanning tree
em Aquatic Commons
Resumo:
The minimum spanning tree algorithm is used to classify two sets of planktonic copepod samples. This algorithm links the samples the distance of which is minimum, without doing a loop, so that the sum of the segment lengths is minimum. The authors estimated the distance between samples by 2 different ways: by a coefficient of association the Jaccard's index - and by the x2 distance. Jaccard's index is not retained but the use of the x2 distance allows comparison with the 'analyse factorielle des correspondances'. The results are discussed from an ecological point of view.
Resumo:
The taxonomic status of Sebastes vulpes and S. zonatus were clarified by comprehensive genetic (amplif ied fragment length polymorphisms [AFLP] and mitochondrial DNA [mtDNA] variation) and morphological analyses on a total of 65 specimens collected from a single locality. A principal coordinate analysis based on 364 AFLP loci separated the specimens completely into two genetically distinct groups that corresponded to S. vulpes and S. zonatus according to body coloration and that indicated that they are reproductively isolated species. Significant morphological differences were also evident between the two groups; 1) separation by principal component analysis based on 31 measurements, and 2)separation according to differences in counts of gill rakers and dorsal-fin spines without basal scales, and in the frequencies of specimens with small scales on the lower jaw. Restriction of gene flow between the two groups was also indicated by the pairwise ΦST values estimated from variations in partial sequences from the mtDNA control region, although the minimum spanning network did not result in separation into distinct clades. The latter was likely due to incomplete lineage sorting between S. vulpes and S. zonatus owing to their recent speciation.