Sciweavers

BMCBI
2007
153views more  BMCBI 2007»
13 years 2 months ago
Lower bounds on multiple sequence alignment using exact 3-way alignment
Background: Multiple sequence alignment is fundamental. Exponential growth in computation time appears to be inevitable when an optimal alignment is required for many sequences. E...
Charles J. Colbourn, Sudhir Kumar
SGP
2003
13 years 3 months ago
Rotation Invariant Spherical Harmonic Representation of 3D Shape Descriptors
One of the challenges in 3D shape matching arises from the fact that in many applications, models should be considered to be the same if they differ by a rotation. Consequently, w...
Michael M. Kazhdan, Thomas A. Funkhouser, Szymon R...
STOC
2000
ACM
156views Algorithms» more  STOC 2000»
13 years 6 months ago
Near optimal multiple alignment within a band in polynomial time
Multiple sequence alignment is a fundamental problem in computational biology. Because of its notorious difficulties, aligning sequences within a constant band (c-diagonal) is a ...
Ming Li, Bin Ma, Lusheng Wang
WABI
2005
Springer
117views Bioinformatics» more  WABI 2005»
13 years 8 months ago
Faster Algorithms for Optimal Multiple Sequence Alignment Based on Pairwise Comparisons
Multiple Sequence Alignment (MSA) is one of the most fundamental problems in computational molecular biology. The running time of the best known scheme for finding an optimal ali...
Pankaj K. Agarwal, Yonatan Bilu, Rachel Kolodny
BIBM
2007
IEEE
132views Bioinformatics» more  BIBM 2007»
13 years 8 months ago
A Divide-and-Conquer Implementation of Three Sequence Alignment and Ancestor Inference
In this paper, we present an algorithm to simultaneously align three biological sequences with affine gap model and infer their common ancestral sequence. Our algorithm can be fu...
Feng Yue, Jijun Tang
ISVC
2009
Springer
13 years 9 months ago
Deformable 2D Shape Matching Based on Shape Contexts and Dynamic Programming
This paper presents a method for matching closed, 2D shapes (2D object silhouettes) that are represented as an ordered collection of shape contexts [1]. Matching is performed using...
Iasonas Oikonomidis, Antonis A. Argyros