#include <stdlib.h>#include <string.h>#include <assert.h>#include "util.h"#include "log.h"#include "muscle_upgma.h"#include "tree.h"Functions | |
| void | GuideTreeUpgma (tree_t **tree, char **labels, symmatrix_t *distmat, char *ftree) |
| Creates a UPGMA guide tree. This is a frontend function to the ported Muscle UPGMA code (). | |
| int | GuideTreeFromFile (tree_t **tree, mseq_t *mseq, char *ftree) |
| void | TraverseTree (int **piOrderLR_p, tree_t *tree, mseq_t *mseq) |
| Depth first traversal of tree, i.e. leaf nodes (sequences) will be visited first. Order can be used to guide progressive alignment order. | |
| [out] | tree | created upgma tree. will be allocated here. use FreeMuscleTree() to free |
| [in] | mseq | |
| [in] | ftree |
| void GuideTreeUpgma | ( | tree_t ** | tree, | |
| char ** | labels, | |||
| symmatrix_t * | distmat, | |||
| char * | ftree | |||
| ) |
Creates a UPGMA guide tree. This is a frontend function to the ported Muscle UPGMA code ().
| [out] | tree | created upgma tree. will be allocated here. use FreeMuscleTree() to free |
| [in] | labels | pointer to nseq sequence names |
| [in] | distmat | distance matrix |
| [in] | ftree | optional: if non-NULL, tree will be written to this files |
Depth first traversal of tree, i.e. leaf nodes (sequences) will be visited first. Order can be used to guide progressive alignment order.
| [out] | piOrderLR_p | order in which left/right nodes (profiles) are to be aligned. allocated here; caller must free. |
| [in] | tree | The tree to traverse; has to be rooted |
| [in] | mseq | corresponding multiple sequence structure |
1.6.3