Multiple alignment of biological sequences with gap flexibility
From MaRDI portal
Publication:5096348
Recommendations
- Multiple Alignment, Communication Cost, and Graph Matching
- Local multiple alignment via subgraph enumeration
- Alignment between two multiple alignments
- A multiple alignment approach for DNA sequences based on maximum weighted path algorithms
- Multiple DNA and protein sequence alignment based on segment-to-segment comparison.
Cited in
(12)- Extending alignments with k-mismatches and -gaps
- An Ant-Based Model for Multiple Sequence Alignment
- Gaps and Runs in Syntenic Alignments
- The influence of gapped positions in multiple sequence alignments on secondary structure prediction methods
- On graph-based data structures to multiple genome alignment
- Computing the longest topological common subsequence of a symbol-wise totally ordered directed acyclic graph and a sequence
- A multiple alignment approach for DNA sequences based on maximum weighted path algorithms
- ALIGNMENT-TO-ALIGNMENT EDITING WITH “MOVE GAP” OPERATIONS
- Optimal sequence alignment allowing for long gaps
- Multiple sequence alignment using external sources of information
- A heuristic algorithm for multiple sequence alignment based on blocks
- The Multiple Sequence Alignment Problem in Biology
This page was built for publication: Multiple alignment of biological sequences with gap flexibility
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5096348)