Faster parameterized algorithms for BICLUSTER EDITING and FLIP CONSENSUS TREE

Dekel Tsur

doi:https://doi.org/10.1016/j.tcs.2023.113796

Faster parameterized algorithms for BICLUSTER EDITING and FLIP CONSENSUS TREE

Dekel Tsur

Department of Computer Science

Ben-Gurion University of the Negev

Research output: Contribution to journal › Article › peer-review

Abstract

In the BICLUSTER EDITING (resp., FLIP CONSENSUS TREE) problem the input is a bipartite graph G=(V₁,V₂,E) and an integer k, and the goal is to decide whether there is a set F⊆V₁×V₂ such that the graph (V₁,V₂,E△F) does not contain an induced path on four vertices (resp., an induced path on five vertices whose endpoints are in V₂). In this paper we give algorithms for BICLUSTER EDITING and FLIP CONSENSUS TREE whose running times are O^⁎(2.22^k) and O(3.24^k), respectively. This improves over the O^⁎(2.636^k)-time algorithm for BICLUSTER EDITING of Tsur [IPL 2021] and the O^⁎(3.68^k)-time algorithm for FLIP CONSENSUS TREE of Komusiewicz and Uhlmann [Algorithmica 2014].

Original language	American English
Article number	113796
Journal	Theoretical Computer Science
Volume	953
DOIs	https://doi.org/10.1016/j.tcs.2023.113796
State	Published - 10 Apr 2023

Keywords

Branching algorithms
Graph algorithms
Parameterized complexity

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
General Computer Science

Access to Document

https://doi.org/10.1016/j.tcs.2023.113796

Cite this

@article{e07de24234d24c0881b6f78eb7a06d95,

title = "Faster parameterized algorithms for BICLUSTER EDITING and FLIP CONSENSUS TREE",

abstract = "In the BICLUSTER EDITING (resp., FLIP CONSENSUS TREE) problem the input is a bipartite graph G=(V1,V2,E) and an integer k, and the goal is to decide whether there is a set F⊆V1×V2 such that the graph (V1,V2,E△F) does not contain an induced path on four vertices (resp., an induced path on five vertices whose endpoints are in V2). In this paper we give algorithms for BICLUSTER EDITING and FLIP CONSENSUS TREE whose running times are O⁎(2.22k) and O(3.24k), respectively. This improves over the O⁎(2.636k)-time algorithm for BICLUSTER EDITING of Tsur [IPL 2021] and the O⁎(3.68k)-time algorithm for FLIP CONSENSUS TREE of Komusiewicz and Uhlmann [Algorithmica 2014].",

keywords = "Branching algorithms, Graph algorithms, Parameterized complexity",

author = "Dekel Tsur",

note = "Publisher Copyright: {\textcopyright} 2023 Elsevier B.V.",

year = "2023",

month = apr,

day = "10",

doi = "https://doi.org/10.1016/j.tcs.2023.113796",

language = "American English",

volume = "953",

journal = "Theoretical Computer Science",

issn = "0304-3975",

publisher = "Elsevier B.V.",

}

TY - JOUR

T1 - Faster parameterized algorithms for BICLUSTER EDITING and FLIP CONSENSUS TREE

AU - Tsur, Dekel

PY - 2023/4/10

Y1 - 2023/4/10

N2 - In the BICLUSTER EDITING (resp., FLIP CONSENSUS TREE) problem the input is a bipartite graph G=(V1,V2,E) and an integer k, and the goal is to decide whether there is a set F⊆V1×V2 such that the graph (V1,V2,E△F) does not contain an induced path on four vertices (resp., an induced path on five vertices whose endpoints are in V2). In this paper we give algorithms for BICLUSTER EDITING and FLIP CONSENSUS TREE whose running times are O⁎(2.22k) and O(3.24k), respectively. This improves over the O⁎(2.636k)-time algorithm for BICLUSTER EDITING of Tsur [IPL 2021] and the O⁎(3.68k)-time algorithm for FLIP CONSENSUS TREE of Komusiewicz and Uhlmann [Algorithmica 2014].

AB - In the BICLUSTER EDITING (resp., FLIP CONSENSUS TREE) problem the input is a bipartite graph G=(V1,V2,E) and an integer k, and the goal is to decide whether there is a set F⊆V1×V2 such that the graph (V1,V2,E△F) does not contain an induced path on four vertices (resp., an induced path on five vertices whose endpoints are in V2). In this paper we give algorithms for BICLUSTER EDITING and FLIP CONSENSUS TREE whose running times are O⁎(2.22k) and O(3.24k), respectively. This improves over the O⁎(2.636k)-time algorithm for BICLUSTER EDITING of Tsur [IPL 2021] and the O⁎(3.68k)-time algorithm for FLIP CONSENSUS TREE of Komusiewicz and Uhlmann [Algorithmica 2014].

KW - Branching algorithms

KW - Graph algorithms

KW - Parameterized complexity

UR - http://www.scopus.com/inward/record.url?scp=85150384942&partnerID=8YFLogxK

U2 - https://doi.org/10.1016/j.tcs.2023.113796

DO - https://doi.org/10.1016/j.tcs.2023.113796

M3 - Article

SN - 0304-3975

VL - 953

JO - Theoretical Computer Science

JF - Theoretical Computer Science

M1 - 113796

ER -

Faster parameterized algorithms for BICLUSTER EDITING and FLIP CONSENSUS TREE

Abstract

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this