吉普-加油站问题

利用最优序列方法研究了吉普－加油站问题,确定了单向行驶吉普－加油站问题和往返行驶吉普－加油站问题的最优序列。     

On The Homotopy Type of

We consider the homotopy type of classifying spaces , where is a finite -group, and we study the question whether or not the mod cohomology of , as an algebra over the Steenrod algebra together with the associated Bockstein spectral sequence, determine the homotopy type of . This article is devoted to producing some families of finite 2-groups where cohomological information determines the homotopy type of .

     

Λ0-Nuclear Operators and Λ0-Nuclear Spaces in p-adic Analysis

For a Köthe sequence space, the classes of ₀-nuclear spaces and spaces with the ₀-property are introduced and studied and the relation between them is investigated. Also, we show that, for ₀c ₀, these classes of spaces are in general different from the corresponding ones for ₀=c ₀, which have been extensively studied in the non-archimedean literature (see, for example, [1]–[6]).     

Novel evolutionary models and applications to sequence alignment problems

In this paper, we present a novel graph-theoretical approach for representing a wide variety of sequence analysis problems within a single model. The model allows incorporation of the operations “insertion”, “deletion”, and “substitution”, and various parameters such as relative distances and weights. Conceptually, we refer the problem as the minimum weight common mutated sequence (MWCMS) problem. The MWCMS model has many applications including multiple sequence alignment problem, the phylogenetic analysis, the DNA sequencing problem, and sequence comparison problem, which encompass a core set of very difficult problems in computational biology. Thus the model presented in this paper lays out a mathematical modeling framework that allows one to investigate theoretical and computational issues, and to forge new advances for these distinct, but related problems. Through the introduction of supernodes, and the multi-layer supergraph, we proved that MWCMS is -complete. Furthermore, it was shown that a conflict graph derived from the multi-layer supergraph has the property that a solution to the associated node-packing problem of the conflict graph corresponds to a solution of the MWCMS problem. In this case, we proved that when the number of input sequences is a constant, MWCMS is polynomial-time solvable. We also demonstrated that some well-known combinatorial problems can be viewed as special cases of the MWCMS problem. In particular, we presented theoretical results implied by the MWCMS theory for the minimum weight supersequence problem, the minimum weight superstring problem, and the longest common subsequence problem. Two integer programming formulations were presented and a simple yet elegant decomposition heuristic was introduced. The integer programming instances have proven to be computationally intensive. Consequently, research involving simultaneous column and row generation and parallel computing will be explored. The heuristic algorithm, introduced herein for multiple sequence alignment, overcomes the order-dependent drawbacks of many of the existing algorithms, and is capable of returning good sequence alignments within reasonable computational time. It is able to return the optimal alignment for multiple sequences of length less than 1500 base pairs within 30 minutes. Its algorithmic decomposition nature lends itself naturally for parallel distributed computing, and we continue to explore its flexibility and scalability in a massive parallel environment.     

合数模上的伪随机二进制数列

设m为"RSA"类型的模,即m为两个大小差不多的素数的乘积:m=pqp,q为素数,p相似文献   

剖面隐马氏模型训练算法的改进

利用剖面隐马氏模型获得多序列联配，一般需要经过初始化、训练、联配三个过程．然而，目前广泛采用的Baum—welch训练算法假设各条可观察序列互相独立，这与实际情况有所不符．本文对剖面隐马氏模型，给出可观察序列在互相不独立情况下的改进Baum—wlelch算法，在可观察序列两种特殊情况下（互相独立和一致依赖），得到了改进算法的具体表达式，讨论了一般情况下权重的选取方法．最后通过一个具体的蛋白质家族的多序列联配来说明改进算法的效果．