Approximation Algorithms for a Minimization Variant of the Order-Preserving Submatrices and for Biclustering Problems

DOI10.1145/2438645.2438651zbMath1301.68273OpenAlexW2035261709MaRDI QIDQ2933649

Asaf Levin, Dorit S. Hochbaum

Publication date: 5 December 2014

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2438645.2438651

zbMATH Keywords

approximation algorithmgene expressionbiclusteringorder preserving

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Genetics and epigenetics (92D10) Approximation algorithms (68W25)

Related Items (1)

Recovering all generalized order-preserving submatrices: new exact formulations and algorithms

This page was built for publication: Approximation Algorithms for a Minimization Variant of the Order-Preserving Submatrices and for Biclustering Problems