4860 search results - page 425 / 972 » SNPs Problems, Complexity, and Algorithms |
166
click to vote
DAM
1999
15 years 3 months ago
1999
Several graph problems (e.g., steiner tree, connected domination, hamiltonian path, and isomorphism problem), which can be solved in polynomial time for distance-hereditary graphs...
170
click to vote
EDBT
2011
ACM
14 years 7 months ago
2011
ACM
Data integration systems offer users a uniform interface to a set of data sources. Previous work has typically assumed that the data sources are independent of each other; however...
128
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
In a sampling problem, we are given an input x {0, 1} n , and asked to sample approximately from a probability distribution Dx over poly (n)-bit strings. In a search problem, we ...
148
Voted
BIBE
2005
IEEE
15 years 9 months ago
2005
IEEE
We propose a method for finding seeds for the local alignment of two nucleotide sequences. Our method uses randomized algorithms to find approximate seeds. We present a dynamic ...
148
click to vote
DMIN
2008
15 years 5 months ago
2008
The knowledge discovery process encounters the difficulties to analyze large amount of data. Indeed, some theoretical problems related to high dimensional spaces then appear and de...