RASMA: a reverse search algorithm for mining maximal frequent subgraphs
Background: 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 are a representative set of frequent subgraphs; A frequent subgraph is maximal i...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
BioMed Central Ltd
2021
|
| Subjects: | |
| Online Access: | View Fulltext in Publisher |