We extend these algorithms to cost functions that are neither convex nor concave, but a mixture of both. We also apply this technique to related dynamic ...

Sequence Comparison with Mixed Convex and Concave Costs. David Eppstein. Computer Science Department, Columbia University, New York, USA. Work supported in ...

-Concave hull, a generalization of convex hull. Bounding hulls such as convex hull, -shape, -hull, concave hull, crust, etc. · Convex hulls of spheres and convex ...

Sequence comparison with mixed convex and concave costs. D. Eppstein. Tech. Rep. CUCS-382-88, Computer Science Dept., Columbia University, 1988. J ...

David Eppstein: Sequence Comparison with Mixed Convex and Concave Costs. J. Algorithms 11(1): 85-101 (1990). a service of Schloss Dagstuhl - Leibniz Center ...

Sequence comparison with mixed convex and concave costs. D. Eppstein. Tech. Rep. CUCS-382-88, Computer Science Dept., Columbia University, 1988. J ...

Geometric applications of a matrix-searching algorithm. Algorithmica 2 (1987), 195–208. [2] Eppstein, D. Sequence comparison with mixed convex and concave costs ...

No information is available for this page. · Learn why

This paper is devoted to the study of the Monge-Kantorovich theory of optimal mass transport, in the special case of one-dimensional and circular distributions.

A sub-quadratic sequence align- ment algorithm for unrestricted cost matrices. ... Sequence comparison with mixed convex and concave costs. Journal of.