A palindrome is a string of the form S = A1A2or S = A1aA2, where A1and A2are substrings of S and the reverse of A2exactly matches with A1. DNA palindromes show direct influence on tumerogenesis due to the formation of DNA palindromes at microRNA genes, which involve in tumor development. Furthermore, RNA palindromes play a crucial role in genomic instability and gene amplification in some human cancers. Therefore, it is important to develop effective approaches to identify and characterize biological approximate palindromes. In this paper, we developed a simple algorithm to find all the exact and approximate palindromes up to k errors (k is specified by the user) for the two different types of RNA sequence data, i.e. mRNA sequences of fusion genes and human microRNAs (miRNAs). We confirmed that the palindromes in RNA sequences are A-U rich. According to the Kolmogorov-Smirnov test, it was found that miRNA has a frequency distribution of palindromes different from the fusion genes' mRNAs. The proposed algorithm is easy to implement, which provides an effective tool for investigating the relationship between palindromes and cancer biology.

The interconnection network considered in this paper is the k-ary n-cube that is an attractive variance of the well-known hypercube. Many interconnection networks, including the ring, torus and hypercube, that are attractive in both theoretical interests and practical systems can be regarded as the subclasses of the k-ary n-cubes. Stewart and Xiang have investigated the fault-tolerant path embedding properties of the k-ary n-cube [2008, IEEE Trans. Parallel Distrib. Syst., 19 1071–1085]. From their results, we know that the k-ary n-cube is a (2n – 2)-edge-fault-tolerant Hamiltonian for k even. In this paper, we do a further investigation for the fault-tolerant cycle embedding properties of the k-ary n-cubes. First, we introduce a new graph called the ladder-wounded cycle-of-ladders (LWCOL). By embedding the LWCOL into the k-ary n-cubes for k even with at most 2n – 2 edge faults, we show that the k-ary n-cube is (2n – 2)-edge-fault-tolerant bipancyclic for k even; that is, it embeds all cycles of even lengths ranging from 4 to N when there exist at most 2n – 2 edge faults, where N is the order of the network. Since the degree of the k-ary n-cube is 2n, the result is optimal.

The interconnection network considered in this paper is the k-ary n-cube that is an attractive variance of the well-known hypercube. Many interconnection networks that are desirable in both theoretical interests and practical systems, including the ring, torus and hypercube, may be regarded as the subclasses of k-ary n-cubes. In this paper, we investigate the pancycle-connected properties of the k-ary n-cube. We show that the k-ary n-cube is bipancycle-connected for k being even. That is, each pair of vertices x and y is contained by a cycle of each even length ranging from the length of the smallest even cycle that contains x and y to N, where N is the order of the network. We also show that the k-ary n-cube is strictly m-pancycle-connected for k being odd and n ≥ 2, where m = nk - n. That is, each pair of vertices is contained by a cycle of each length ranging from nk - n to N; and nk - n has reached the lower bound of the problem.

For most Portable Media Player (PMP), the demands for large storage space and longer working time usually can not be satisfied at the same time. In this paper, a low power wireless LAN based PMP called WiPMP is proposed. WiPMP is basically a diskless PMP. Instead, it can retrieve a large number of multimedia data from a remote storage device wirelessly. A prototype of WiPMP has been realized on an Intel Xscale embedded platform with Embedded Linux as the operating system. A systematic power measurement and analysis method is used in this paper to evaluate the prototype from the perspective of power consumption. The result shows that WiPMP does consume less power and is able to access much more multimedia data than the hard disk based PMP.

This paper introduces a pancyclic recursive topology, named the hypercomplete, for building large-scale distributed multicomputer systems. The hypercomplete is maximally fault-tolerant and has a logarithmic diameter. In addition to being pancyclic, the hypercomplete is Hamiltonian-connected. Consequently, the hypercomplete can embed rings of all possible lengths and a longest linear array between arbitrary two nodes. Besides, the hypercomplete can embed tori and trees with constant dilation and constant congestion. Some algorithms are developed for the hypercomplete. An algorithm is proposed to determine a shortest path between arbitrary two nodes. A broadcasting algorithm without redundant messages is proposed, whose resulting spanning tree has its height bounded above by the diameter. The class of ascend/descend algorithms can be executed efficiently. © 2000 John Wiley & Sons, Inc.

In this paper, a new two-level interconnection network, called a hierarchical folded-hypercube network (HFN, for short), is proposed. The HFN takes folded hypercubes as basic modules which are connected in a complete manner. We investigate the topological properties of the HFN, including the diameter, cost, average distance, embedding, connectivity, container, /spl kappa/-wide diameter, and node-fault diameter. We show that the HFN can emulate algorithms which are executable on the ring or the mesh-connected computer with the same time complexities in big-O notation. Moreover, the HFN can embed a folded hypercube having the same number of nodes with constant dilation. We compute the diameter, node connectivity, best container, /spl kappa/-wide diameter, and node-fault diameter of the HFN. We present optimal routing and broadcasting algorithms for the HFN. The semigroup computation and descend/ascend algorithms can be executed as well on the HFN.>