A space-efficient algorithm for sequence alignment with inversions and reversals
From MaRDI portal
Recommendations
- A Space Efficient Algorithm for Sequence Alignment with Inversions
- A local algorithm for DNA sequence alignment with inversions
- A sparse dynamic programming algorithm for alignment with non-overlapping inversions
- Alignments with Non-overlapping Moves, Inversions and Tandem Duplications in O(n 4) Time
- Alignments with non-overlapping moves, inversions and tandem duplications in \(O(n^{4})\) time
Cites work
Cited in
(17)- Alignments with non-overlapping moves, inversions and tandem duplications in \(O(n^{4})\) time
- A local algorithm for DNA sequence alignment with inversions
- Block reversal on finite words
- Alignment with non-overlapping inversions and translocations on two strings
- Efficient matching of biological sequences allowing for non-overlapping inversions
- An improved algorithm for sequence comparison with block reversals
- A Space Efficient Algorithm for Sequence Alignment with Inversions
- General space-efficient sampling algorithm for suboptimal alignment
- Alignments with Non-overlapping Moves, Inversions and Tandem Duplications in O(n 4) Time
- Efficient string-matching allowing for non-overlapping inversions
- Non-overlapping inversion on strings and languages
- An efficient algorithm to detect common ancestor genes for non-overlapping inversion and applications
- An efficient algorithm for sequence comparison with block reversals
- Rich words in the block reversal of a word
- Sequence searching allowing for non-overlapping adjacent unbalanced translocations
- A space efficient algorithm for finding the best nonoverlapping alignment score
- Efficient algorithms for computing the edit distance with non-overlapping inversions
This page was built for publication: A space-efficient algorithm for sequence alignment with inversions and reversals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1884840)