#### Filter Results:

#### Publication Year

2008

2009

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

#### Data Set Used

Learn More

We prove that maximum weight branchings in directed graphs can be approximated in time O(m) up to a factor of 1 − ǫ, where ǫ > 0 is an arbitrary constant.

The Superimposé webserver performs structural similarity searches with a preference towards 3D structure-based methods. Similarities can be detected between small molecules (e.g. drugs), parts of large structures (e.g. binding sites of proteins) and entire proteins. For this purpose, a number of algorithms were implemented and various databases are… (More)

Bayesian Network structures with a maximum in-degree of k can be approximated with respect to a positive scoring metric up to an factor of 1/k.

- ‹
- 1
- ›