16430 search results - page 33 / 3286 » On Computable Tree Functions |
MFCS
2009
Springer
14 years 2 months ago
2009
Springer
We introduce the tree evaluation problem, show that it is in LogDCFL (and hence in P), and study its branching program complexity in the hope of eventually proving a superlogarith...
ECCB
2008
IEEE
14 years 2 months ago
2008
IEEE
Motivation: Mapping of remote evolutionary links is a classic computational problem of much interest. Relating protein families allows for functional and structural inference on u...
BMCBI
2007
13 years 7 months ago
2007
Background: Protein-protein interactions are critical for cellular functions. Recently developed computational approaches for predicting protein-protein interactions utilize co-ev...
ESA
2008
Springer
13 years 9 months ago
2008
Springer
Given an n-node graph and a subset of k terminal nodes, the NP-hard Steiner tree problem is to compute a minimum-size tree which spans the terminals. All the known algorithms for t...
CATS
2007
13 years 9 months ago
2007
Given a set S of n points in the plane, a minimumdilation spanning tree of S is a tree with vertex set S of smallest possible dilation. We show that given a set S of n points and ...