Sciweavers

1136 search results - page 177 / 228
» Finding Small Holes
Sort
View
SODA
1998
ACM
157views Algorithms» more  SODA 1998»
13 years 10 months ago
A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
Bang Ye Wu, Giuseppe Lancia, Vineet Bafna, Kun-Mao...
ATAL
2010
Springer
13 years 9 months ago
Exploiting scale invariant dynamics for efficient information propagation in large teams
Large heterogeneous teams will often be in situations where sensor data that is uncertain and conflicting is shared across a peer-to-peer network. Not every team member will have ...
Robin Glinton, Paul Scerri, Katia P. Sycara
BMCBI
2007
125views more  BMCBI 2007»
13 years 8 months ago
Statistical tests to compare motif count exceptionalities
Background: Finding over- or under-represented motifs in biological sequences is now a common task in genomics. Thanks to p-value calculation for motif counts, exceptional motifs ...
Stéphane Robin, Sophie Schbath, Vincent Van...
BMCBI
2007
97views more  BMCBI 2007»
13 years 8 months ago
Relating destabilizing regions to known functional sites in proteins
Background: Most methods for predicting functional sites in protein 3D structures, rely on information on related proteins and cannot be applied to proteins with no known relative...
Benoit H. Dessailly, Marc F. Lensink, Shoshana J. ...
BMCBI
2010
86views more  BMCBI 2010»
13 years 8 months ago
The oligodeoxynucleotide sequences corresponding to never-expressed peptide motifs are mainly located in the non-coding strand
Background: We study the usage of specific peptide platforms in protein composition. Using the pentapeptide as a unit of length, we find that in the universal proteome many pentap...
Giovanni Capone, Giuseppe Novello, Candida Fasano,...