Computation of Hilbert functions
Journal of Symbolic Computation
The quickhull algorithm for convex hulls
ACM Transactions on Mathematical Software (TOMS)
Structural Graph Matching Using the EM Algorithm and Singular Value Decomposition
IEEE Transactions on Pattern Analysis and Machine Intelligence - Graph Algorithms and Computer Vision
A new family of metrics for biopolymer contact structures
Computational Biology and Chemistry
Hi-index | 0.01 |
We introduce a new family of metrics for graphs of fixed size, based on counting-independent sets. Our definition is simpler and easier to calculate than the edge ideal metric family defined by Llabres and Rossello without loosing any of its abstract properties. We contrast them on some examples with graphs that represent protein secondary and three-dimensional (3D) structures. We conclude that although the edge ideal metrics are faster to calculate on some sparse graphs, in general, the independent set metrics are more tractable.