Multiple sequence alignment is a central problem in Bioinformatics and a challenging one for optimisation algorithms. An established integer programming approach is to apply branch-and-cut to a graph-theoretical model. The models are exponentially large but are represented intensionally, and violated constraints can be located in polynomial time. This report describes a new integer program form...

Multiview analysis of scenes includes the study of sceneindependent constraints satisfied by a configuration of cameras for all types of scenes as well as the study of viewindependent constraints satisfied by any camera on a configuration of points. In this paper, we derive new constraints involving configurations of points that move with constant velocity, with constant acceleration, and for u...

Weighted nite-state constraints that can count unboundedly many violations make Optimality Theory more powerful than nite-state transduction (Frank and Satta, 1998). This result is empirically and computationally awkward. We propose replacing these unbounded constraints, as well as nonnite-state Generalized Alignment constraints, with a new class of nite-state directional constraints. We give l...

Phrase alignment is a crucial step in phrase-based statistical machine translation. We explore a way of improving phrase alignment by adding syntactic information in the form of chunks as soft constraints guided by an in-depth and detailed analysis on a hand-aligned data set. We extend a probabilistic phrase alignment model that extracts phrase pairs by optimizing phrase pair boundaries over th...

The possibility of di!erences in phonetic alignment of phonological segments was examined by contrasting consonant sequences at word boundaries in Russian and English. In Experiment 1, two acoustic measures of consonant overlap, percent released and duration ratio, are computed for stop sequences at word boundaries, and results for English and Russian are compared. While signi"cant variation du...

We introduce an algorithm for the alignment of proteincoding sequences accounting for frameshifts. The main specificity of this algorithm as compared to previously published protein-coding sequence alignment methods is the introduction of a penalty cost for frameshift extensions. Previous algorithms have only used constant frameshift penalties. This is similar to the use of scoring schemes with...

Improvement of informative and telecommunication technologies have caused to create much heterogeneous information. In addition with increasing various information resources in ontology formats, the importance of managing these heterogeneous resources is increased. Despite most matchers use different measures for finding the mappings, some semantic inconsistencies in final alignment are inevita...

We propose a position-based approach for largescale simulations of rigid bodies at interactive frame-rates. Our method solves positional constraints between rigid bodies and therefore integrates nicely with other position-based methods. Interaction of particles and rigid bodies through common constraints enables two-way coupling with deformables. The method exhibits exceptional performance and ...

AND