4860 search results - page 356 / 972 » SNPs Problems, Complexity, and Algorithms |
152
Voted
IWOCA
2010
Springer
14 years 10 months ago
2010
Springer
We consider here the problem of chaining seeds in ordered trees. Seeds are mappings between two trees Q and T and a chain is a subset of non overlapping seeds that is consistent wi...
182
Voted
FOCS
2002
IEEE
15 years 8 months ago
2002
IEEE
The Constraint Satisfaction Problem (CSP) provides a common framework for many combinatorial problems. The general CSP is known to be NP-complete; however, certain restrictions on...
122
Voted
CLUSTER
2008
IEEE
15 years 10 months ago
2008
IEEE
—Divisible load model allows scheduling algorithms that give nearly optimal makespan with practical computational complexity. Beaumont et al. have shown that their algorithm prod...
126
Voted
TEC
2008
15 years 3 months ago
2008
Evolutionary Algorithms (EAs) are well-known optimization approaches to cope with non-linear, complex problems. These population-based algorithms, however, suffer from a general we...
150
Voted
ACL
2010
15 years 1 months ago
2010
The Viterbi algorithm is the conventional decoding algorithm most widely adopted for sequence labeling. Viterbi decoding is, however, prohibitively slow when the label set is larg...