Dense Subgraphs with Restrictions and Applications to Gene Annotation Graphs


In this paper, we focus on finding complex annotation patterns representing novel and interesting hypotheses from gene annotation data. We define a generalization of the densest subgraph problem by adding an additional distance restriction (defined by a separate metric) to the nodes of the subgraph. We show that while this generalization makes the problem… (More)
DOI: 10.1007/978-3-642-12683-3_30


3 Figures and Tables


Citations per Year

79 Citations

Semantic Scholar estimates that this publication has 79 citations based on the available data.

See our FAQ for additional information.

Slides referencing similar topics