2219 search results - page 403 / 444 » Dynamic Programming and Graph Algorithms in Computer Vision |
132
click to vote
ISMB
1996
15 years 3 months ago
1996
Determining whether two DNA sequences are similar is an essential component of DNA sequence analysis. Dynamic programming is the algorithm of choice if computational time is not t...
113
click to vote
ICALP
2005
Springer
15 years 7 months ago
2005
Springer
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
156
click to vote
WABI
2009
Springer
15 years 8 months ago
2009
Springer
Background: Frameshift mutations in protein-coding DNA sequences produce a drastic change in the resulting protein sequence, which prevents classic protein alignment methods from ...
123
click to vote
EMSOFT
2004
Springer
15 years 7 months ago
2004
Springer
We present a technique to approximate the worst-case execution time that combines structural analysis with a loop-bounding algorithm based on local induction variable analysis. St...
127
click to vote
BIBE
2005
IEEE
15 years 7 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 ...