Alignment between two multiple alignments
From MaRDI portal
Publication:3550840
Recommendations
- ALIGNMENT-TO-ALIGNMENT EDITING WITH “MOVE GAP” OPERATIONS
- The complexity of multiple sequence alignment with SP-score that is a metric
- Multiple sequence alignment as a facility-location problem
- Multiple Alignment, Communication Cost, and Graph Matching
- Approximation algorithms for multiple sequence alignment
Cited in
(16)- Multiple sequence alignment as a facility-location problem
- ALIGNMENT-TO-ALIGNMENT EDITING WITH “MOVE GAP” OPERATIONS
- Optimal global alignment of signals by maximization of Pearson correlation
- Alignment and distribution is not (always) NP-hard
- Partially local multi-way alignments
- Complexity of biological sequence alignment
- Non-approximability of weighted multiple sequence alignment.
- Optimal sequence alignment using affine gap costs
- Compositional properties of alignments
- Alignment correspondences
- Algorithmic properties of ciliate sequence alignment
- scientific article; zbMATH DE number 910858 (Why is no real title available?)
- Near optimal multiple alignment within a band in polynomial time
- Algorithms and Computation
- Multiple alignment of biological sequences with gap flexibility
- Research in Computational Molecular Biology
This page was built for publication: Alignment between two multiple alignments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3550840)