A family of metrics for biopolymers based on counting independent sets
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 Llabrs and Rossell 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.
counting-independent sets edge ideal metric graph distance hilbert polynomial cliques