Molecular biologists use Hidden Markov Models (HMMs) as a popular tool to statistically describe protein sequence families. This statistical description can then be used for sensitive and selective database scanning. Even though efficient dynamic programming algorithms exist for the problem, the required scanning time is still very high, and because of the exponential database growth finding fa...

This paper presents results on the complexity of computing event orderings for sharedmemory parallel program executions. Given a program execution, we formally define the problem of computing orderings that the execution must have exhibited or could have exhibited, and prove that computing such orderings is an intractable problem. We present a formal model of a shared-memory parallel program ex...

In this paper we present the results obtained in the solution of sparse and large systems of nonlinear equations by Inexact Newton-like methods [6]. The linearized systems are solved with two preconditioners particularly suited for parallel computation. We report the results for the solution of some nonlinear problems on the CRAY T3E under the MPI environment. Our methods may be used to solve m...

Binary Decision Diagrams (BDDs) have proved to be a powerful representation for Boolean functions. Particularly, they are a very useful data structure for the symbolic model checking of digital circuits and other finite state systems, as well as other problems. Nevertheless, the size of the BDD representation of these functions is highly dependent on the order of the function arguments, also ca...

This paper studies likelihood ratio ordering between two parallel systems with exponential components. We introduce a new partial order and extend the classical Dykstra’s theorem to higher dimension. Some other results on likelihood ratio ordering of parallel systems are also derived.

Visualization of high-dimensional data is counter-intuitive using conventional graphs. Parallel coordinates are proposed as an alternative to explore multivariate more effectively. However, it difficult extract relevant information through the parallel when with thousands overlapping lines. The order axes determines perception on coordinates. Thus, between attributes remains hidden if improperl...

A new dynamic ordering is presented for the parallel one-sided block Jacobi SVD algorithm. Similarly to the two-sided variant, which has been analyzed and implemented in last 10 years, the dynamic ordering takes into account the actual status of a matrix—this time of its block columns with respect to their mutual orthogonality. Using p processors, in each parallel iteration step the p mostly in...

Table 1: An example of clone-probe hybridization data in the absence of errors Reconstructing a physical map of a chromosome from a genomic library presents a central computational problem in genetics. Physical map reconstruction in the presence of errors is a problem of high computational complexity. Parallel Monte Carlo methods for a maximum likelihood estimation-based approach to physical ma...