Sciweavers

2612 search results - page 151 / 523
» Switching Graphs and Their Complexity
Sort
View
IM
2008
15 years 24 days ago
Directed Random Dot Product Graphs
In this paper we consider three models for random graphs that utilize the inner product as their fundamental object. We analyze the behavior of these models with respect to cluster...
Stephen J. Young, Edward R. Scheinerman
BMCBI
2007
160views more  BMCBI 2007»
15 years 27 days ago
Identifying protein complexes directly from high-throughput TAP data with Markov random fields
Background: Predicting protein complexes from experimental data remains a challenge due to limited resolution and stochastic errors of high-throughput methods. Current algorithms ...
Wasinee Rungsarityotin, Roland Krause, Arno Sch&ou...
142
Voted
PODS
1994
ACM
138views Database» more  PODS 1994»
15 years 4 months ago
Dyn-FO: A Parallel, Dynamic Complexity Class
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
Sushant Patnaik, Neil Immerman
BMCBI
2010
142views more  BMCBI 2010»
15 years 27 days ago
Discover Protein Complexes in Protein-Protein Interaction Networks Using Parametric Local Modularity
Background: Recent advances in proteomic technologies have enabled us to create detailed protein-protein interaction maps in multiple species and in both normal and diseased cells...
Jongkwang Kim, Kai Tan
BMCBI
2006
144views more  BMCBI 2006»
15 years 26 days ago
Development and implementation of an algorithm for detection of protein complexes in large interaction networks
Background: After complete sequencing of a number of genomes the focus has now turned to proteomics. Advanced proteomics technologies such as two-hybrid assay, mass spectrometry e...
Md. Altaf-Ul-Amin, Yoko Shinbo, Kenji Mihara, Ken ...