Alignment with non-overlapping inversions on two strings
From MaRDI portal
Publication:5746263
DOI10.1007/978-3-319-04657-0_25zbMATH Open1310.68266OpenAlexW2155536594MaRDI QIDQ5746263FDOQ5746263
Authors: Da-Jung Cho, Yo-Sub Han, Hwee Kim 
Publication date: 18 February 2014
Published in: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-04657-0_25
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
- Alignments with Non-overlapping Moves, Inversions and Tandem Duplications in O(n 4) Time
- An efficient algorithm for computing non-overlapping inversion and transposition distance
- 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
- A sparse dynamic programming algorithm for alignment with non-overlapping inversions
- Alignment with non-overlapping inversions and translocations on two strings
- Non-overlapping inversion on strings and languages
- 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)
