Document Open Access Logo

Avoiding Ambiguity and Assessing Uniqueness in Minisatellite Alignment

Authors Benedikt Löwes, Robert Giegerich

PDF

File

Thumbnail PDF
PDF
OASIcs.GCB.2013.110.pdf
  • Filesize: 0.62 MB
  • 15 pages

Document Identifiers

Subject Classification

Keywords
  • minisatellite alignment
  • dynamic programming
  • ambiguity

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

Several algorithms have been suggested for minisatellite alignment.
Their time complexity is high -- close to O(n^3) -- due to the necessary reconstruction of duplication histories. We investigate the uniqueness of optimal alignments computed under the common single-copy duplication model. To this extent, it is necessary to avoid ambiguity in the algorithm employed. We re-code the ARLEM algorithm in the form of a grammar, and apply a disambiguation technique which uses a mapping to a canonical representation of minisatellite alignments. Having arrived at a non-ambiguous algorithm this way, we demonstrate that the underlying model -- independent of the algorithm -- gives rise to an exorbitant number of different, co-optimal alignments when applied to real-world data. We conclude that alignment-free methods should be considered for minisatellite comparison.

Cite As Get BibTex

Benedikt Löwes and Robert Giegerich. Avoiding Ambiguity and Assessing Uniqueness in Minisatellite Alignment. In German Conference on Bioinformatics 2013. Open Access Series in Informatics (OASIcs), Volume 34, pp. 110-124, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013) https://doi.org/10.4230/OASIcs.GCB.2013.110

Author Details

Benedikt Löwes
Robert Giegerich
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact