Sciweavers

1285 search results - page 41 / 257
» On the Complexity of Ordinal Clustering
Sort
View
BMCBI
2007
160views more  BMCBI 2007»
14 years 11 months 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...
ECSQARU
1997
Springer
15 years 2 months ago
Creating Prototypes for Fast Classification in Dempster-Shafer Clustering
We develop a classification method for incoming pieces of evidence in Dempster-Shafer theory. This methodology is based on previous work with clustering and specification of origin...
Johan Schubert
BMCBI
2010
150views more  BMCBI 2010»
14 years 11 months ago
MCL-CAw: a refinement of MCL for detecting yeast complexes from weighted PPI networks by incorporating core-attachment structure
Background: The reconstruction of protein complexes from the physical interactome of organisms serves as a building block towards understanding the higher level organization of th...
Sriganesh Srihari, Kang Ning, Hon Wai Leong
BMCBI
2006
144views more  BMCBI 2006»
14 years 11 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 ...
BIBM
2010
IEEE
157views Bioinformatics» more  BIBM 2010»
14 years 9 months ago
Decomposing PPI networks for complex discovery
Abstract--Protein complexes are important for understanding principles of cellular organization and functions. With the availability of large amounts of high-throughput proteinprot...
Guimei Liu, Chern Han Yong, Limsoon Wong, Hon Nian...