Identifying Repeat Domains in Large Genomes

 
Thumbnail
View/Open
Author
Zhi, Degui
Raphael, Benjamin J
Tang, Haixu
Pevzner, Pavel A
Published Version
https://doi.org/10.1186/gb-2006-7-1-r7
Metadata
Show full item record
Citation
Zhi, Degui, Benjamin J. Raphael, Alkes L. Price, Haixu Tang, and Pavel A. Pevzner. 2006. Identifying repeat domains in large genomes. Genome Biology 7(1): R7.
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.
Other Sources
http://www.ncbi.nlm.nih.gov/pmc/articles/PMC1431705/pdf/
Terms of Use
This article is made available under the terms and conditions applicable to Other Posted Material, as set forth at http://nrs.harvard.edu/urn-3:HUL.InstRepos:dash.current.terms-of-use#LAA
Citable link to this page
http://nrs.harvard.edu/urn-3:HUL.InstRepos:4578516

Collections