Generating Biological Network Motifs

Slides:



Advertisements
Similar presentations
Intro. to Data Structures 1CSCI 3333 Data Structures - Roughly based on Chapter 6.
Advertisements

Social network partition Presenter: Xiaofei Cao Partick Berg.
Midwestern State University Department of Computer Science Dr. Ranette Halverson CMPS 2433 – CHAPTER 4 GRAPHS 1.
Network Properties 1.Global Network Properties ( Chapter 3 of the course textbook “Analysis of Biological Networks” by Junker and Schreiber) 1)Degree distribution.
Computer Science 101 Efficiency and Complexity Analysis.
Networks. Graphs (undirected, unweighted) has a set of vertices V has a set of undirected, unweighted edges E graph G = (V, E), where.
Using Structure Indices for Efficient Approximation of Network Properties Matthew J. Rattigan, Marc Maier, and David Jensen University of Massachusetts.
New Algorithm DOM for Graph Coloring by Domination Covering
COVERTNESS CENTRALITY IN NETWORKS Michael Ovelgönne UMIACS University of Maryland 1 Chanhyun Kang, Anshul Sawant Computer Science Dept.
The Best Algorithms are Randomized Algorithms N. Harvey C&O Dept TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: A AAAA.
Data Structures Using C++ 2E
Identifying Reversible Functions From an ROBDD Adam MacDonald.
Graph and Topological Structure Mining on Scientific Articles Fan Wang, Ruoming Jin, Gagan Agrawal and Helen Piontkivska The Ohio State University The.
CS774. Markov Random Field : Theory and Application Lecture 13 Kyomin Jung KAIST Oct
Design and Analysis of Algorithms - Chapter 21 Analysis of Algorithms b Issues: CorrectnessCorrectness Time efficiencyTime efficiency Space efficiencySpace.
0 Course Outline n Introduction and Algorithm Analysis (Ch. 2) n Hash Tables: dictionary data structure (Ch. 5) n Heaps: priority queue data structures.
ACT: Attachment Chain Tracing Scheme for Virus Detection and Control Jintao Xiong Proceedings of the 2004 ACM workshop on Rapid malcode Presented.
Constructing Hamiltonian Circuits When all nodes have degree of at least n/2 (Also: an implementation in C++ using Boost) Presented by Alan SUnMaRC,
Minimum Cost Spanning Trees CSC263 Tutorial 10. Minimum cost spanning tree (MCST) What is a minimum cost spanning tree? – Tree No cycles; equivalently,
Algorithms for Biological Networks Prof. Tijana Milenković Computer Science and Engineering University of Notre Dame Fall 2010.
Bioinformatics PhD. Course Summary (approximate) 1. Biological introduction 2. Comparison of short sequences (
ITEC 2620A Introduction to Data Structures Instructor: Prof. Z. Yang Course Website: 2620a.htm Office: TEL 3049.
Subsampling Graphs 1. RECAP OF PAGERANK-NIBBLE 2.
Topics Paths and Circuits (11.2) A B C D E F G.
Pathfinding Algorithms for Mutating Weight Graphs Haitao Mao Computer Systems Lab
Computer Science 112 Fundamentals of Programming II Searching, Sorting, and Complexity Analysis.
Onlinedeeneislam.blogspot.com1 Design and Analysis of Algorithms Slide # 1 Download From
Strongly Connected Components for Directed Graphs Kelley Louie Credits: graphs by /demo/graphwin/graphwin.
Large Scale Parallel Graph Coloring 1. Presentation Overview Problem Description Basic Algorithm Parallel Strategy –Work Spawning –Graph Partition Results.
NETWORK FLOWS Shruti Aggrawal Preeti Palkar. Requirements 1.Implement the Ford-Fulkerson algorithm for computing network flow in bipartite graphs. 2.For.
Design and Analysis of Algorithms Introduction to graphs, representations of a graph Haidong Xue Summer 2012, at GSU.
Motion Notes. Key Terms 1)Motion: 2)Reference point: The state in which one object’s distance from another is changing. A place or object used for comparison.
Hw. 6: Algorithm for finding strongly connected components. Original digraph as drawn in our book and in class: Preorder label : Postorder label Nodes:
Chapter 16: Searching, Sorting, and the vector Type.
Theory of Computational Complexity Probability and Computing Chapter Hikaru Inada Iwama and Ito lab M1.
CS1022 Computer Programming & Principles
CSE373: Data Structures & Algorithms Priority Queues
Equation for a Vertical Line and a Horizontal Line
Regarding homework 9 Many low grades
The Best Algorithms are Randomized Algorithms
Uncovering the Mystery of Trust in An Online Social Network
Quinn Nelson, Donald Steffensmeier, Sachin Pawaskar
Lecture 11 Graph Algorithms
Algorithmic Efficency
Sequential Algorithms for Generating Random Graphs
Fast Kernel-Density-Based Classification and Clustering Using P-Trees
Efficient Join Query Evaluation in a Parallel Database System
Computer Science 112 Fundamentals of Programming II
Network Motif Discovery using Subgraph Enumeration and Symmetry-Breaking by Grochow and Kellis Wooyoung Kim 4/3/2009 CSc 8910 Analysis of Biological Network,
Minimum Spanning Tree 8/7/2018 4:26 AM
Finding Heuristics Using Abstraction
More Graph Algorithms.
كلية المجتمع الخرج البرمجة - المستوى الثاني
Performance Comparison of Tarry and Awerbuch Algorithms
Directory Structure A collection of nodes containing information about all files Directory Files F 1 F 2 F 3 F 4 F n Both the directory structure and the.
Noémi Gaskó, Rodica Ioana Lung, Mihai Alexandru Suciu
ITEC 2620M Introduction to Data Structures
Motifs across 4 heraldry books (More results)
SEG5010 Presentation Zhou Lanjun.
Project 1 Guidelines.
Section 8.3: Degree Distribution
Graphs By Rajanikanth B.
Lecture 6: Counting triangles Dynamic graphs & sampling
ICS 353: Design and Analysis of Algorithms
Create graphs to match these prompts
Lecture 10 Graph Algorithms
Heaps Chapter 6 Section 6.9.
Data Analysis and Reporting
Network Motifs: Simple Building Blocks of Complex Network
Classic Motion Planning Methods
Presentation transcript:

Generating Biological Network Motifs Sai Badey

Biological Networks What are they? Biological vs Regular Networks* Terminology Motifs Vertices Edges

Overall Scope Focus on efficiency Large networks Network generation

Project Aim Random Network Generation Analysis & Comparisons functions (keep # vertices & # edges constant) Swap the edges between outer-vertices Completely random generation Swap node degrees Analysis & Comparisons Run z-testing on the generations for small to extremely large graphs

Potential Results No difference Significant Difference Compare efficiencies of generation methods Create a standard for network generation Significant Difference Determine which is more accurate

Steps Amala Ghandi’s work Expansion Looks through existing network Determines motif Expansion Determine motif across several networks Compare different networks & performance Network Generation

Current Status Class Design Network Class Compare Networks Class Jung Library Constructor, Copy constructor Network generation Analysis (z-test, motif searching, data collection) Compare Networks Class Equals Comparison (highest degree node, motif comparison) Analysis (significant difference, etc)

To Do Function implementation Learning Combine with Amala Ghandi’s work Learning Vectors Hash tables

Issues Lots of research

Sources Amala Ghandi’s paper Sahand Khakabimamaghani, Iman Sharafuddin, Norbert Dichter, Ina Koch,  Ali Masoudi-Nejad QuateXelero: An Accelerated Exact Network Motif Detection Algorithm (Article) Joseph Blitzstein and Persi Diaconis A SEQUENTIAL IMPORTANCE SAMPLING ALGORITHM FOR GENERATING RANDOM GRAPHS WITH PRESCRIBED DEGREES (Article) Bjorn H. Junker & Falk Schreiber Analysis of Biological Networks (Book)

Take node, change the order of the vertices Questions?