Finding approximate and constrained motifs in graphs (Q390871): Difference between revisions
From MaRDI portal
Normalize DOI. |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/J.TCS.2012.08.023 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.TCS.2012.08.023 / rank | |||
Normal rank | |||
Latest revision as of 16:12, 9 December 2024
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
