TY - GEN
T1 - Reconstructing the Duplication History of a Tandem Repeat
AU - Benson, Gary
AU - Dong, Lan
N1 - Publisher Copyright:
Copyright © 1999 American Association for Artificial Intelligence (www.aaai.org). All rights reserved.
PY - 1999
Y1 - 1999
N2 - One of the less well understood mutational transformations that act upon DNA is tandem duplication. In this process, a stretch of DNA is duplicated to produce two or more adjacent copies, resulting in a tandem repeat. Over time, the copies undergo additional mutations so that typically, multiple approximate tandem copies are present. An interesting feature of tandem repeats is that the duplicated copies are preserved together, making it possible to do ''phylogenetic analysis" on a single sequence. This involves using the pattern of mutations among the copies to determine a minimal or a most likely history for the repeat. A history tries to describe the interwoven pattern of substitutions, indels, and duplication events in such a way as to minimize the number of identical mutations that arise independently. Because the copies arc adjacent and ordered, the history problem can not be solved by standard phylogeny algorithms. In this paper, we introduce several versions of the tandem repeat history problem, develop algorithmic solutions and evaluate their performance. We also develop ways to visualize important features of a history with the goal of discovering properties of the duplication mechanism.
AB - One of the less well understood mutational transformations that act upon DNA is tandem duplication. In this process, a stretch of DNA is duplicated to produce two or more adjacent copies, resulting in a tandem repeat. Over time, the copies undergo additional mutations so that typically, multiple approximate tandem copies are present. An interesting feature of tandem repeats is that the duplicated copies are preserved together, making it possible to do ''phylogenetic analysis" on a single sequence. This involves using the pattern of mutations among the copies to determine a minimal or a most likely history for the repeat. A history tries to describe the interwoven pattern of substitutions, indels, and duplication events in such a way as to minimize the number of identical mutations that arise independently. Because the copies arc adjacent and ordered, the history problem can not be solved by standard phylogeny algorithms. In this paper, we introduce several versions of the tandem repeat history problem, develop algorithmic solutions and evaluate their performance. We also develop ways to visualize important features of a history with the goal of discovering properties of the duplication mechanism.
KW - phylogeny algorithms
KW - tandem repeats
UR - https://www.scopus.com/pages/publications/0033288057
M3 - Conference contribution
C2 - 10786285
AN - SCOPUS:0033288057
T3 - Proceedings of the 7th International Conference on Intelligent Systems for Molecular Biology, ISMB 1999
SP - 44
EP - 53
BT - Proceedings of the 7th International Conference on Intelligent Systems for Molecular Biology, ISMB 1999 was held incooperation with the American Association for Artificial Intelligence, AAAI 1999
PB - AAAI Press
T2 - 7th International Conference on Intelligent Systems for Molecular Biology, ISMB 1999 was held incooperation with the American Association for Artificial Intelligence, AAAI 1999
Y2 - 6 August 1999 through 10 August 1999
ER -