## Abstract

Motivation: Segmental duplications >1 kb in length with ≥90% sequence identity between copies comprise nearly 5% of the human genome. They are frequently found in large, contiguous regions known as duplication blocks that can contain mosaic patterns of thousands of segmental duplications. Reconstructing the evolutionary history of these complex genomic regions is a non-trivial, but important task. Results: We introduce parsimony and likelihood techniques to analyze the evolutionary relationships between duplication blocks. Both techniques rely on a generic model of duplication in which long, contiguous substrings are copied and reinserted over large physical distances, allowing for a duplication block to be constructed by aggregating substrings of other blocks. For the likelihood method, we give an efficient dynamic programming algorithm to compute the weighted ensemble of all duplication scenarios that account for the construction of a duplication block. Using this ensemble, we derive the probabilities of various duplication scenarios.We formalize the task of reconstructing the evolutionary history of segmental duplications as an optimization problem on the space of directed acyclic graphs. We use a simulated annealing heuristic to solve the problem for a set of segmental duplications in the human genome in both parsimony and likelihood settings.

Original language | English (US) |
---|---|

Article number | btq368 |

Pages (from-to) | i446-i452 |

Journal | Bioinformatics |

Volume | 26 |

Issue number | 18 |

DOIs | |

State | Published - Sep 4 2010 |

Externally published | Yes |

## All Science Journal Classification (ASJC) codes

- Computational Mathematics
- Molecular Biology
- Biochemistry
- Statistics and Probability
- Computer Science Applications
- Computational Theory and Mathematics