Minkowski sum selection and finding

DOI10.1142/S0218195911003664MaRDI QIDQ3089093zbMATHFDO

Authors Cheng-Wei Luo, Hsiao-Fei Liu, Peng-An Chen, Kun-Mao Chao

Publication date 23 August 2011

Published in International Journal of Computational Geometry & Applications (Search for Journal in Brave)

zbMATH Keywords

bioinformaticssequence analysisMinkowski sum

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05)

Recommendations

• Minkowski Sum Selection and Finding
• On the largest convex subsets in Minkowski sums
• Constrained Minkowski sums: A geometric framework for solving interval problems in computational biology efficiently
• Minkowski set operations and their applications.
• Convexly independent subsets of Minkowski sums of convex polygons

Cites work

• A RANDOMIZED ALGORITHM FOR SLOPE SELECTION
• An Optimal-Time Algorithm for Slope Selection
• Efficient algorithms for \(k\) maximum sums
• Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis.
• Efficient randomized algorithms for the repeated median line estimator
• Fast algorithms for the density finding problem
• Generalized Selection and Ranking: Sorted Matrices
• Introduction to algorithms
• Linear-time algorithms for computing maximum-density sequence segments with bioinformatics applications
• Optimal algorithms for locating the longest and shortest segments satisfying a sum or an average constraint
• Randomized algorithm for the sum selection problem
• Randomized optimal algorithm for slope selection

Cited in

(4)

• Constrained Minkowski sums: A geometric framework for solving interval problems in computational biology efficiently
• Minkowski Sum Selection and Finding
• Minkowski set operations and their applications.
• On the flatness of Minkowski sums

This page was built for publication: Minkowski sum selection and finding

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3089093)