Searched refs:taxa_names (Results 1 – 7 of 7) sorted by relevance
/dports/biology/iqtree/IQ-TREE-2.0.6/booster/ |
H A D | tree_utils.c | 50 my_tree = new_tree(tree->nb_taxa, tree->taxa_names[indices[nb_inserted_taxa++]]); in gen_random_tree() 53 graft_new_node_on_branch(NULL, my_tree, 0.5, 1.0, tree->taxa_names[indices[nb_inserted_taxa++]]); in gen_random_tree() 58 …graft_new_node_on_branch(my_tree->a_edges[edge_ind], my_tree, 0.5, 1.0, tree->taxa_names[indices[n… in gen_random_tree()
|
H A D | tree.c | 604 if(strcmp(n_to_remove->name,tree->taxa_names[i]) != 0){ in remove_taxon() 605 new_taxa_names[j] = strdup(tree->taxa_names[i]); in remove_taxon() 608 free(tree->taxa_names[i]); in remove_taxon() 610 free(tree->taxa_names); in remove_taxon() 611 tree->taxa_names=new_taxa_names; in remove_taxon() 1338 t->taxa_names = (char**) malloc(n_otu * sizeof(char*)); in parse_nh_string() 1974 for (i=0; i < tree->nb_taxa; i++) free(tree->taxa_names[i]); in free_tree() 1976 free(tree->taxa_names); in free_tree() 1983 Tree * gen_rand_tree(int nbr_taxa, char **taxa_names){ in gen_rand_tree() argument 1997 if(taxa_names == NULL){ in gen_rand_tree() [all …]
|
H A D | tree.h | 101 char** taxa_names; /* store only once the taxa names */ member 276 Tree * gen_rand_tree(int nbr_taxa, char **taxa_names);
|
/dports/biology/iqtree/IQ-TREE-2.0.6/tree/ |
H A D | constrainttree.cpp | 115 int ConstraintTree::removeTaxa(StrVector &taxa_names) { in removeTaxa() argument 116 if (taxa_names.empty()) in removeTaxa() 118 int count = MTree::removeTaxa(taxa_names); in removeTaxa()
|
H A D | constrainttree.h | 54 virtual int removeTaxa(StrVector &taxa_names);
|
H A D | mtree.h | 787 virtual int removeTaxa(StrVector &taxa_names);
|
H A D | mtree.cpp | 2616 int MTree::removeTaxa(StrVector &taxa_names) { in removeTaxa() argument 2617 if (taxa_names.empty()) in removeTaxa() 2620 for (StrVector::iterator sit = taxa_names.begin(); sit != taxa_names.end(); sit++) { in removeTaxa()
|