We establish common fixed point theorems involving two pairs of weakly compatible mappings satisfying nonlinear contractive conditions in K -metric spaces. The presented theorems generalize, extend and improve many existing results in the literature. © 2011 Elsevier Ltd. All rights reserved.

The purpose of this paper is to establish a common fixed point theorem for pairs of weakly compatible maps in dislocated metric space which generalizes and improves similar fixed point results. 2000 Mathematics Subject Classification: 47H10, 54H25.

We prove the unique common fixed point theorems for pairs of weakly compatible mappings satisfying the certain contractive conditions in the setting of generalized metric spaces without exploiting the notion of continuity. Mathematics Subject Classification: Primary 47H10; Secondary 54H25

We prove some common fixed point results for two pairs of weakly compatible mappings satisfying a general contractive condition without using the completeness of the space and continuity of maps.

A protein sequence-structure alignment method for database searches is examined on how effectively this method together with a simple scoring function previously developed can identify compatibilities between sequences and structures of proteins. The scoring function consists of pairwise contact energies, repulsive packing potentials of residues for overly dense arrangement and short-range pote...

The average complexity analysis for a formalism pertaining pairs of compatible sequences is presented. The analysis is done in two levels, so that an accurate estimate is achieved. The way of separating the candidate pairs into suitable classes of ternary sequences is interesting, allowing the use of fundamental tools of symbolic computation, such as holonomic functions and asymptotic analysis ...

Pairs of spin1 2 particles are prepared in a Werner state (namely, a mixture of singlet and random components). If the random component is large enough, the statistical results of spin measurements that may be performed on each pair separately can be reproduced by an algorithm involving local “hidden” variables. However, if several such pairs are tested simultaneously, a violation of the Clause...

In a recent paper, De Baets et al. have characterized the fuzzytolerance and fuzzy equivalence relations that a given strict order relation iscompatible with. In this paper, we generalize this characterization by consideringan arbitrary (crisp) relation instead of a strict order relation, while payingattention to the particular cases of a reflexive or irreflexive relation. The reasoninglargely ...

in a recent paper, de baets et al. have characterized the fuzzytolerance and fuzzy equivalence relations that a given strict order relation iscompatible with. in this paper, we generalize this characterization by consideringan arbitrary (crisp) relation instead of a strict order relation, while payingattention to the particular cases of a reflexive or irreflexive relation. the reasoninglargely ...