Finding recurrent RNA structural networks with fast maximal common subgraphs of edge-colored graphs.
Antoine SouléVladimir ReinharzRoman Sarrazin-GendronAlain DeniseJérôme WaldispühlPublished in: PLoS Comput. Biol. (2021)
Keyphrases
- maximum clique
- graph structures
- graph mining
- weighted graph
- graph databases
- subgraph isomorphism
- social networks
- subgraph matching
- edge weights
- graph properties
- undirected graph
- maximal cliques
- biological networks
- connected subgraphs
- dynamic networks
- graph data
- edge detection
- graph matching
- real world networks
- structural patterns
- graph patterns
- labeled graphs
- subgraph mining
- graph mining algorithms
- maximum common subgraph
- network analysis
- frequent subgraphs
- small world
- fully connected
- genome wide
- graph theoretic
- complex networks
- rna sequences
- independent set
- reachability queries
- densely connected
- data structure
- social network analysis
- high throughput
- feed forward
- frequent subgraph mining
- pattern discovery
- graph structure
- graph model
- recurrent networks
- community discovery