complexes - Complex Overlap 6/3/09 Representing functional...

Info iconThis preview shows pages 1–13. Sign up to view the full content.

View Full Document Right Arrow Icon
Click to edit Master subtitle style 6/3/09 Decomposition of overlapping protein Algorithms for Molecular Biology, 2006 Team 1 Presenter: Ferhat Ay
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
6/3/09 Function in PPI networks A functional group is either a maximal clique or a set of alternative variants of such complexes/cliques. A functional module is a union of overlapping functional groups.
Background image of page 2
6/3/09 Clique trees can be Chord = an edge connecting two non- consecutive nodes of a cycle Chordal graph every cycle of length at least four has a chord. Every chordal graph has a corresponding clique tree representation.
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
6/3/09 Naïve representation VS Which protein in which complex interacts with each other? Dynamics of the interactions How to identify functional groups? A set of maximum cliques containing a node are connected? Size of overlap
Background image of page 4
6/3/09
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
6/3/09
Background image of page 6
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 8
Background image of page 9

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 10
Background image of page 11

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 12
Background image of page 13
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Complex Overlap 6/3/09 Representing functional B D A C E (A B C) v (D E) V Cographs : Graphs which can be represented by Boolean expressions P 4 6/3/09 6/3/09 6/3/09 Edge Addition 6/3/09 Reduction to Minimum Vertex 6/3/09 When it works? Algorithm is not guaranteed to produce the Tree of Complexes representation. Conjectured that the algorithm will succeed for chordal graphs and cographs. Applicable to PPI networks that do not contain long (longer than four node) chordless cycles. 6/3/09 Summary A new method delineating functional groups and representing their overlaps Each functional group is represented as a Boolean expression If functional groups represent dynamically changing protein associations, the method can suggest a possible order of these...
View Full Document

This note was uploaded on 05/20/2011 for the course CAP 5515 taught by Professor Ungor during the Spring '08 term at University of Florida.

Page1 / 13

complexes - Complex Overlap 6/3/09 Representing functional...

This preview shows document pages 1 - 13. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online