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 ...
This paper describes an algorithm for detecting empty nodes in the Penn Treebank (Marcus et al., 1993), finding their antecedents, and assigning them function tags, without access...
There has recently been considerable research on physical design tuning algorithms. At the same time, there is only one published methodology to evaluate the quality of different,...
The backend database system is often the performance bottleneck when running web applications. A common approach to scale the database component is query result caching, but it fa...
Charles Garrod, Amit Manjhi, Anastasia Ailamaki, B...
Hard problems for metaheuristic search can be a source of insight for developing better methods. We examine a challenging instance of such a problem that has exactly two local opt...