Alignment with non-overlapping inversions on two strings
From MaRDI portal
Publication:5746263
Recommendations
- Alignment with non-overlapping inversions and translocations on two strings
- A sparse dynamic programming algorithm for alignment with non-overlapping inversions
- Efficient matching of biological sequences allowing for non-overlapping inversions
- Efficient string-matching allowing for non-overlapping inversions
- Alignments with Non-overlapping Moves, Inversions and Tandem Duplications in O(n 4) Time
Cited in
(12)- Frequent pattern mining with non-overlapping inversions
- A local algorithm for DNA sequence alignment with inversions
- Block reversal on finite words
- An efficient algorithm for computing non-overlapping inversion and transposition distance
- Alignments with Non-overlapping Moves, Inversions and Tandem Duplications in O(n 4) Time
- Efficient matching of biological sequences allowing for non-overlapping inversions
- Alignments with non-overlapping moves, inversions and tandem duplications in \(O(n^{4})\) time
- Two-string consensus problem under non-overlapping inversion and transposition distance
- Non-overlapping inversion on strings and languages
- 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
This page was built for publication: Alignment with non-overlapping inversions on two strings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5746263)