Identifying repeat domains in large genomes

32Citations
Citations of this article
96Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We present a graph-based method for the analysis of repeat families in a repeat library. We build a repeat domain graph that decomposes a repeat library into repeat domains, short subsequences shared by multiple repeat families, and reveals the mosaic structure of repeat families. Our method recovers documented mosaic repeat structures and suggests additional putative ones. Our method is useful for elucidating the evolutionary history of repeats and annotating de novo generated repeat libraries. © 2006 Zhi et al.; licensee BioMed Central Ltd.

Cite

CITATION STYLE

APA

Zhi, D., Raphael, B. J., Price, A. L., Tang, H., & Pevzner, P. A. (2006). Identifying repeat domains in large genomes. Genome Biology, 7(1). https://doi.org/10.1186/gb-2006-7-1-r7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free