Article

RASMA: A Reverse Search Algorithm for Mining Maximal Frequent Subgraphs

2021-01-25

Abstract excerpt

<title>Abstract</title> <p><bold>Background:</bold> Given a collection of coexpression networks over a set of genes, identifying subnetworks that appear frequently is an important research problem known as mining frequent subgraphs. Maximal frequent subgraphs is a representative set of frequent subgraphs; A frequent subgraph is maximal if it does have a super-graph that is frequent. In the bioinformatics discipli...

Topics

Open a Topic to create a Post that cites this publication.

Identifiers and source

Literature Corpus work: 3bb081a2-63d7-56b0-8232-b8a7d4523b09
DOI: 10.21203/rs.3.rs-46148/v3

Open publication

Related research

Semantic proximity does not establish scientific evidence.

Click a neighbor to travelStep 1 · 8 closest

RASMA: A Reverse Search Algorithm for Mining Maximal Frequent SubgraphsDOI 10.21203/rs.3.rs-46148/v3Read

De novo identification of maximally deregulated subnetworks based on multi-omics data with DeRegNetSemantic proximity Read

Graph-Theoretical Analysis of Biological NetworksSemantic proximity Read

ReString – Automating Functional Enrichment Retrieval and Results AggregationSemantic proximity Read

Dense module enumeration in biological networks.Semantic proximity Read

A primer to frequent itemset mining for bioinformatics.Semantic proximity Read

ModuleDiscoverer: Identification of regulatory modules in protein-protein interaction networksSemantic proximity Read

Mining for novel tumor suppressor genes using a shortest path approach.Semantic proximity Read

Iterative class discovery and feature selection using Minimal Spanning Trees.Semantic proximity Read