The maximum weight trace alignment merging problem

DOI10.1007/978-3-030-74432-8_12MaRDI QIDQ2062010zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 21 December 2021

Full work available at URL https://doi.org/10.1007/978-3-030-74432-8_12

zbMATH Keywords

clusteringmaximum weight tracemultiple sequence alignment

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20) Computational methods for problems pertaining to biology (92-08)

Recommendations

• New formulations of the multiple sequence alignment problem
• A multiple alignment approach for DNA sequences based on maximum weighted path algorithms
• Novel evolutionary models and applications to sequence alignment problems
• An approximation algorithm for alignment of multiple sequences using motif discovery
• Non-approximability of weighted multiple sequence alignment for arbitrary metrics

Cites work

• A polyhedral approach to sequence alignment problems
• On the shortest spanning subtree of a graph and the traveling salesman problem
• The implicit hitting set approach to solve combinatorial optimization problems with an application to multigenome alignment

Describes a project that uses

Uses Software

• GitHub

This page was built for publication: The maximum weight trace alignment merging problem

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