RASMA: a reverse search algorithm for mining maximal frequent subgraphs
Abstract 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 m...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Artigo |
| Sprache: | Inglês |
| Veröffentlicht: |
BMC
2021-03-01
|
| Schriftenreihe: | BioData Mining |
| Schlagworte: | |
| Online-Zugang: | https://doi.org/10.1186/s13040-021-00250-1 |
| Tags: |
Keine Tags, Fügen Sie das erste Tag hinzu!
|