Abstract:Sequence alignment is one of the most important fundamental operations in bioinformatics. It has been successfully applied to predict the function, structure and evolution of biological sequences. In this paper, the sequence alignment algorithms based on dynamic programming are analyzed and compared. We present a parallel algorithm for pairwise alignment and implement it on a clustering system with MPI. The experimental results demonstrate the effectiveness in performance promotion. We encapsulate the algorithm into a grid service for practical use.
Abstract:Path Planning is generating a collision-free path in an environment with obstacles and optimizing it with respect to some criterion. Because of its importance in robotics, the problem has attracted a considerable amount of research interest. In this paper, we present an effective algorithm of shortest path planning for planar mobile robot whose time complexity is 0(4 x n),;? is the geometric complexity of the static planar environment. The success of our algorithm relies on exploiting both a tabu restriction and the greedy strategy of the Dijkstra algorithm. Our experimental evaluations on four different test cases show that our algorithm produces the shortest path very quickly.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.