MINKOWSKI SUM SELECTION AND FINDING

DOI10.1142/S0218195911003664zbMath1228.65090MaRDI QIDQ3089093

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

Publication date: 23 August 2011

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

zbMATH Keywords

sequence analysisbioinformaticsMinkowski sum

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05)

Cites Work

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

This page was built for publication: MINKOWSKI SUM SELECTION AND FINDING