From tichen Tue Aug 6 16:08:05 1996 Received: from sbvassili.csdept (sbvassili.cs.sunysb.edu [130.245.15.4]) by cs.sunysb.edu (8.6.12/8.6.9) with SMTP id QAA20069 for ; Tue, 6 Aug 1996 16:08:04 -0400 Date: Tue, 6 Aug 1996 16:08:04 -0400 From: Ting Chen Message-Id: <199608062008.QAA20069@cs.sunysb.edu> To: skiena Subject: README Status: RO this program is using vectors for outedges of a suffix node. For DNA sequences, each node will have 5 out edges, representing nucleotides a c g t and n(unknown). This program is to build one suffix tree for multiple strings, which can be used for searching common substrings or patterns among different strings but requires extra memory for leaves because a leaf can be shared by several strings. Node *initial_suffix_tree() - Initializing suffix trees and return the root of the tree. Leaf *add_a_string(Node *root, char *str, int id) - Adding a string *str into Suffix Tree *root with string label id and return the pointer to the first leaf of $str. Usage : Node *root; Leaf *leaf; root = initial_suffix_tree(); leaf = add_a_string(root, str, 0);