Sciweavers

564 search results - page 68 / 113
» Linear Time Algorithms for Exact Distance Transform
Sort
View
BMCBI
2002
108views more  BMCBI 2002»
13 years 10 months ago
A memory-efficient dynamic programming algorithm for optimal alignment of a sequence to an RNA secondary structure
Background: Covariance models (CMs) are probabilistic models of RNA secondary structure, analogous to profile hidden Markov models of linear sequence. The dynamic programming algo...
Sean R. Eddy
CPM
2008
Springer
148views Combinatorics» more  CPM 2008»
13 years 12 months ago
On-Line Approximate String Matching with Bounded Errors
We introduce a new dimension to the widely studied on-line approximate string matching problem, by introducing an error threshold parameter so that the algorithm is allowed to mis...
Marcos A. Kiwi, Gonzalo Navarro, Claudio Telha
COR
2010
177views more  COR 2010»
13 years 10 months ago
Hybridization of very large neighborhood search for ready-mixed concrete delivery problems
Companies in the concrete industry are facing the following scheduling problem on a daily basis: concrete produced at several plants has to be delivered at customers' constru...
Verena Schmid, Karl F. Doerner, Richard F. Hartl, ...
DAC
1996
ACM
14 years 2 months ago
A Parallel Precorrected FFT Based Capacitance Extraction Program for Signal Integrity Analysis
In order to optimize interconnect to avoid signal integrity problems, very fast and accurate 3-D capacitance extraction is essential. Fast algorithms, such as the multipole or prec...
Narayan R. Aluru, V. B. Nadkarni, James White
ICIP
2005
IEEE
14 years 11 months ago
Efficient neighborhood-based computations on regions using scans
Many basic computations can be done by means of iterative neighborhood-based calculations, including threshold, optimum, distance transform, contour closing, mathematical morpholo...
Alain Mérigot, Bertrand Ducourthial, Nicola...