This study discusses three software tools, the first two aid in integrating sequence with an FPC physical map and the third automatically selects a minimal tiling path given genomic draft sequence and BAC end sequences. The first tool, FSD (FPC Simulated Digest), takes a sequenced clone and adds it back to the map based on a fingerprint generated by an in silico digest of the clone. This allows...

In this paper, a parametric description of a transition sequence in a Time Petri net is introduced. The minimal and maximal time duration of a transition sequence are shown to be integers and furthermore the min/max path passes only integer-states. A necessary condition for the reachability of an arbitrary state is given.

This paper proposes a method of gesture recognition with a focus on important actions for distinguishing similar gestures. The method generates a partial action sequence by using optical flow images, expresses the sequence in the eigenspace, and checks the feature vector sequence by applying an optimum path-searching method of weighted graph to focus the important actions. Also presented are th...

A rollercoaster is a sequence of real numbers for which every maximal contiguous subsequence, that is increasing or decreasing, has length at least three. By translating this sequence to a set of points in the plane, a rollercoaster can be defined as a polygonal path for which every maximal sub-path, with positiveor negative-slope edges, has at least three points. Given a sequence of distinct r...

Context and sequence variables allow matching to explore term-trees both in depth and in breadth. It makes context sequence matching a suitable computational mechanism for a rule-based language to query and transform XML, or to specify and verify web sites. Such a language would have advantages of both path-based and pattern-based languages. We develop a context sequence matching algorithm and ...

An ordering for terms with sequence variables and flexible arity symbols is presented. The ordering coincides with the lexicographic extension of multiset path ordering on terms without sequence variables. It is shown that the classical strict superposition calculus with ordering and equality constraints can be used as a refutationally complete proving method for well-constrained sets of clause...

Human semantic memory is modeled as a network with a finite automation embedded at each node. The nodes represent concepts in the memory, and every arc bears a label denoting the binary relation between the two concepts that it joins. The process of question-answering is formulated as a mathematical problem: Given a finite sequence of labels, tlnd a path in memory between two given nodes whose ...

A lattice path P in Z is a path in the d-dimensional integer lattice Z which uses only points of the lattice, that is, it is a sequence (P0, P1, . . . , Pl), where Pi ∈ Z d for all i. The vectors −−→ P0P1, −−→ P1P2, . . . , −−−−→ Pl−1Pl are called the steps of P . The number of steps, l, is called the length of P , and denoted by l(P ). Figure 1 shows a lattice path in Z of length 11. (The hori...