Non-approximability of weighted multiple sequence alignment for arbitrary metrics

DOI10.1016/J.IPL.2005.04.010MaRDI QIDQ1041795zbMATH OpenOpenAlexFDO

Authors Bodo Manthey

Publication date 4 December 2009

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2005.04.010

zbMATH Keywords

algorithmscomputational biologymultiple sequence alignmentapproximation hardnesssum-of-pairs score

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Nonnumerical algorithms (68W05)

Recommendations

• scientific article; zbMATH DE number 1796955
• Non-approximability of weighted multiple sequence alignment.
• Approximation algorithms for multiple sequence alignment
• An algorithm and applications to sequence alignment with weighted constraints
• Weighted measures based on maximizing deviation for alignment-free sequence comparison
• 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.
• Computational and Information Science
• The complexity of multiple sequence alignment with SP-score that is a metric

Cites work

• scientific article; zbMATH DE number 1330033 (Why is no real title available?)
• scientific article; zbMATH DE number 1557065 (Why is no real title available?)
• A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees
• A tight bound on approximating arbitrary metrics by tree metrics
• Algorithms and Computation
• Approximation algorithms for multiple sequence alignment
• Non-approximability of weighted multiple sequence alignment.
• Optimization, approximation, and complexity classes

Cited in

(9)

• Fixed topology alignment with recombination
• Algorithms and Computation
• Hardness of approximation for non-overlapping local alignments.
• Inapproximability of maximal strip recovery
• scientific article; zbMATH DE number 1796955 (Why is no real title available?)
• Adaptation of the method of musical composition for solving the multiple sequence alignment problem
• The complexity of multiple sequence alignment with SP-score that is a metric
• The maximum weight trace alignment merging problem
• Non-approximability of weighted multiple sequence alignment.

This page was built for publication: Non-approximability of weighted multiple sequence alignment for arbitrary metrics

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