Sciweavers

130 search results - page 23 / 26
» Finding and Certifying Loops
Sort
View
PLDI
2010
ACM
13 years 11 months ago
Detecting Inefficiently-Used Containers to Avoid Bloat
Runtime bloat degrades significantly the performance and scalability of software systems. An important source of bloat is the inefficient use of containers. It is expensive to cre...
Guoqing Xu, Atanas Rountev
BMCBI
2007
125views more  BMCBI 2007»
13 years 7 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
2005
105views more  BMCBI 2005»
13 years 7 months ago
Secondary structure assignment that accurately reflects physical and evolutionary characteristics
Background: Secondary structure is used in hierarchical classification of protein structures, identification of protein features, such as helix caps and loops, for fold recognitio...
Maria Vittoria Cubellis, Fabien Cailliez, Simon C....
BMCBI
2002
133views more  BMCBI 2002»
13 years 7 months ago
Identification and characterization of subfamily-specific signatures in a large protein superfamily by a hidden Markov model app
Background: Most profile and motif databases strive to classify protein sequences into a broad spectrum of protein families. The next step of such database studies should include ...
Kevin Truong, Mitsuhiko Ikura
CCR
2002
86views more  CCR 2002»
13 years 7 months ago
Hop-by-hop routing algorithms for premium traffic
In Differentiated Service (DiffServ) networks, the routing algorithms used by the premium class traffic, due to the high priority afforded to that traffic, may have a significant ...
Jun Wang, Klara Nahrstedt