90 #endif // endif TREE_H_ double check_path(Tree *tree_ptr, char *read, int Lread)
checks if read is found in tree and outputs a score
Definition: tree.c:199
void insert_Lmer(Tree *tree_ptr, char *Lmer)
Lmer insertion in the tree (depth L).
Definition: tree.c:145
stores sequences of a fasta file
Definition: fa_read.h:46
reads in and stores fasta files
struct _node Node
Node structure: formed out of T_ACGT pointers to Node structure.
void free_all_nodes(Tree *tree_ptr)
frees the whole tree structure
Definition: tree.c:117
Node structure: formed out of T_ACGT pointers to Node structure.
Definition: tree.h:40
Tree * read_tree(char *filename)
read tree from file
Definition: tree.c:309
Node * get_new_pool(Tree *tree_ptr)
reallocs pool_2D (++NPOOL_2D) if all existing nodes have been used
Definition: tree.c:44
uint32_t pool_available
Definition: tree.h:63
struct _node * children[T_ACGT]
Definition: tree.h:41
Tree * tree_from_fasta(Fa_data *fasta, int L)
create Tree structure from fasta structure.
Definition: tree.c:177
void save_tree(Tree *tree_ptr, char *filename)
saves Tree to disk in filename
Definition: tree.c:237
void insert_entry(Tree *tree_ptr, Fa_entry *entry)
fasta entry insertion in the tree (depth L).
Definition: tree.c:162
uint32_t pool_count
Definition: tree.h:62
struct _tree Tree
structure containing a T_ACGT-tree.
uint32_t nnodes
Definition: tree.h:64
Node * new_node_buf(Tree *tree_ptr)
moves to the next node (allocating new memory if necessary)
Definition: tree.c:84
Node ** pool_2D
Definition: tree.h:65
structure containing a T_ACGT-tree.
Definition: tree.h:60
fasta entry
Definition: fa_read.h:38
uint32_t L
Definition: tree.h:61
#define T_ACGT
Definition: defines.h:84