Faster parameterized algorithms for \textsc{Bicluster Editing} and \textsc{Flip Consensus Tree}

DOI10.1016/j.tcs.2023.113796OpenAlexW4323275853MaRDI QIDQ2693636

Dekel Tsur

Publication date: 24 March 2023

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2023.113796

zbMATH Keywords

graph algorithmsparameterized complexitybranching algorithms

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Even better fixed-parameter algorithms for bicluster editing
• A cubic-vertex kernel for flip consensus tree
• Faster parameterized algorithm for \textsc{Bicluster Editing}
• Improved Fixed-Parameter Algorithms for Minimum-Flip Consensus Trees
• Applying Modular Decomposition to Parameterized Bicluster Editing
• Improved Algorithms for Bicluster Editing
• Fast biclustering by dual parameterization

This page was built for publication: Faster parameterized algorithms for \textsc{Bicluster Editing} and \textsc{Flip Consensus Tree}