Alignment between two multiple alignments
From MaRDI portal
Publication:3550840
DOI10.1007/3-540-44888-8_19zbMATH Open1279.68372OpenAlexW1519416322MaRDI QIDQ3550840FDOQ3550840
Authors: Bin Ma, Zhuozhi Wang, Kaizhong Zhang
Publication date: 6 April 2010
Published in: Combinatorial Pattern Matching (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-44888-8_19
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)
- Alignment and distribution is not (always) NP-hard
- Partially local multi-way alignments
- Multiple sequence alignment as a facility-location problem
- Alignment correspondences
- Algorithmic properties of ciliate sequence alignment
- Algorithms and Computation
- Title not available (Why is that?)
- Optimal sequence alignment using affine gap costs
- Multiple alignment of biological sequences with gap flexibility
- Complexity of biological sequence alignment
- Near optimal multiple alignment within a band in polynomial time
- Optimal global alignment of signals by maximization of Pearson correlation
- ALIGNMENT-TO-ALIGNMENT EDITING WITH “MOVE GAP” OPERATIONS
- Non-approximability of weighted multiple sequence alignment.
- Research in Computational Molecular Biology
- Compositional properties of alignments
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)