Alignments with Non-overlapping Moves, Inversions and Tandem Duplications in O(n 4) Time

DOI10.1007/978-3-540-73545-8_17MaRDI QIDQ3608841zbMATH OpenOpenAlexWikidataFDO

Authors Christian Ledergerber, Christophe Dessimoz

Publication date 6 March 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-73545-8_17

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20) Analysis of algorithms and problem complexity (68Q25) Dynamic programming (90C39) Algorithms on strings (68W32)

Recommendations

• Alignments with non-overlapping moves, inversions and tandem duplications in \(O(n^{4})\) time
• A sparse dynamic programming algorithm for alignment with non-overlapping inversions
• Alignment with non-overlapping inversions on two strings
• Alignment with non-overlapping inversions and translocations on two strings
• A space-efficient algorithm for sequence alignment with inversions and reversals

Cited in

(6)

• Alignment with non-overlapping inversions on two strings
• A space-efficient algorithm for sequence alignment with inversions and reversals
• Alignments with non-overlapping moves, inversions and tandem duplications in \(O(n^{4})\) time
• A sparse dynamic programming algorithm for alignment with non-overlapping inversions
• Alignment with non-overlapping inversions and translocations on two strings
• Sequence Alignment Algorithms for Run-Length-Encoded Strings

This page was built for publication: Alignments with Non-overlapping Moves, Inversions and Tandem Duplications in O(n 4) Time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3608841)