A path selection approach to global pairwise sequence alignment using integer linear optimization†

DOI10.1080/02331930701778940zbMATH Open1144.90452OpenAlexW1968330913MaRDI QIDQ5449013FDOQ5449013

Authors: Scott R. McAllister, Rohit Rajgaria, Christodoulos A. Floudas 

Publication date: 10 March 2008

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331930701778940

Recommendations

• Global pairwise sequence alignment through mixed-integer linear programming: a template-free approach
• An optimization approach to multiple sequence alignment
• Algorithms for path-constrained sequence alignment
• Optimal sequence alignment using affine gap costs
• scientific article; zbMATH DE number 2243390
• A polyhedral approach to sequence alignment problems
• Optimal alignments of longest common subsequences and their path properties
• A bit-parallel, general integer-scoring sequence alignment algorithm
• A New Dynamic Programming Algorithm for Multiple Sequence Alignment

zbMATH Keywords

sequence alignmentinteger linear optimizationglobal pairwise alignmentrank-order list of alignments

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20) Combinatorial optimization (90C27) Dynamic programming (90C39) Integer programming (90C10) Computational methods for problems pertaining to biology (92-08)

Cites Work

• Title not available (Why is that?)
• Multiple DNA and protein sequence alignment based on segment-to-segment comparison.
• Global pairwise sequence alignment through mixed-integer linear programming: a template-free approach

Cited In (1)

• Global pairwise sequence alignment through mixed-integer linear programming: a template-free approach

Uses Software

• CPLEX

This page was built for publication: A path selection approach to global pairwise sequence alignment using integer linear optimization†

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