Constrained Minkowski sums: A geometric framework for solving interval problems in computational biology efficiently

DOI10.1007/s00454-009-9178-yzbMath1194.68244OpenAlexW2032102704MaRDI QIDQ1028588

Thorsten Bernholt, Friedrich Eisenbrand, Thomas Hofmeister

Publication date: 6 July 2009

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00454-009-9178-y

zbMATH Keywords

Minkowski sumscomputational biologyconvex hullsinterval problems

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Uses Software

• ftnonpar

Cites Work

• Unnamed Item
• Unnamed Item
• A convex polygon among polygonal obstacle: Placement and high-clearance motion
• The convex dimension of a graph
• Convexly independent subsets of the Minkowski sum of planar point sets
• On the general motion-planning problem with two degrees of freedom
• Largest placement of one convex polygon inside another
• Linear-time algorithms for computing maximum-density sequence segments with bioinformatics applications
• Local extremes, runs, strings and multiresolution. (With discussion)
• Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis.
• An Algorithm for a Generalized Maximum Subsequence Problem
• An Optimal Algorithm for Maximum-Sum Segment and Its Application in Bioinformatics
• Research in Computational Molecular Biology

This page was built for publication: Constrained Minkowski sums: A geometric framework for solving interval problems in computational biology efficiently