Improving the divide-and-conquer approach to sum-of-pairs multiple sequence alignment

DOI10.1016/S0893-9659(97)00013-XzbMATH Open0888.90129MaRDI QIDQ1372235FDOQ1372235

Authors: J. Ning 

Publication date: 14 December 1997

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Recommendations

• Approximation algorithms for multiple sequence alignment
• The Multiple Sequence Alignment Problem in Biology
• Multiple Sequence Alignment by Ant Colony Optimization and Divide-and-Conquer
• A New Dynamic Programming Algorithm for Multiple Sequence Alignment

zbMATH Keywords

computational molecular biologydivide-and-conquermultiple sequence alignment

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Protein sequences, DNA sequences (92D20) Combinatorial optimization (90C27) Dynamic programming (90C39)

Cites Work

• Efficient methods for multiple sequence alignment with guaranteed error bounds
• Title not available (Why is that?)
• The Multiple Sequence Alignment Problem in Biology

Cited In (4)

• Weighted sequence graphs: Boosting iterated dynamic programming using locally suboptimal solutions
• An application of raw sets to scoring function on \(n\)-dimensional space
• Two applications of the divide \(\&\) conquer principle in the molecular sciences
• Multiple Sequence Alignment by Ant Colony Optimization and Divide-and-Conquer

Uses Software

• ClustalW

This page was built for publication: Improving the divide-and-conquer approach to sum-of-pairs multiple sequence alignment

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