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...

Descripción completa

Detalles Bibliográficos
Autores principales: Salem, Saeed, Alokshiya, Mohammed, Hasan, Mohammad Al
Formato: Online Artículo Texto
Lenguaje:English
Publicado: BioMed Central 2021
Materias:
Research
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7962222/
https://www.ncbi.nlm.nih.gov/pubmed/33726790
http://dx.doi.org/10.1186/s13040-021-00250-1

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7962222/
https://www.ncbi.nlm.nih.gov/pubmed/33726790
http://dx.doi.org/10.1186/s13040-021-00250-1

Ejemplares similares