Sciweavers

87 search results - page 14 / 18
» Limits of dense graph sequences
Sort
View
MST
2010
86views more  MST 2010»
14 years 4 months ago
Fixed-Parameter Enumerability of Cluster Editing and Related Problems
Cluster Editing is transforming a graph by at most k edge insertions or deletions into a disjoint union of cliques. This problem is fixed-parameter tractable (FPT). Here we comput...
Peter Damaschke
CIKM
2010
Springer
14 years 8 months ago
SHRINK: a structural clustering algorithm for detecting hierarchical communities in networks
Community detection is an important task for mining the structure and function of complex networks. Generally, there are several different kinds of nodes in a network which are c...
Jianbin Huang, Heli Sun, Jiawei Han, Hongbo Deng, ...
BMCBI
2007
120views more  BMCBI 2007»
14 years 9 months ago
Quantitative sequence-function relationships in proteins based on gene ontology
Background: The relationship between divergence of amino-acid sequence and divergence of function among homologous proteins is complex. The assumption that homologs share function...
Vineet Sangar, Daniel J. Blankenberg, Naomi Altman...
VLSID
2002
IEEE
142views VLSI» more  VLSID 2002»
15 years 10 months ago
Degree-of-Freedom Analysis for Sequential Machines Targeting BIST Quality and Gate Area
| This paper reports the design of BIST structures for sequential machines. Testability of an FSM is limited due to the fact that some machine states remain unreachable and some ac...
Samir Roy, Biplab K. Sikdar, Monalisa Mukherjee, D...
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 ...