~/talk

Simple Models and Exact Algorithms for Computing Network Modules

Talkat Network Biology 2016 · 2016-04-11..04-15· [machine-learning]
slides:none on file

Presents a sparse pairwise alignment that restricts each node to a candidate set and encodes edge conservation as a quadratic objective, solved by Lagrangian relaxation and variable splitting; on STRING networks with ~150,000 edges the method (Natalie) reaches near-optimal lower bounds within 1–2% and beats a recent tool (elegua) under a 10-minute CPU limit. Also frames active modules as the maximum-weight connected subgraph, reduces it to prize-collecting Steiner, ships an ILP solver and a Cytoscape plugin, and pinpoints an HGF–MET–HCF axis validated by expression follow-up.

AI-written summary · about

  1. 0:00Intro
  2. 0:30Network biology
  3. 1:45Subnetwork modules
  4. 3:35Pairwise restricted global network alignment
  5. 5:50Quadratic assignment
  6. 7:45Integer programming model
  7. 15:20How to model the signal?
  8. 19:26Results: Herpesvirus project
  9. 23:21Why simple models ? Systems
~/search
type to search 6,249 conferences, 138,987 speakers and 185,172 talks
~/help
cmdctrl k
search every conference, speaker and series
/
focus the filter search
h
home
c
conferences
s
speakers
e
series
t
light / dark — the status bar button does the same
?
this help
esc
close this, then clear every filter — or just the search, while you are typing in it

Ignored while you are typing. Pages without a filter rail have no search to focus.