Finding approximate and constrained motifs in graphs (Q390871): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C15 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C85 / 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: 68Q17 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 92C42 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 92-08 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6243773 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
graph motif | |||
Property / zbMATH Keywords: graph motif / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
computational biology | |||
Property / zbMATH Keywords: computational biology / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
parameterized complexity | |||
Property / zbMATH Keywords: parameterized complexity / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
algorithms | |||
Property / zbMATH Keywords: algorithms / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
computational complexity | |||
Property / zbMATH Keywords: computational complexity / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
biological networks | |||
Property / zbMATH Keywords: biological networks / rank | |||
Normal rank |
Revision as of 14:03, 29 June 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Finding approximate and constrained motifs in graphs |
scientific article |
Statements
Finding approximate and constrained motifs in graphs (English)
0 references
9 January 2014
0 references
graph motif
0 references
computational biology
0 references
parameterized complexity
0 references
algorithms
0 references
computational complexity
0 references
biological networks
0 references