A sparse dynamic programming algorithm for alignment with non-overlapping inversions
RAIRO-Theor. Inf. Appl., 39 1 (2005) 175-189
Published online: 2005-03-15
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
Computing Nonoverlapping Inversion Distance Between Two Strings in Linear Average Time
Xiaodong Wang and Lei WangJournal of Computational Biology 26 (3) 193 (2019)
https://doi.org/10.1089/cmb.2018.0136
Evolution of small inversions in chloroplast genome: a case study from a recurrent inversion in angiosperms
Santiago Andrés Catalano, Beatriz Ofelia Saidman and Juan César VilardiCladistics 25 (1) 93 (2009)
https://doi.org/10.1111/j.1096-0031.2008.00236.x
Alignments with non-overlapping moves, inversions and tandem duplications in O(n 4) time
Christian Ledergerber and Christophe DessimozJournal of Combinatorial Optimization 16 (3) 263 (2008)
https://doi.org/10.1007/s10878-007-9132-y
Computing and Combinatorics
Christian Ledergerber and Christophe DessimozLecture Notes in Computer Science, Computing and Combinatorics 4598 151 (2007)
https://doi.org/10.1007/978-3-540-73545-8_17
Algorithms in Bioinformatics
Augusto F. Vellozo, Carlos E. R. Alves and Alair Pereira do LagoLecture Notes in Computer Science, Algorithms in Bioinformatics 4175 186 (2006)
https://doi.org/10.1007/11851561_18