Cited in
(31)- Motif discovery in networks: a survey
- Detecting local network motifs
- An Efficient Sampling Algorithm for Network Motif Detection
- FixCon: A Generic Solver for Fixed-Cardinality Subgraph Problems
- Distributed discovery of frequent subgraphs of a network using MapReduce
- Searching and inferring colorful topological motifs in vertex-colored graphs
- HAPLO
- MFinder
- networksis
- MetaCyc
- gSpan
- QNet
- STAMP
- G-Tries: a data structure for storing and finding subgraphs
- MODA
- Mixnet
- FANMOD
- ACME
- MAVisto
- MotifClick
- MultiPhyl
- NeMoFinder
- ParaMEME
- pCLUSTAL
- GraMoFoNe
- SIMBio
- QPath
- Fixcon
- Enumerating connected induced subgraphs: improved delay and experimental comparison
- Hybrid-order network consensus for distributed multi-agent systems
- Distributed and sequential algorithms for bioinformatics
This page was built for software: Kavosh
