nested

nested reconstructs full-length Long Terminal Repeat (LTR) retrotransposons from assembled eukaryotic genomes, resolving nested insertions to support analyses of transposable element dynamics and genome evolution.

Key Features:

• Greedy Recursive Algorithm: Implements a greedy recursive algorithm to mine fragmented copies and reconstruct full-length LTR retrotransposons.
• Sequence Similarity and Structure Integration: Combines sequence similarity and structural characteristics of transposable elements to improve detection of nested elements.
• Efficiency in Nested Regions: Optimized for computational efficiency and accuracy in highly nested genomic regions, enhancing recovery of full-length elements.

Scientific Applications:

• Genome Evolution Studies: Reconstructs transposable element (TE) insertion order to inform analyses of genome evolution dynamics.
• Transposon Research: Enables analysis of transposon behavior and impact on host genomes by accurately detecting nested LTR retrotransposons.

Methodology:

Applies a greedy recursive algorithm that integrates sequence similarity and structural features to mine fragmented copies of full-length LTR retrotransposons from assembled genomes and other sequence data; validated on natural and synthetic sequences and compared with existing software.