We are given a collection of m random subsequences (traces) of a string t of length n where each trace is obtained by deleting each bit in the string with probability q. Our goal ...
Background: The Smith-Waterman algorithm for local sequence alignment is more sensitive than heuristic methods for database searching, but also more time-consuming. The fastest ap...
Abstract. This paper describes a new technique for the direct translation of character n-grams for use in Cross-Language Information Retrieval systems. This solution avoids the nee...
We propose a fast 3D model acquisition system that aligns intensity and depth images, and reconstructs a textured 3D mesh. 3D views are registered with shape alignment based on in...
Louis-Philippe Morency, Ali Rahimi, Trevor Darrell
Research in bioinformatics and computational biology relies heavily on algorithms that facilitate the understanding of biological processes through the application of statistical ...