In this article we address two pattern matching problems which have important applications to bioinformatics. First we address the topology-free query problem: Given a set of labels L, a multiset P of labels from L, a graph H = (VH , EH) and a function LabelH : VH → 2, we need to find a subtree S of H which is an occurrence of P . We provide a fixed-parameter algorithm with parameter k = |P | w...

In the recent years, global logistics industry has greatly driven development of world economy. At same time, a large amount data information is generated. Due to frequent occurrence leakage and forgery, it necessary find solutions that can accurately trace ensure security authenticity information. The birth blockchain technology transformed from quantitative change qualitative change. technica...

The Li–Wan sieve [11] is extended to multisets when the underlying set symmetric. main ingredient of proof Möbius inversion formula on poset partitions {1,2,…,k} ordered by refinement. As illustrative applications, we investigate problems over finite fields and zero-sum additive group Z/nZ.

A homomorphic, or incremental, multiset hash function, associates a hash value to arbitrary collections of objects (with possible repetitions) in such a way that the hash of the union of two collections is easy to compute from the hashes of the two collections themselves: it is simply their sum under a suitable group operation. In particular, hash values of large collections can be computed inc...