A Space Efficient Algorithm for Sequence Alignment with Inversions
From MaRDI portal
Publication:3082913
Recommendations
- A space-efficient algorithm for sequence alignment with inversions and reversals
- A sparse dynamic programming algorithm for alignment with non-overlapping inversions
- Implementation and Application of Automata
- A local algorithm for DNA sequence alignment with inversions
- A space efficient algorithm for finding the best nonoverlapping alignment score
- Efficient matching of biological sequences allowing for non-overlapping inversions
- scientific article; zbMATH DE number 5171901
- An efficient algorithm for sequence comparison with block reversals
- General space-efficient sampling algorithm for suboptimal alignment
Cited in
(11)- A local algorithm for DNA sequence alignment with inversions
- scientific article; zbMATH DE number 2086238 (Why is no real title available?)
- A space-efficient algorithm for sequence alignment with inversions and reversals
- An efficient algorithm for sequence comparison with block reversals
- A simple and space-efficient fragment-chaining algorithm for alignment of DNA and protein sequences
- Alignments with non-overlapping moves, inversions and tandem duplications in \(O(n^{4})\) time
- General space-efficient sampling algorithm for suboptimal alignment
- A sparse dynamic programming algorithm for alignment with non-overlapping inversions
- Alignment with non-overlapping inversions and translocations on two strings
- An efficient algorithm to detect common ancestor genes for non-overlapping inversion and applications
- A space efficient algorithm for finding the best nonoverlapping alignment score
This page was built for publication: A Space Efficient Algorithm for Sequence Alignment with Inversions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3082913)