Algorithms on subgraph overlap graphs (Q2875683)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Algorithms on subgraph overlap graphs |
scientific article; zbMATH DE number 6328435
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms on subgraph overlap graphs |
scientific article; zbMATH DE number 6328435 |
Statements
11 August 2014
0 references
overlap graph
0 references
subgraph filament graph
0 references
polynomial time algorithm
0 references
0.9054527
0 references
0 references
0.89490515
0 references
0.8941701
0 references
0 references
0.8860792
0 references
0.8852744
0 references
0.8846872
0 references
Algorithms on subgraph overlap graphs (English)
0 references
In the paper under review, the author deals with subgraph overlap graphs and shows that, under some additional mild assumptions, these graphs are equivalent to subgraph filament graphs. The latter type of graphs is used in applications, for instance for analysis of protein interactions and occurrence of genes in the DNA. The author proves that on this class of subgraphs several classical problems can be solved with polynomial time algorithms.
0 references
