The suux tree of a string is the fundamental data structure of combinatorial pattern matching. Weiner Wei73], who introduced the data structure, gave an O(n) time algorithm algorithm for building theâ€¦ (More)

Emerging applications in multi-media and the Human Genome Project require storage and searching of large databases of strings { a task for which parallelism seems the only hope. In this paper, weâ€¦ (More)

We study the problem of local register allocation (LRA): assign pseudo-registers to actual registers in a basic block so as to minimize the spill cost. Our version of LRA does not allow instructionâ€¦ (More)

Journal of computational biology : a journal ofâ€¦

1997

Circular decomposable metrics (CDMs) have been used in phylogenetic studies. The fastest algorithm for recognizing a CDM runs in time O(n5), given an n x n table of pairwise distances. We give anâ€¦ (More)

There are many solutions to the string matching problem which are strictly linear in the input size and independent of alphabet size. Furthermore, the model of computation for these algorithms isâ€¦ (More)

We consider the problem of tting an n n distance matrix D by a tree metric T. This problem is NP-hard for most reasonable distance functions between D and T. Within the biology community, theâ€¦ (More)