Sciweavers

2214 search results - page 280 / 443
» complexity 2004
Sort
View
RECOMB
2004
Springer
16 years 4 months ago
Discovering temporal relations in molecular pathways using protein-protein interactions
The availability of large-scale protein-protein interaction data provides us with many opportunities to study molecular pathways involving proteins. In this paper we propose to mi...
Martin Farach-Colton, Yang Huang, John L. L. Woolf...
RECOMB
2004
Springer
16 years 4 months ago
Chromosomal breakpoint re-use in the inference of genome sequence rearrangement
In order to apply gene-order rearrangement algorithms to the comparison of genome sequences, Pevzner and Tesler [9] bypass gene finding and ortholog identification, and use the or...
David Sankoff, Phil Trinh
CADE
2004
Springer
16 years 4 months ago
Automatic Generation of Classification Theorems for Finite Algebras
Abstract. Classifying finite algebraic structures has been a major motivation behind much research in pure mathematics. Automated techniques have aided in this process, but this ha...
Simon Colton, Andreas Meier, Volker Sorge, Roy L. ...
STOC
2004
ACM
129views Algorithms» more  STOC 2004»
16 years 4 months ago
Sorting and searching in the presence of memory faults (without redundancy)
We investigate the design of algorithms resilient to memory faults, i.e., algorithms that, despite the corruption of some memory values during their execution, are able to produce...
Irene Finocchi, Giuseppe F. Italiano
OSDI
2004
ACM
16 years 4 months ago
Using Magpie for Request Extraction and Workload Modelling
Tools to understand complex system behaviour are essential for many performance analysis and debugging tasks, yet there are many open research problems in their development. Magpi...
Paul Barham, Austin Donnelly, Rebecca Isaacs, Rich...