We describe a novel method for efficient reconstruction of phylogenetic trees, based on sequences of whole genomes or proteomes, whose lengths may greatly vary. The core of our me...
David Burstein, Igor Ulitsky, Tamir Tuller, Benny ...
We consider succinct, or highly space-efficient, representations of a (static) string consisting of n pairs of balanced parentheses, that support natural operations such as findi...
Richard F. Geary, Naila Rahman, Rajeev Raman, Venk...
We present results related to satisfying shortest path queries on a planar graph stored in external memory. Let N denote the number of vertices in the graph and let sort(N) denote...
We describe a novel method for efficient reconstruction of phylogenetic trees, based on sequences of whole genomes or proteomes, whose lengths may greatly vary. The core of our me...
Igor Ulitsky, David Burstein, Tamir Tuller, Benny ...
Phrase structure trees have a hierarchical structure. In many subjects, most notably in taxonomy such tree structures have been studied using ultrametrics. Here syntactical hierar...