Dynamic programming based approximation algorithms for sequence alignment with constraints

DOI10.1287/IJOC.1040.0097MaRDI QIDQ2890445zbMATH OpenOpenAlexFDO

Authors Abdullah N. Arslan, Ömer Eğecioğlu

Publication date 8 June 2012

Published in INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/8200e56013c40288109839bde3c04a395c409121

zbMATH Keywords

dynamic programmingcomparisonfractional programminglocal alignmentcyclic sequenceratio maximization

Mathematics Subject Classification ID

Fractional programming (90C32) Protein sequences, DNA sequences (92D20) Dynamic programming (90C39)

Recommendations

• APPROXIMATION ALGORITHMS FOR LOCAL ALIGNMENT WITH LENGTH CONSTRAINTS
• scientific article; zbMATH DE number 2086217
• Constrained sequence alignment
• Constrained sequence alignment: A general model and the hardness results
• Implementation and Application of Automata

Cited in

(7)

• Global pairwise sequence alignment through mixed-integer linear programming: a template-free approach
• Bounded-length Smith-Waterman alignment
• scientific article; zbMATH DE number 5171901 (Why is no real title available?)
• A polyhedral approach to sequence alignment problems
• APPROXIMATION ALGORITHMS FOR LOCAL ALIGNMENT WITH LENGTH CONSTRAINTS
• Constrained sequence alignment
• Constrained sequence alignment: A general model and the hardness results

This page was built for publication: Dynamic programming based approximation algorithms for sequence alignment with constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2890445)