Search results for "FIX"
showing 10 items of 1335 documents
On the longest common factor problem
2008
The Longest Common Factor (LCF) of a set of strings is a well studied problem having a wide range of applications in Bioinformatics: from microarrays to DNA sequences analysis. This problem has been solved by Hui (2000) who uses a famous constant-time solution to the Lowest Common Ancestor (LCA) problem in trees coupled with use of suffix trees. A data structure for the LCA problem, although linear in space and construction time, introduces a multiplicative constant in both space and time that reduces the range of applications in many biological applications. In this article we present a new method for solving the LCF problem using the suffix tree structure with an auxiliary array that take…
A generalization of Nadler fixed point theorem
2015
Jleli and Samet gave a new generalization of the Banach contraction principle in the setting of Branciari metric spaces [Jleli, M. and Samet, B., A new generalization of the Banach contraction principle, J. Inequal. Appl., 2014:38 (2014)]. The purpose of this paper is to study the existence of fixed points for multivalued mappings, under a similar contractive condition, in the setting of complete metric spaces. Some examples are provided to illustrate the new theory.
The Gupta-Belnap Fixed-Point Problem and the Theory of Clones of Functions
2003
This paper presents the Gupta-Belnap Fixed-Point problem: to characterize the truth-functional schemes of the first-order logic such that, for every interpreted language L, a truth predicate for L can be defined in L using a Kripkean fixed-point. A propositional version of the problem is defined using the stipulation logic of A. Visser and then the strategy adopted for the solution to the three-valued case is presented, using the theory of clones of functions.
Some Integral Type Fixed-Point Theorems and an Application to Systems of Functional Equations
2013
In this paper, we prove a new common fixed point theorem for four self mappings by using the notions of compatibility and subsequential continuity (alternate subcompatibility and reciprocal continuity) in metric spaces satisfying a general contractive condition of integral type. We give some examples to support the useability of our main result. Also, we obtain some fixed point theorems of Gregus type for four mappings satisfying a strict general contractive condition of integral type in metric spaces. We conclude the paper with an application of our main result to solvability of systems of functional equations.
On the Construction of Classes of Suffix Trees for Square Matrices: Algorithms and Applications
1996
AbstractWe provide a uniform framework for the study of index data structures for a two-dimensional matrixTEXT[1:n, 1:n] whose entries are drawn from an ordered alphabetΣ. An index forTEXTcan be informally seen as the two-dimensional analog of the suffix tree for a string. It allows on-line searches and statistics to be performed onTEXTby representing compactly theΘ(n3) square submatrices ofTEXTin optimalO(n2) space. We identify 4n−1families of indices forTEXT, each containing ∏ni=1(2i−1)! isomorphic data structures. We also develop techniques leading to a single algorithm that efficiently builds any index in any family inO(n2logn) time andO(n2) space. Such an algorithm improves in various …
Impact of common property (E.A.) on fixed point theorems in fuzzy metric spaces
2011
We observe that the notion of common property (E.A.) relaxes the required containment of range of one mapping into the range of other which is utilized to construct the sequence of joint iterates. As a consequence, a multitude of recent fixed point theorems of the existing literature are sharpened and enriched.
Fixed Points for Pseudocontractive Mappings on Unbounded Domains
2010
We give some fixed point results for pseudocontractive mappings on nonbounded domains which allow us to obtain generalizations of recent fixed point theorems of Penot, Isac, and Németh. An application to integral equations is given.
Common fixed point theorems for mappings satisfying common property (E.A.) in symmetric spaces
2011
In this paper, common fixed point theorems for mappings satisfying a generalized contractive condition are obtained in symmetric spaces by using the notion of common property (E.A.). In the process, a host of previously known results are improved and generalized. We also derive results on common fixed point in probabilistic symmetric spaces.
Common Fixed Point Theorems for Weakly Compatible Maps Satisfying a General Contractive Condition
2008
We introduce a new generalized contractive condition for four mappings in the framework of metric space. We give some common fixed point results for these mappings and we deduce a fixed point result for weakly compatible mappings satisfying a contractive condition of integral type.
On Branciari’s theorem for weakly compatible mappings
2010
AbstractIn a recent paper B. Samet and H. Yazidi [B. Samet, H. Yazidi, An extension of Banach fixed point theorem for mappings satisfying a contractive condition of integral type, Ital. J. Pure Appl. Math. (in press)] have obtained an interesting theorem for mappings satisfying a contractive condition of integral type. The aim of this note is to present a generalization of their main result.