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

DOI10.1007/978-3-540-73545-8_17zbMATH Open1175.68569OpenAlexW2125569134WikidataQ56994108 ScholiaQ56994108MaRDI QIDQ3608841FDOQ3608841

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)

Cited In (1)

• 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)