In this paper, we define a novel variation on the constrained sequence alignment problem, the Sequence Alignment with Regular Expression Path Constraint problem, in which the constraint is given in the form of a regular expression. Our definition extends and generalizes the existing definitions of alignment-path constrained sequence alignments to the expressive power of regular expressions. We ...

We give an elementary procedure based on simple generating functions for constructing n (for any n >/2) pairwise non-isomorphic trees, all of which have the same degree sequence and the same number of paths of length k for all k >t 1. The construction can also be used to give a sufficient condition for isomorphism of caterpillars. In [2], a 2-variable polynomial that is closely related to the f...

Recently, there has been a growing research interest in the analysis of dynamic regret, which measures the performance of an online learner against a sequence of local minimizers. By exploiting the strong convexity, previous studies have shown that the dynamic regret can be upper bounded by the path-length of the comparator sequence. In this paper, we illustrate that the dynamic regret can be f...

We can have a new perspective about customer by analyzing customer shopping path data because customer should go to a specific place to buy some product in store. The analysis of path data is time-consuming work. In this way, the commonly used method is clustering algorithm in order to understand the tendency of data. But a general clustering algorithm is not suitable to identify the shopping p...

Structural and functional constraints are known to play a major role in restricting the path of evolution of protein activities. However, constraints acting on evolving transcriptional regulatory sequences, e.g. enhancers, are largely unknown. Recently, we elucidated how a novel expression pattern of the Neprilysin-1 (Nep1) gene in the optic lobe of Drosophila santomea evolved via co-option of ...

Geomagnetic field is highly applicable to indoor localization due to its pervasive spatial presence, high signal stability and infrastructureless support. Previous work in the area often fuses it with pedometer (step counter) via particles. These approaches are computationally intensive and require strong assumptions on user behavior. To overcome the weaknesses, we propose Magil, a pedometer-fr...

Recently, there has been a growing research interest in the analysis of dynamic regret, which measures the performance of an online learner against a sequence of local minimizers. By exploiting the strong convexity, previous studies have shown that the dynamic regret can be upper bounded by the path-length of the comparator sequence. In this paper, we illustrate that the dynamic regret can be f...

This paper introduces proximal path cycles, which lead to the main results in this paper, namely, extensions of Mitsuishi-Yamaguchi Good Coverning Theorem with different forms Tanaka good cover an Alexandrov space equipped a proximity relation as well extension Jordan curve theorem. In work, cycle is sequence maps h1,...,hi,...,hn-1 mod n hi : [ 0,1 ] → X and hi(1) = hi+1(0) provide structure p...

Pinch-outs refers to the gradual thinning of thickness sedimentary layer laterally until there is no deposition and are a major topic modern research on automated drawing geological profiles. The rapid development smart systems imposed an urgent need for high-speed, accurate methods plot pinch-outs. However, because their complexity, excessive number branch paths, low rendering speed, poor reli...