Sciweavers

2254 search results - page 327 / 451
» Computing the minimal covering set
Sort
View
209
Voted
MCMASTER
1993
15 years 10 months ago
A Taste of Rewrite Systems
Abstract. This survey of the theory and applications of rewriting with equations discusses the existence and uniqueness of normal forms, the Knuth-Bendix completion procedure and i...
Nachum Dershowitz
FAST
2007
15 years 7 months ago
Disk Failures in the Real World: What Does an MTTF of 1, 000, 000 Hours Mean to You?
Component failure in large-scale IT installations is becoming an ever larger problem as the number of components in a single cluster approaches a million. In this paper, we presen...
Bianca Schroeder, Garth A. Gibson
158
Voted
BMCBI
2010
142views more  BMCBI 2010»
15 years 6 months ago
Classification of protein sequences by means of irredundant patterns
Background: The classification of protein sequences using string algorithms provides valuable insights for protein function prediction. Several methods, based on a variety of diff...
Matteo Comin, Davide Verzotto
BMCBI
2010
151views more  BMCBI 2010»
15 years 6 months ago
Misty Mountain clustering: application to fast unsupervised flow cytometry gating
Background: There are many important clustering questions in computational biology for which no satisfactory method exists. Automated clustering algorithms, when applied to large,...
István P. Sugár, Stuart C. Sealfon
BMCBI
2008
86views more  BMCBI 2008»
15 years 6 months ago
Predicting protein linkages in bacteria: Which method is best depends on task
Background: Applications of computational methods for predicting protein functional linkages are increasing. In recent years, several bacteria-specific methods for predicting link...
Anis Karimpour-Fard, Sonia M. Leach, Ryan T. Gill,...