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

DOI10.1016/S0893-9659(97)00013-XzbMath0888.90129MaRDI QIDQ1372235

J. Ning

Publication date: 14 December 1997

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

zbMATH Keywords

multiple sequence alignmentcomputational molecular biologydivide-and-conquer

Mathematics Subject Classification ID

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

Related Items (2)

Two applications of the divide \(\&\) conquer principle in the molecular sciences ⋮ Weighted sequence graphs: Boosting iterated dynamic programming using locally suboptimal solutions

Uses Software

• ClustalW

Cites Work

• Efficient methods for multiple sequence alignment with guaranteed error bounds
• The Multiple Sequence Alignment Problem in Biology
• Unnamed Item

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