New heuristics for the bicluster editing problem
From MaRDI portal
Publication:1686528
Recommendations
Cites work
- scientific article; zbMATH DE number 3579840 (Why is no real title available?)
- scientific article; zbMATH DE number 2050711 (Why is no real title available?)
- scientific article; zbMATH DE number 1750182 (Why is no real title available?)
- Applying modular decomposition to parameterized cluster editing problems
- Cluster graph modification problems
- Correlation clustering
- Extracting conserved gene expression motifs from gene expression data
- Improved Algorithms for Bicluster Editing
- Improved approximation algorithms for bipartite correlation clustering
- Random Graphs
- Variable neighbourhood search: methods and applications
Cited in
(9)- Hybrid metaheuristic for bicluster editing problem
- Improved Algorithms for Bicluster Editing
- Faster parameterized algorithm for Bicluster Editing
- Even better fixed-parameter algorithms for bicluster editing
- The biclique partitioning polytope
- A parallel hybrid metaheuristic for bicluster editing
- On solving manufacturing cell formation via bicluster editing
- Complexity of modification problems for reciprocal best match graphs
- Improved kernelization and fixed-parameter algorithms for bicluster editing
This page was built for publication: New heuristics for the bicluster editing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1686528)