We present a radically new indexing approach for approximate string matching. The scheme uses the metric properties of the edit distance and can be applied to any other metric between strings. We build a metric space where the sites are the nodes of the suffix tree of the text, and the approximate query is seen as a proximity query on that metric space. This permits us finding the occ occurrenc...

In the present paper, two theorems are discussed, one is fixed point theorem and another \(n\)-tuple for a new contractive condition in bi-complete $F$-quasi metric space. Also, an example given to validate result.

We prove a unique common fixed-point theorem for two pair of weakly compatible maps in a complete metric space, which generalizes the result of Brian Fisher by a weaker condition such as weakly compatibility instead of compatibility and contractive modulus instead of continuity of maps.

This paper is a continuation of [12]. First some definitions needed to formulate Cantor’s theorem on complete spaces and show several facts about them are introduced. Next section contains the proof of Cantor’s theorem and some properties of complete spaces resulting from this theorem. Moreover, countable compact spaces and proofs of auxiliary facts about them is defined. I also show the import...