Sciweavers

4865 search results - page 39 / 973
» The Complexity of Graph Connectivity
Sort
View
BMCBI
2010
142views more  BMCBI 2010»
14 years 9 months 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
DM
2007
135views more  DM 2007»
14 years 9 months ago
Heavy fans, cycles and paths in weighted graphs of large connectivity
A set of paths joining a vertex y and a vertex set L is called (y, L)-fan if any two of the paths have only y in common, and its width is the number of paths forming it. In weight...
Jun Fujisawa
BMCBI
2006
144views more  BMCBI 2006»
14 years 9 months 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 ...
DIAGRAMS
2004
Springer
15 years 3 months ago
Ensuring the Drawability of Extended Euler Diagrams for up to 8 Sets
Abstract. This paper shows by a constructive method the existence of a diagrammatic representation called extended Euler diagrams for any collection of sets X1, ..., Xn , n < 9....
Anne Verroust, Marie-Luce Viaud
IPPS
2010
IEEE
14 years 7 months ago
A general algorithm for detecting faults under the comparison diagnosis model
We develop a widely applicable algorithm to solve the fault diagnosis problem in certain distributed-memory multiprocessor systems in which there are a limited number of faulty pr...
Iain A. Stewart