14078 search results - page 2121 / 2816 » Design and Analysis of Computer Algorithms |
184
click to vote
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
The Blob Code is a bijective tree code that represents each tree on n labelled vertices as a string of n − 2 vertex labels. In recent years, several researchers have deployed th...
236
click to vote
SDM
2003
SIAM
15 years 8 months ago
2003
SIAM
The problem of finding clusters in data is challenging when clusters are of widely differing sizes, densities and shapes, and when the data contains large amounts of noise and out...
239
click to vote
BMCBI
2010
2010
Discover Protein Complexes in Protein-Protein Interaction Networks Using Parametric Local Modularity
15 years 7 months ago
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...
185
click to vote
JCB
2007
15 years 7 months ago
2007
Locality is an important and well-studied notion in comparative analysis of biological sequences. Similarly, taking into account affine gap penalties when calculating biological ...
223
click to vote
KAIS
2011
15 years 2 months ago
2011
Triangle counting is an important problem in graph mining. Two frequently used metrics in complex network analysis which require the count of triangles are the clustering coefficie...