Sciweavers

4860 search results - page 138 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
EVOW
2006
Springer
14 years 1 months ago
Improving Graph Colouring Algorithms and Heuristics Using a Novel Representation
Abstract. We introduce a novel representation for the graph colouring problem, called the Integer Merge Model, which aims to reduce the time complexity of an algorithm. Moreover, o...
István Juhos, Jano I. van Hemert
STOC
2010
ACM
176views Algorithms» more  STOC 2010»
14 years 3 months ago
Complexity Theory for Operators in Analysis
We propose a new framework for discussing computational complexity of problems involving uncountably many objects, such as real numbers, sets and functions, that can be represente...
Akitoshi Kawamura and Stephen Cook
WG
2005
Springer
14 years 3 months ago
Fixed-Parameter Algorithms for Protein Similarity Search Under mRNA Structure Constraints
Abstract. In the context of protein engineering, we consider the problem of computing an mRNA sequence of maximal codon-wise similarity to a given mRNA (and consequently, to a give...
Guillaume Blin, Guillaume Fertin, Danny Hermelin, ...
STOC
1989
ACM
117views Algorithms» more  STOC 1989»
14 years 2 months ago
On the Theory of Average Case Complexity
This paper takes the next step in developing the theory of average case complexity initiated by Leonid A Levin. Previous works Levin 84, Gurevich 87, Venkatesan and Levin 88] have...
Shai Ben-David, Benny Chor, Oded Goldreich, Michae...
PODS
2006
ACM
196views Database» more  PODS 2006»
14 years 10 months ago
The containment problem for REAL conjunctive queries with inequalities
Query containment is a fundamental algorithmic problem in database query processing and optimization. Under set semantics, the query-containment problem for conjunctive queries ha...
T. S. Jayram, Phokion G. Kolaitis, Erik Vee