PAnG: finding patterns in annotation graphs

Authors:
Philip Anderson;Andreas Thor;Joseph Benik;Louiqa Raschid;Maria Esther Vidal
Affiliations:
University of Maryland, College Park, MD, USA;University of Maryland, College Park, MD, USA;University of Maryland, College Park, MD, USA;University of Maryland, College Park, MD, USA;Universidad Simon Bolivar, Caracas, Venezuela
Venue:
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Year:
2012

Citing 4
Cited 1

Graph summarization with bounded error

Proceedings of the 2008 ACM SIGMOD international conference on Management of data
ANAPSID: an adaptive query processing engine for SPARQL endpoints

ISWC'11 Proceedings of the 10th international conference on The semantic web - Volume Part I
Link prediction for annotation graphs using graph summarization

ISWC'11 Proceedings of the 10th international conference on The semantic web - Volume Part I
Dense subgraphs with restrictions and applications to gene annotation graphs

RECOMB'10 Proceedings of the 14th Annual international conference on Research in Computational Molecular Biology

Finding cross genome patterns in annotation graphs

DILS'12 Proceedings of the 8th international conference on Data Integration in the Life Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

Annotation graph datasets are a natural representation of scientific knowledge. They are common in the life sciences and health sciences, where concepts such as genes, proteins or clinical trials are annotated with controlled vocabulary terms from ontologies. We present a tool, PAnG (Patterns in Annotation Graphs), that is based on a complementary methodology of graph summarization and dense subgraphs. The elements of a graph summary correspond to a pattern and its visualization can provide an explanation of the underlying knowledge. Scientists can use PAnG to develop hypotheses and for exploration.