Efficient sequence alignment with side-constraints by cluster tree elimination

DOI10.1007/S10601-007-9032-XzbMath1152.90644OpenAlexW2081293325MaRDI QIDQ941669

Rolf Backofen, Anke Busch, Sebastian Will

Publication date: 2 September 2008

Published in: Constraints (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10601-007-9032-x

zbMATH Keywords

Dynamic programmingSequence alignmentCluster tree elimination

Mathematics Subject Classification ID

Dynamic programming (90C39)

Cites Work

• AND/OR search spaces for graphical models
• Comparison of biosequences
• Unifying tree decompositions for reasoning in graphical models
• Simultaneous Solution of the RNA Folding, Alignment and Protosequence Problems
• Semiring-based constraint satisfaction and optimization
• Parametric sequence alignment with constraints

This page was built for publication: Efficient sequence alignment with side-constraints by cluster tree elimination