Mod/Resc parsimony inference: theory and application
type: Item
instance of: scholarly article
title: Mod/Resc parsimony inference: theory and application
zbMATH Open document ID: 1237.92041
author: Igor Nor
author: Danny Hermelin
author: Sylvain Charlat
author: Jan Engelstädter
author: Max Reuter
author: Olivier Duron
author: Marie-France Sagot
published in: Information and Computation
publication date: 2012-05-24T00:00:00Z
Mathematics Subject Classification ID: 92C60
Mathematics Subject Classification ID: 05C90
Mathematics Subject Classification ID: 65Y20
zbMATH DE Number: 6038305
zbMATH Keywords: computational biology
zbMATH Keywords: biclique edge covering
zbMATH Keywords: bipartite graph
zbMATH Keywords: Boolean matrix
zbMATH Keywords: NP-completeness
zbMATH Keywords: graph theory
zbMATH Keywords: fixed-parameter tractability
zbMATH Keywords: kernelisation
MaRDI profile type: Publication
full work available at URL: j.ic.2011.03.008
OpenAlex ID: W2092636529
cites work: Q4393480
cites work: Covering graphs with few complete bipartite subgraphs
cites work: Parametrized complexity theory.
cites work: Data reduction and exact algorithms for clique cover
cites work: Q3758977
cites work: Inapproximability of Nondeterministic State and Transition Complexity Assuming P ≠ NP
cites work: On covering graphs by complete bipartite subgraphs
cites work: Q3682546
cites work: Q5710169
cites work: Q4152571
cites work: Bicliques in graphs. I: Bounds on their number
cites work: A New Algorithm for Generating All the Maximal Independent Sets
DOI: 10.1016/J.IC.2011.03.008
description: scientific article; zbMATH DE number 6038305