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

Breakpoint graphs and ancestral genome reconstructions

Abstract: Recently completed whole-genome sequencing projects marked the transition from gene-based phylogenetic studies to phylogenomics analysis of entire genomes. We developed an algorithm MGRA for reconstructing ancestral genomes and used it to study the rearrangement history of seven mammalian genomes: human, chimpanzee, macaque, mouse, rat, dog, and opossum. MGRA relies on the notion of the multiple breakpoint graphs to overcome some limitations of the existing approaches to ancestral genome reconstructions. MGRA … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
132
0

Year Published

2011
2011
2024
2024

Publication Types

Select...
5
4
1

Relationship

0
10

Authors

Journals

citations
Cited by 121 publications
(132 citation statements)
references
References 75 publications
(90 reference statements)
0
132
0
Order By: Relevance
“…Despite some recent improvements in reconstruction algorithms (3,(14)(15)(16), the field has been more or less stagnant for the past decade because of the paucity of new genome assemblies suitable for ancestral reconstructions. In this paper, we introduce a method, called DESCHRAMBLER, which uses SFs constructed from whole-genome comparisons of both high-quality chromosomescale and fragmented assemblies.…”
Section: Significancementioning
confidence: 99%
“…Despite some recent improvements in reconstruction algorithms (3,(14)(15)(16), the field has been more or less stagnant for the past decade because of the paucity of new genome assemblies suitable for ancestral reconstructions. In this paper, we introduce a method, called DESCHRAMBLER, which uses SFs constructed from whole-genome comparisons of both high-quality chromosomescale and fragmented assemblies.…”
Section: Significancementioning
confidence: 99%
“…Given a set of SFs B, the SF graph is an undirected graph G = (V, E), where V = {b h , b t jb ∈ B} is the set of vertices that represents the head b h and tail b t of a SF b, and E is the set of undirected edges. The idea is analogous to the breakpoint graph that was used in genome rearrangement analysis (29,30). The edge between two SFs can be created by connecting either the head or tail vertices of each SF, which represents both the order and orientation of SFs.…”
Section: Methodsmentioning
confidence: 99%
“…For example, frameworks such as De Bruijn graphs have aided the assembly of genomes (Pevzner 2000;Zerbino and Birney 2008), and breakpoint graphs have had success in constructing rearrangement phylogeny across species, pioneered with several contributions from Sankoff and Pevzner (Sankoff and Blanchette 1999;Pevzner 2000;Bader and Ohlebusch 2007;Bader et al 2008;Alekseyev and Pevzner 2009;Warren and Sankoff 2009a,b). These methods have also been adapted to genomes containing duplications (Alekseyev and Pevzner 2007) and cancer (Raphael et al 2003;Raphael and Pevzner 2004;Ozery-Flato and Shamir 2009).…”
mentioning
confidence: 99%