777 search results - page 3 / 156 » A fast algorithm for the computation of an upper bound on th... |
BMCBI
2006
13 years 7 months ago
2006
Background: Structure matching plays an important part in understanding the functional role of biological structures. Bioinformatics assists in this effort by reformulating this p...
COLT
2008
Springer
13 years 9 months ago
2008
Springer
A pseudo-Boolean function is a real-valued function defined on {0, 1}n . A k-bounded function is a pseudo-Boolean function that can be expressed as a sum of subfunctions each of w...
WABI
2007
Springer
14 years 1 months ago
2007
Springer
Predicting the secondary structure of an RNA sequence is an important problem in structural bioinformatics. The general RNA folding problem, where the sequence to be folded may con...
ICPR
2010
IEEE
13 years 7 months ago
2010
IEEE
Abstract—Nearest Neighbour search is a widely used technique in Pattern Recognition. In order to speed up the search many indexing techniques have been proposed. However, most of...
IPL
2000
13 years 7 months ago
2000
A polynomial time algorithm is developed for computing an upper bound for the rotation distance of binary trees and equivalently for the diagonal-flip distance of convex polygons ...