• No results found

BIBLIOGRAPHY

In document Counting small patterns in networks (Page 139-142)

[] N Przulj, D G Corneil, and I Jurisica. Modeling in- teractome: scale-free or geometric?Bioinformatics,  ():–, dec . ISSN -. [] Natasa Przulj. Biological network comparison using

graphlet degree distribution.Bioinformatics, (): –, jan . ISSN -. [] R W Solava, R P Michaels, and T Milenkovic.

Graphlet-based edge clustering reveals pathogen- interacting proteins.Bioinformatics (Oxford, England), ():i–i, sep . ISSN -. [] R Milo. Network Motifs: Simple Building Blocks of

Complex Networks.Science, ():–, oct . ISSN .

[] Ron Milo, Shalev Itzkovitz, Nadav Kashtan, Reuven Levitt, Shai Shen-Orr, Inbal Ayzenshtat, Michal Sheffer, and Uri Alon. Superfamilies of evolved and designed networks. Science (New York, N.Y.),  ():–, mar . ISSN -. [] N Kashtan, S Itzkovitz, R Milo, and U Alon. Efficient

sampling algorithm for estimating subgraph concentra- tions and detecting network motifs.Bioinformatics,  ():–, jul . ISSN -. [] N Przulj, D G Corneil, and I Jurisica. Efficient esti-

mation of graphlet frequency distributions in protein- protein interaction networks.Bioinformatics (Oxford, England), ():–, apr . ISSN -. [] Sebastian Wernicke. Efficient detection of network

motifs.IEEE/ACM transactions on computational bi- ology and bioinformatics / IEEE, ACM, ():–, . ISSN -.

[] Krzysztof Juszczyszyn, Przemysław Kazienko, and Katarzyna Musiał. Local Topology of Social Network. InKES ’ Proceedings of the th international confer- ence on Knowledge-Based Intelligent Information and Engineering Systems, Part II, pages –, Zagreb, .

[] Tijana Milenković and Natasa Przulj. Uncovering biological network function via graphlet degree signa- tures.Cancer informatics, :–, jan . ISSN -.

[] Tijana Milenkovic, Vesna Memisevic, Anand K Gane- san, and Natasa Przulj. Systems-level cancer gene iden- tification from protein interaction network topology applied to melanogenesis-related functional genomics data.Journal of the Royal Society, Interface / the Royal Society, ():–, mar . ISSN -. [] Tijana Milenković, Han Zhao, and Fazle E. Faisal.

Global Network Alignment In The Context Of Ag- ing. InProceedings of the International Conference on Bioinformatics, Computational Biology and Biomedical Informatics - BCB’, pages –, New York, New York, USA, . ACM Press. ISBN . [] Oleksii Kuchaiev, Tijana Milenkovic, Vesna Memi-

sevic, Wayne Hayes, and Natasa Przulj. Topological network alignment uncovers biological function and phylogeny. Journal of the Royal Society, Interface / the Royal Society, ():–, sep . ISSN -.

[] Tijana Milenković, Weng Leong Ng, Wayne Hayes, and Natasa Przulj. Optimal network alignment with graphlet degree vectors.Cancer informatics, :–, jan . ISSN -.

[] H. W. Kuhn. The Hungarian method for the assign- ment problem.Naval Research Logistics Quarterly,  (-):–, mar . ISSN . [] Oleksii Kuchaiev and Natasa Przulj. Integrative net-

work alignment reveals large regions of global network similarity in yeast and human.Bioinformatics (Ox- ford, England), ():–, may . ISSN -.

[] Sebastian Wernicke and Florian Rasche. FANMOD: a tool for fast network motif detection.Bioinformatics, ():–, may . ISSN -.

 Bibliography T. Hočevar [] Christopher Whelan and Kemal Sönmez. Computing

graphlet signatures of network nodes and motifs in Cy- toscape with GraphletCounter.Bioinformatics (Oxford, England), ():–, jan . ISSN -. [] Paul Shannon, Andrew Markiel, Owen Ozier, Nitin S

Baliga, Jonathan T Wang, Daniel Ramage, Nada Amin, Benno Schwikowski, and Trey Ideker. Cy- toscape: a software environment for integrated models of biomolecular interaction networks.Genome research, ():–, nov . ISSN -. [] Tijana Milenković, Jason Lai, and Nataša Pržulj.

GraphCrunch: A tool for large network analyses.BMC Bioinformatics, (), jan . ISSN -. [] Oleksii Kuchaiev, Aleksandar Stevanović, Wayne

Hayes, and Nataša Pržulj. GraphCrunch : Software tool for network modeling, alignment and cluster- ing.BMC bioinformatics, ():, jan . ISSN -.

[] D. Marcus and Y. Shavitt. RAGE – A rapid graphlet enumerator for large networks.Computer Networks,  ():–, feb . ISSN . [] Andrew Chatr-Aryamontri, Bobby-Joe Breitkreutz,

Sven Heinicke, Lorrie Boucher, Andrew Winter, Chris Stark, Julie Nixon, Lindsay Ramage, Nadine Kolas, Lara O’Donnell, Teresa Reguly, Ashton Breitkreutz, Adnane Sellam, Daici Chen, Christie Chang, Jen- nifer Rust, Michael Livstone, Rose Oughtred, Kara Dolinski, and Mike Tyers. The BioGRID interac- tion database:  update.Nucleic acids research,  (Database issue):D–, jan . ISSN - .

[] Brahim Betkaoui, David B. Thomas, Wayne Luk, and Natasa Przulj. A framework for FPGA acceleration of large graph problems: Graphlet counting case study. In International Conference on Field-Programmable Technology, pages –. IEEE, dec . ISBN -- --.

[] Alon Itai and Michael Rodeh. Finding a Minimum Circuit in a Graph.SIAM Journal on Computing, (): –, nov . ISSN -.

[] Jaroslav Nešetřil and Svatopluk Poljak. On the com- plexity of the subgraph problem.Commentationes Mathematicae Universitatis Carolinae, ():–, .

[] Volker Strassen. Gaussian elimination is not optimal.

Numerische Mathematik, ():–, aug . ISSN -X.

[] François Le Gall. Powers of tensors and fast matrix multiplication. InProceedings of the th International Symposium on Symbolic and Algebraic Computation - ISSAC ’, pages –, New York, New York, USA, . ACM Press. ISBN .

[] Ton Kloks, Dieter Kratsch, and Haiko Müller. Finding and counting small induced subgraphs efficiently.

Information Processing Letters, (-):–, may . ISSN .

[] Mirosław Kowaluk, Andrzej Lingas, and Eva-Marta Lundell. Counting and Detecting Small Subgraphs via Equations.SIAM Journal on Discrete Mathematics,  ():–, may . ISSN -. [] P. V. O’Neil. Ulam’s Conjecture and Graph Recon-

structions.The American Mathematical Monthly, (): , jan . ISSN .

[] Brendan D. McKay. Small graphs are reconstructible.

Australasian Journal of Combinatorics, :–, .

[] Tomaž Hočevar and Janez Demšar. A combinatorial approach to graphlet counting.Bioinformatics, (): –, feb . ISSN -.

[] Tomaž Hočevar and Janez Demšar. Computation of Graphlet Orbits for Nodes and Edges in Sparse Graphs.Journal of Statistical Software, (), . ISSN -.

[] Tomaž Hočevar and Janez Demšar. Combinatorial algorithm for counting small induced graphs and or- bits.PLOS ONE, ():e, feb . ISSN -.

[] Stanley Fields. High-throughput two-hybrid analysis. The promise and the peril.FEBS Journal, (): –, nov . ISSN -X. [] T. Ito, T. Chiba, R. Ozawa, M. Yoshida, M. Hattori,

and Y. Sakaki. A comprehensive two-hybrid analysis to explore the yeast protein interactome.Proceedings of the National Academy of Sciences, ():–, apr . ISSN -.

[] Lukasz Salwinski, Christopher S Miller, Adam J Smith, Frank K Pettit, James U Bowie, and David Eisenberg. The Database of Interacting Proteins:  update.

Nucleic acids research, (Database issue):D–, jan . ISSN -.

[] Coen Bron and Joep Kerbosch. Algorithm : finding all cliques of an undirected graph.Communi- cations of the ACM, ():–, sep . ISSN .

[] Etsuji Tomita, Akira Tanaka, and Haruhisa Taka- hashi. The worst-case time complexity for generating all maximal cliques and computational experiments.

Theoretical Computer Science, ():–, oct . ISSN .

 [] Ine Melckenbeeck, Pieter Audenaert, Tom Michoel,

Didier Colle, and Mario Pickavet. An Algorithm to Automatically Generate the Combinatorial Orbit Counting Equations.PLOS ONE, ():–, jan . ISSN -.

[] Tijana Milenković, Vesna Memišević, Anthony Bon- ato, and Nataša Pržulj. Dominating biological net- works. PloS one, ():e, jan . ISSN -.

[] Wayne Hayes, Kai Sun, and Natasa Przulj. Graphlet- based measures are suitable for biological network comparison.Bioinformatics (Oxford, England), (): –, feb . ISSN -.

[] Alina Stoica and Christophe Prieur. Structure of Neighborhoods in a Large Social Network. In International Conference on Computational Science and Engineering, pages –. IEEE, . ISBN ----.

[] Mirosław Kowaluk, Andrzej Lingas, and Eva-Marta Lundell. Counting and detecting small subgraphs via equations and matrix multiplication. InProceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, pages –, . [] Wayne W. Zachary. An Information Flow Model

for Conflict and Fission in Small Groups.Journal of Anthropological Research, ():–, dec . ISSN -.

[] Kilian Thiel and Michael R. Berthold. Node Similar- ities from Spreading Activation. InBisociative Knowl- edge Discovery, Lecture Notes in Computer Science, pages –. Springer-Verlag Berlin Heidelberg, .

[] M Kuramochi and G Karypis. Frequent subgraph discovery. InProceedings  IEEE International Conference on Data Mining, pages –. IEEE Comput. Soc, . ISBN ---. [] Lars Backstrom and Jure Leskovec. Supervised random

walks. InProceedings of the fourth ACM international conference on Web search and data mining - WSDM ’, pages –, New York, New York, USA, . ACM Press. ISBN .

[] David Liben-Nowell and Jon Kleinberg. The link- prediction problem for social networks.Journal of the American Society for Information Science and Technology, ():–, may . ISSN . [] Liva Ralaivola, Sanjay J. Swamidass, Hiroto Saigo, and

Pierre Baldi. Graph kernels for chemical informatics.

Neural Networks, ():–, oct . ISSN .

[] Peter Floderus, Mirosław Kowaluk, Andrzej Lingas, and Eva-marta Lundell. Induced Subgraph Isomor- phism: Are Some Patterns Substantially Easier Than Others? Inth Annual International Computing and Combinatorics Conference, pages –. Springer, Berlin, Heidelberg, .

[] Virginia Vassilevska and Ryan Williams. Finding, minimizing, and counting weighted subgraphs. In

Proceedings of the st annual ACM symposium on Symposium on theory of computing - STOC ’, pages –, New York, New York, USA, . ACM Press. ISBN .

[] Noga Alon, Raphael Yuster, and Uri Zwick. Finding and counting given length cycles.Algorithmica, (): –, mar . ISSN -.

[] Noga Alon, Raphael Yuster, and Uri Zwick. Color- coding.Journal of the ACM, ():–, jul . ISSN .

[] Noga Alon, Phuong Dao, Iman Hajirasouliha, Ferey- doun Hormozdiari, and S Cenk Sahinalp. Biomolec- ular network motif counting and discovery by color coding.Bioinformatics, ():–, jul . ISSN -.

[] David Eppstein, Maarten Löffler, and Darren Strash. Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time. InAlgorithms and Computation, volume  ofLecture Notes in Computer Science, pages –. Springer Berlin Heidelberg, Berlin, Heidelberg, . ISBN ----. [] Paul Erdős and Alfréd Rényi. On random graphs .

Publ. Math. Debrecen, :–, . [] A. Barabasi and R. Albert. Emergence of Scaling in

Random Networks.Science, ():–, oct . ISSN .

[] Seifollah Louis Hakimi. On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I.

Journal of the Society for Industrial and Applied Mathe- matics, ():–, sep . ISSN -. [] Joseph Blitzstein and Persi Diaconis. A Sequential Im-

portance Sampling Algorithm for Generating Random Graphs with Prescribed Degrees.Internet Mathematics, ():–, mar . ISSN -. [] R Milo, N Kashtan, S Itzkovitz, M E J Newman,

and U Alon. On the uniform generation of random graphs with prescribed degree sequences.arXiv preprint cond-mat/, pages –, .

[] Brendan D McKay and Nicholas C Wormald. Uni- form generation of random regular graphs of moderate degree.Journal of Algorithms, ():–, mar . ISSN .

 Bibliography T. Hočevar [] Mohsen Bayati, Jeong Han Kim, and Amin Saberi.

A Sequential Algorithm for Generating Random Graphs.Algorithmica, ():–, dec . ISSN -.

[] Tom Britton, Maria Deijfen, and Anders Martin-Löf. Generating Simple Random Graphs with Prescribed Degree Distribution.Journal of Statistical Physics,  ():–, oct . ISSN -. [] William H Press, Brian P Flannery, Saul A Teukol-

sky, and William T Vetterling.Numerical recipes. Cambridge University Press, . ISBN --- -.

[] Jure Leskovec, Anand Rajaraman, and Jeffrey David Ullman. Mining of Massive Datasets. Cam- bridge University Press, Cambridge, . ISBN .

[] David Eppstein and Emma S. Spiro. The h-Index of a Graph and its Application to Dynamic Subgraph Statistics.Journal of Graph Algorithms and Applications, ():–, apr . ISSN -. [] David Eppstein, Michael T. Goodrich, Darren Strash,

and Lowell Trott. Extended dynamic subgraph statis- tics using h-index parameterized data structures.

Theoretical Computer Science, :–, aug . ISSN .

[] Min Chih Lin, Francisco J. Soulignac, and Jayme L. Szwarcfiter. Arboricity, h-Index, and Dynamic Algo- rithms.Theoretical Computer Science, -:–, may . ISSN .

[] Duncan J Watts and Steven H Strogatz. Collective Dynamics of ’Small-World’ Networks.Nature,  ():–, . ISSN . [] Lawrence Page, Sergey Brin, Rajeev Motwani, and

Terry Winograd. The PageRank Citation Ranking: Bringing Order to the Web. Technical report, Stanford InfoLab, .

[] Max Kotlyar, Chiara Pastrello, Nicholas Sheahan, and Igor Jurisica. Integrated interactions database: tissue-specific view of the human and model organ- ism interactomes. Nucleic Acids Research, (D): D–D, jan . ISSN -. [] Waqar Ali, Tiago Rito, Gesine Reinert, Fengzhu Sun,

and Charlotte M. Deane. Alignment-free protein interaction network comparison.Bioinformatics,  ():i–i, sep . ISSN -. [] Jonathan Mugan, Ranga Chari, Laura Hitt, Eric

McDermid, Marsha Sowell, Yuan Qu, and Thayne Coffman. Entity resolution using inferred relationships and behavior. In IEEE International Conference on Big Data (Big Data), pages –. IEEE, oct . ISBN ----.

[] Mark Ortmann and Ulrik Brandes. Quad Census Computation: Simple, Efficient, and Orbit-Aware. In Adam Wierzbicki, Ulrik Brandes, Frank Schweitzer, and Dino Pedreschi, editors,Advances in Network Science, volume  ofLecture Notes in Computer Science, pages –. Springer International Publishing, Cham, . ISBN ----. [] Nesreen K. Ahmed, Jennifer Neville, Ryan A. Rossi,

and Nick Duffield. Efficient Graphlet Counting for Large Networks. In IEEE International Conference on Data Mining, pages –. IEEE, nov . ISBN ----.

[] Ethan R. Elenberg, Karthikeyan Shanmugam, Michael Borokhovich, and Alexandros G. Dimakis. Distributed Estimation of Graph -Profiles. InProceedings of the th International Conference on World Wide Web - WWW ’, pages –, New York, New York, USA, . ACM Press. ISBN . [] Anida Sarajlić, Noël Malod-Dognin, Ömer Nebil

Yaveroğlu, and Nataša Pržulj. Graphlet-based Charac- terization of Directed Networks.Scientific Reports,  (), . ISSN -.

[] David Aparicio, Pedro Ribeiro, and Fernando Silva. Extending the Applicability of Graphlets to Directed Networks.IEEE/ACM Transactions on Computational Biology and Bioinformatics, . ISSN -.

In document Counting small patterns in networks (Page 139-142)

Related documents