The multiple sequence sets: Problem and heuristic algorithms

DOI10.1007/S10878-010-9329-3MaRDI QIDQ411226zbMATH OpenOpenAlexFDO

Authors Kang Ning, Hon Wai Leong

Publication date 4 April 2012

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-010-9329-3

zbMATH Keywords

performance ratioshortest common supersequencedistribution and depositionmultiple sequence setssequence features

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Recommendations

• The Multiple Sequence Alignment Problem in Biology
• scientific article; zbMATH DE number 1830949
• An approximation algorithm for alignment of multiple sequences using motif discovery
• A New Dynamic Programming Algorithm for Multiple Sequence Alignment
• Approximation algorithms for multiple sequence alignment

Cites work

• scientific article; zbMATH DE number 1950335 (Why is no real title available?)
• scientific article; zbMATH DE number 1516705 (Why is no real title available?)
• On the Approximation of Shortest Common Supersequences and Longest Common Subsequences
• Theory and algorithms for plan merging

Cited in

(1)

• EFFICIENT ALGORITHMS FOR DEGENERATE PRIMER SEARCH

This page was built for publication: The multiple sequence sets: Problem and heuristic algorithms

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