Efficient Detection of Network Motifs
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Knowledge sharing and yahoo answers: everyone knows something
Proceedings of the 17th international conference on World Wide Web
Local Topology of Social Network Based on Motif Analysis
KES '08 Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part II
Comparison of online social relations in volume vs interaction: a case study of cyworld
Proceedings of the 8th ACM SIGCOMM conference on Internet measurement
Temporal Changes in Connection Patterns of an Email-Based Social Network
WI-IAT '08 Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 03
Stability cannot be derived from local structure in biochemical networks
Proceedings of the 3rd International Conference on Bio-Inspired Models of Network, Information and Computing Sytems
Stability from structure: metabolic networks are unlike other biological networks
EURASIP Journal on Bioinformatics and Systems Biology - Special issue on network structure and biological function: Reconstruction, modelling, and statistical approaches
An analysis of the social structure of remix culture
Proceedings of the fourth international conference on Communities and technologies
g-tries: an efficient data structure for discovering network motifs
Proceedings of the 2010 ACM Symposium on Applied Computing
Proceedings of the 2010 ACM Symposium on Applied Computing
Using network motifs to identify application protocols
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
eBay: an E-commerce marketplace as a complex network
Proceedings of the fourth ACM international conference on Web search and data mining
Detecting communities of triangles in complex networks using spectral optimization
Computer Communications
Motif-based attack detection in network communication graphs
CMS'11 Proceedings of the 12th IFIP TC 6/TC 11 international conference on Communications and multimedia security
Parallel discovery of network motifs
Journal of Parallel and Distributed Computing
RAGE - A rapid graphlet enumerator for large networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
An algorithm for network motif discovery in biological networks
International Journal of Data Mining and Bioinformatics
Network-theoretic classification of parallel computation patterns
International Journal of High Performance Computing Applications
EgoNav: exploring networks through egocentric spatializations
Proceedings of the International Working Conference on Advanced Visual Interfaces
Querying subgraph sets with g-tries
DBSocial '12 Proceedings of the 2nd ACM SIGMOD Workshop on Databases and Social Networks
A significance-driven framework for characterizing and finding evolving patterns of news networks
AICI'12 Proceedings of the 4th international conference on Artificial Intelligence and Computational Intelligence
Symmetry Compression Method for Discovering Network Motifs
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Top-k Similar Graph Matching Using TraM in Biological Networks
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Classifying Wikipedia articles using network motif counts and ratios
Proceedings of the Eighth Annual International Symposium on Wikis and Open Collaboration
Module-based breast cancer classification
International Journal of Data Mining and Bioinformatics
Towards a faster network-centric subgraph census
Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining
Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining
RANGI: A Fast List-Colored Graph Motif Finding Algorithm
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
| Hi-index | 3.84 |
Summary: Motifs are small connected subnetworks that a network displays in significantly higher frequencies than would be expected for a random network. They have recently gathered much attention as a concept to uncover structural design principles of complex biological networks. FANMOD is a tool for fast network motif detection; it relies on recently developed algorithms to improve the efficiency of network motif detection by some orders of magnitude over existing tools. This facilitates the detection of larger motifs in bigger networks than previously possible. Additional benefits of FANMOD are the ability to analyze colored networks, a graphical user interface and the ability to export results to a variety of machine- and human-readable file formats including comma-separated values and HTML. Availability: The tool is freely available online at http://www.minet.uni-jena.de/~wernicke/motifs/ and runs under Linux, Mac OS and Windows. Contact: wernicke@minet.uni-jena.de