Skip to main content

An algorithm for finding substantially broken repeated sequences in newly sequenced genomes

Publication ,  Conference
Singh, A; Stojanovic, N
Published in: AIP Conference Proceedings
December 1, 2007

Interspersed repeats occupy a significant fraction of many eukaryotic genomes. They result from the activity and accumulation of transposable elements, sequences which are able to replicate in virtually all organisms and which have been successfully maintained through the evolution. With the increasing availability of higher eukaryotic genomes, the identification and annotation of repeats has become an important task in genome biology and it has provoked a shift from the study of individual elements to their genome-wide distributions. In this paper we present a new method for de novo identification of repetitive segments in a genome, particularly suitable to identify these present in large copy numbers but which have diverged so much that they cannot be recognized by existing techniques, generally relying on relatively high sequence similarity between the copies. © 2008 American Institute of Physics.

Duke Scholars

Published In

AIP Conference Proceedings

DOI

EISSN

1551-7616

ISSN

0094-243X

Publication Date

December 1, 2007

Volume

971

Start / End Page

79 / 88
 

Citation

APA
Chicago
ICMJE
MLA
NLM
Singh, A., & Stojanovic, N. (2007). An algorithm for finding substantially broken repeated sequences in newly sequenced genomes. In AIP Conference Proceedings (Vol. 971, pp. 79–88). https://doi.org/10.1063/1.2883871
Singh, A., and N. Stojanovic. “An algorithm for finding substantially broken repeated sequences in newly sequenced genomes.” In AIP Conference Proceedings, 971:79–88, 2007. https://doi.org/10.1063/1.2883871.
Singh A, Stojanovic N. An algorithm for finding substantially broken repeated sequences in newly sequenced genomes. In: AIP Conference Proceedings. 2007. p. 79–88.
Singh, A., and N. Stojanovic. “An algorithm for finding substantially broken repeated sequences in newly sequenced genomes.” AIP Conference Proceedings, vol. 971, 2007, pp. 79–88. Scopus, doi:10.1063/1.2883871.
Singh A, Stojanovic N. An algorithm for finding substantially broken repeated sequences in newly sequenced genomes. AIP Conference Proceedings. 2007. p. 79–88.

Published In

AIP Conference Proceedings

DOI

EISSN

1551-7616

ISSN

0094-243X

Publication Date

December 1, 2007

Volume

971

Start / End Page

79 / 88