paris polyphylla smith var. yunnanensis (liliaceae) is an important traditional medicinal plant of the yunnan province in china. however, the genomic information regarding this plant is limited. to further understand its molecular background, we conducted illumina hiseq 2000 second-generation sequencing of this plant species. approximately 30,198,679 reads with an average length of 202 bases we...

bioinformatics, through the sequencing of the full genomes for many species, is increasingly relying on efficient global alignment tools exhibiting both high sensitivity and specificity. many computational algorithms have been applied for solving the sequence alignment problem. dynamic programming, statistical methods, approximation and heuristic algorithms are the most common methods applied t...

Abstract: Testing a data path in a digital system such as a microcontroller requires checking every possible way of sending data between the functional units. This paper considers a task of generating a test bench for a given data path, which covers every way of data sending with minimized number of simulations of microinstructions. We present a method in which a data path is modeled by a Petri...

The mobile adhoc networks, is the decentralized type of network in which mobile nodes can join or leave the network when they want. The secure and shortest path from source to destination will be selected on the basis of hop count and sequence number. The selected path must have minimum hop count and maximum sequence number. When the malicious node enters the network it leads to trigger wormhol...

At the receiver, we have a sequence of voltage samples corresponding to the parity bits that the transmitter has sent. For simplicity, and without loss of generality, we will assume 1 sample per bit. In the previous lecture, we assumed that these voltages have been digitized to form a received bit sequence. If we decode this received bit sequence, the decoding process is termed hard decision de...

Abstract This paper studies a generalization of the shortest path tour problem with time windows ( GSPTPTW ). The aim is to find single-origin single-destination path, which has pass through an ordered sequence not necessarily disjoint node-subsets. Each node window for each node-subset it belongs. We investigate theoretical properties and propose dynamic programming approach solve it. Numerica...

This paper presents the design, implementation and testing of the critical path analysis technique on the IPS performance measurement tool for parallel and distributed programs. We create a precedence graph of a program’s activities (Program Activity Graph) with the data collected during the execution of a program. The critical path, the longest path in the program activity graph, represents th...

We propose algorithms that use the complete knowledge of future topology changes to set up benchmarks for the minimum number of times a communication structure (like paths, trees, connected dominating sets, etc.) should change in the presence of a dynamically changing topology. We first present an efficient algorithm called OptPathTrans that operates on a simple greedy principle: whenever a new...