Mod/Resc parsimony inference: theory and application (Q418168): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(4 intermediate revisions by 4 users not shown) | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 92C60 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C90 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 65Y20 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6038305 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
computational biology | |||
Property / zbMATH Keywords: computational biology / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
biclique edge covering | |||
Property / zbMATH Keywords: biclique edge covering / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
bipartite graph | |||
Property / zbMATH Keywords: bipartite graph / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Boolean matrix | |||
Property / zbMATH Keywords: Boolean matrix / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
NP-completeness | |||
Property / zbMATH Keywords: NP-completeness / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
graph theory | |||
Property / zbMATH Keywords: graph theory / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
fixed-parameter tractability | |||
Property / zbMATH Keywords: fixed-parameter tractability / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
kernelisation | |||
Property / zbMATH Keywords: kernelisation / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.ic.2011.03.008 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2092636529 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4393480 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Covering graphs with few complete bipartite subgraphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Parametrized complexity theory. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Data reduction and exact algorithms for clique cover / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3758977 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Inapproximability of Nondeterministic State and Transition Complexity Assuming P ≠ NP / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On covering graphs by complete bipartite subgraphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3682546 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5710169 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4152571 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Bicliques in graphs. I: Bounds on their number / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A New Algorithm for Generating All the Maximal Independent Sets / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 07:13, 5 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Mod/Resc parsimony inference: theory and application |
scientific article |
Statements
Mod/Resc parsimony inference: theory and application (English)
0 references
24 May 2012
0 references
computational biology
0 references
biclique edge covering
0 references
bipartite graph
0 references
Boolean matrix
0 references
NP-completeness
0 references
graph theory
0 references
fixed-parameter tractability
0 references
kernelisation
0 references