Skip to main navigation Skip to search Skip to main content

A propagator for maximum weight string alignment with arbitrary pairwise dependencies

  • University of Parma
  • University of Freiburg
  • MIT Computer Science & Artificial Intelligence Laboratory

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

The optimization of weighted string alignments is a well studied problem recurring in a number of application domains and can be solved efficiently. The problem becomes MAX-SNP-hard as soon as arbitrary pairwise dependencies among the alignment edges are introduced. We present a global propagator for this problem which is based on efficiently solving a relaxation of it. In the context of bioinformatics, the problem is known as alignment of arc-annotated sequences, which is e.g. used for comparing RNA molecules. For a restricted version of this alignment problem, we show that a constraint program based on our propagator is on par with state of the art methods. For the general problem with unrestricted dependencies, our tool constitutes the first available method with promising applications in this field.

Original languageEnglish
Title of host publicationPrinciples and Practice of Constraint Programming, CP 2010 - 16th International Conference, Proceedings
PublisherSpringer Verlag
Pages167-175
Number of pages9
ISBN (Print)364215395X, 9783642153952
DOIs
Publication statusPublished - 1 Jan 2010
Externally publishedYes
Event16th International Conference on Principles and Practice of Constraint Programming, CP 2010 - St. Andrews, United Kingdom
Duration: 6 Sept 201010 Sept 2010

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6308 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference16th International Conference on Principles and Practice of Constraint Programming, CP 2010
Country/TerritoryUnited Kingdom
CitySt. Andrews
Period6/09/1010/09/10

Fingerprint

Dive into the research topics of 'A propagator for maximum weight string alignment with arbitrary pairwise dependencies'. Together they form a unique fingerprint.

Cite this