BuST-Bundled Suffix Trees

We introduce a data structure, the Bundled Suffix Tree (BUST), that is a generalization of a Suffix Tree (ST). To build a BuST we use an alphabet \u3a3 together with a non-transitive relation 48 among its letters. Following the path of a substring \u3b2 within a BUST, constructed over a text \u3b1 of length n, not only the positions of the exact occurrences of \u3b2 in \u3b1 are found (as in a ST), but also the positions of all the substrings \u3b11, \u3b12, \u3b13 ef that are related with \u3b2 via the relation 48 among the characters of 11, for example strings at a certain \u201cdistance\u201d from \u3b2. A BuST contains O(n 1+\u3b4) additional nodes (\u3b4 < 1) in probability, and is constructed in O(n 1+\u3b4) steps. In the worst case it contains O(n 2) nodes. Please use the following format when citing this chapter: Bortolussi, L., Fabris, F., Policriti, A., 2006, in International Federation for Information Processing, Volume 209, Fourth IFIP International Conference on Theoretical Computer Science-TCS 2006, eds. Navarro, G., Bertossi, L., Kohayakwa, Y., (Boston: Springer). pp. 91\u2013102