10988 search results - page 366 / 2198 » Algorithmic Folding Complexity |
145
Voted
BMCBI
2006
15 years 5 months ago
2006
Background: Benchmarking algorithms in structural bioinformatics often involves the construction of datasets of proteins with given sequence and structural properties. The SCOP da...
133
Voted
ANTS
2004
Springer
15 years 10 months ago
2004
Springer
The binary algorithm is a variant of the Euclidean algorithm that performs well in practice. We present a quasi-linear time recursive algorithm that computes the greatest common di...
145
click to vote
SPAA
2010
ACM
15 years 9 months ago
2010
ACM
This paper presents the design and analysis of parallel approximation algorithms for facility-location problems, including NC and RNC algorithms for (metric) facility location, k-...
142
click to vote
INFOCOM
2007
IEEE
15 years 11 months ago
2007
IEEE
— We propose new algorithms to achieve k-coverage in dense sensor networks. In such networks, covering sensor locations approximates covering the whole area. However, it has been...
154
click to vote
GECCO
2007
Springer
15 years 11 months ago
2007
Springer
In the longest common subsequence problem the task is to find the longest sequence of letters that can be found as subsequence in all members of a given finite set of sequences....