Subtree filament graphs are the intersection graphs of subtree filaments in a tree. This class of graphs contains subtree overlap graphs, interval filament graphs, chordal graphs,...
In this paper we present an algorithm for parametrizing approximate algebraic surfaces by lines. The algorithm is applicable to -irreducible algebraic surfaces of degree d having ...
This paper presents a simple and efficient algorithm for approximate dictionary matching designed for similarity measures such as cosine, Dice, Jaccard, and overlap coefficients. ...
In this paper we study the k-means clustering problem. It is well-known that the general version of this problem is NP-hard. Numerous approximation algorithms have been proposed fo...
It is shown that structural similarity between proteins can be decided well with much less information than what is used in common similarity measures. The full C representation c...