The multiple sequence alignment problem is very applicable and important in various elds in molecular biology. Because the optimal alignment that maximizes the score is not always biologically most signi cant, providing many suboptimal alignments as alternatives for the optimal one is very useful. As for the alignment of two sequences, this suboptimal problem is well-studied 6;9;12 , but for th...

SEEP executes the code under test symbolically to extract all code paths and their path constraints. On basis of these results, SEEP crafts program code with predefined input data, so-called path entities. For each path entity, SEEP generates a runtime execution trace by executing them on a test system and increments a block counter for every basic block (branchless sequence of code) each time ...

Introduction: The Widespread range of mobile phone application in life has induced many problems in the societies. This subject has caused jammer router is used in some places. Jammer router blocks signal transfer from base station to the cell phone. In the other hand, the extensive application of electromagnetic field in all aspect of life has increased fears and worries about...

Proof. As the edges in GC represent causal relations, a path of length 0 (no edge) is not considered a causal relation, and existence of a directed path from a variable back to itself would contravene the causal DAG assumption, hence: irreflexive and acyclic (or, more accurate, asymmetric). Transitivity follows immediately, by concatenation, from the sequence 〈X, .., Y, .., Z〉, in which each no...

MOTIVATION Dynamic programming is the core algorithm of sequence comparison, alignment and linear hidden Markov model (HMM) training. For a pair of sequence lengths m and n, the problem can be solved readily in O(mn)time and O(mn)space. The checkpoint algorithm introduced by Grice et al. (CABIOS, 13, 45--53, 1997) runs in O(Lmn)time and O(Lm(L) square root of n)space, where L is a positive inte...

Inheritance Anomaly is considered as a major problem in integrating object-orientation and concurrency. The anomaly forces redefinitions of inherited methods to maintain the integrity of concurrent objects. In this paper we discuss how the use of boolean, access and path guards attached to methods solve the problem of inheritance anomaly. Synchronizationusing boolean guards have known to be fre...

We study the concept of quadratic variation a continuous path along sequence partitions and its dependence with respect to choice partition sequence. introduce roughness show that for Hölder-continuous paths satisfying this condition, balanced is invariant Typical Brownian motion are shown satisfy property almost-surely any required step size condition. Using these results we derive formulation...

The paper presents a method of abstraction for timed systems. To extract an abstract model of a timed system we propose to use static analysis, namely a technique called path compression. The idea behind the path compression consists in identifying a path (or a set of paths) on which a process executes a sequence of transitions that do not influence a property being verified, and replacing this...

We propose an integrated approach to generate test cases from UML sequence and activity diagrams. We first transform these UML diagrams into a graph. Then, we propose an algorithm to generate test scenarios from the constructed graph. Next, the necessary information for test case generation, such as method-activity sequence, associated objects, and constraint conditions are extracted from test ...

A sequence of binary words of length n is called a cube dominating path, if the Hamming distance between two consecutive words is always one, and every binary word of length n is within Hamming distance one from at least one of these words. If also the first and last words are Hamming distance one apart, the sequence is called a cube dominating cycle. Bounds on the cardinality of such sequences...