2018
DOI: 10.1101/gr.228718.117
|View full text |Cite
|
Sign up to set email alerts
|

Detection and analysis of ancient segmental duplications in mammalian genomes

Abstract: Although segmental duplications (SDs) represent hotbeds for genomic rearrangements and emergence of new genes, there are still no easy-to-use tools for identifying SDs. Moreover, while most previous studies focused on recently emerged SDs, detection of ancient SDs remains an open problem. We developed an SDquest algorithm for SD finding and applied it to analyzing SDs in human, gorilla, and mouse genomes. Our results demonstrate that previous studies missed many SDs in these genomes and show that SDs account f… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

1
44
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
4
1
1

Relationship

1
5

Authors

Journals

citations
Cited by 40 publications
(46 citation statements)
references
References 37 publications
1
44
0
Order By: Relevance
“…Since there are no sources and sinks in the complex subgraph (otherwise, a source or a sink vertex would be semi-complex), each connected component of the complex subgraph contains a directed cycle. Such connected components represent the most complex mosaic repeats (referred to as cyclorepeats ) such as ultralong tandem repeats or cyclic segmental duplications analyzed in Pu et al, 2018. With the exception of the recently proposed algorithm for assembling centromeres , existing repeat resolution tools (including mosaicFlye) are unable to resolve cyclorepeats.…”
Section: Figure 1 a Genome (Top Left) Its Repeat Graph (Top Right)mentioning
confidence: 99%
See 4 more Smart Citations
“…Since there are no sources and sinks in the complex subgraph (otherwise, a source or a sink vertex would be semi-complex), each connected component of the complex subgraph contains a directed cycle. Such connected components represent the most complex mosaic repeats (referred to as cyclorepeats ) such as ultralong tandem repeats or cyclic segmental duplications analyzed in Pu et al, 2018. With the exception of the recently proposed algorithm for assembling centromeres , existing repeat resolution tools (including mosaicFlye) are unable to resolve cyclorepeats.…”
Section: Figure 1 a Genome (Top Left) Its Repeat Graph (Top Right)mentioning
confidence: 99%
“…We will first consider the case when the set Fitting ( Read, Genome ) includes only two alignments A 1 and A 2 . Repeats in a genome accumulate mutations and result in divergent repeat copies, e.g., most segmental duplications in the human genome diverge by more than 1% (Pu et al, 2018). As a result, the correct alignment of a read (to a repeat copy that it originated from) typically has a larger percent identity than the alignment of the same read to an incorrect repeat copy.…”
Section: Appendix: Alignment Tournamentmentioning
confidence: 99%
See 3 more Smart Citations