scientific article; zbMATH DE number 1796955

MaRDI QIDQ4551349zbMATH OpenFDO

Authors Bodo Siebert

Publication date 5 September 2002

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2108/21080075

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computational methods for problems pertaining to biology (92-08)

Recommendations

• Non-approximability of weighted multiple sequence alignment for arbitrary metrics
• Non-approximability of weighted multiple sequence alignment.
• Approximation algorithms for multiple sequence alignment
• An algorithm and applications to sequence alignment with weighted constraints
• Computational and Information Science
• Approximation algorithms for multiple sequence alignment under a fixed evolutionary tree
• On the complexity of constrained sequences alignment problems
• Hardness of approximation for non-overlapping local alignments.
• An optimization approach to multiple sequence alignment
• On the number of many-to-many alignments of multiple sequences

Cited in

(4)

• Non-approximability of weighted multiple sequence alignment for arbitrary metrics
• Non-approximability of weighted multiple sequence alignment.
• Fixed topology alignment with recombination
• Hardness and approximation of multiple sequence alignment with column score

This page was built for publication:

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