A space-efficient algorithm for sequence alignment with inversions and reversals
From MaRDI portal
Publication:1884840
DOI10.1016/j.tcs.2004.02.040zbMath1067.90156OpenAlexW2021295875MaRDI QIDQ1884840
Junfeng Wu, Zhi-Zhong Chen, Robert Niewiadomski, Yong Gao, Yang Wang, Guo-Hui Lin
Publication date: 27 October 2004
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2004.02.040
Related Items (7)
Efficient string-matching allowing for non-overlapping inversions ⋮ Rich words in the block reversal of a word ⋮ Non-overlapping inversion on strings and languages ⋮ Efficient Matching of Biological Sequences Allowing for Non-overlapping Inversions ⋮ Block reversal on finite words ⋮ Alignments with non-overlapping moves, inversions and tandem duplications in \(O(n^{4})\) time ⋮ Alignment with non-overlapping inversions and translocations on two strings
Cites Work
This page was built for publication: A space-efficient algorithm for sequence alignment with inversions and reversals
