Abstract. The Longest Common Subsequence (LCS) problem is a classic and well-studied problem in computer science. The LCS problem is a common task in DNA sequence analysis with man...
Background: Motif finding algorithms have developed in their ability to use computationally efficient methods to detect patterns in biological sequences. However the posterior cla...
Ana C. Casimiro, Susana Vinga, Ana T. Freitas, Arl...
Background: Graph drawing is one of the important techniques for understanding biological regulations in a cell or among cells at the pathway level. Among many available layout al...
: Global positioning systems (GPS) and mobile phone networks are making it possible to track individual users with an increasing accuracy. It is natural to ask whether one can use ...
Arnon Amir, Alon Efrat, Jussi Myllymaki, Lingeshwa...
In this paper, we propose an efficient method for tracking multiple objects, which deals with occlusion situations in an image. We use Shape from silhouettes method to reconstruct...
Koichiro Deguchi, Koji Hamasaki, Taira Nakajima, T...