Get started
Keyword

breakpoint graph

Description: A graph representation of genome rearrangements that encodes adjacencies between genomic segments for comparative genomics and computational analysis.
Wikidata ID: wiki/Q25305045
OpenAlex ID: keywords/breakpoint-graph
Efficient sorting of genomic permutations by translocation, inversion and block interchange
2005 · S. Yancopoulos, O. Attie, et al. · Computer applications in the biosciences · 501
PDF
Genome Rearrangements in Mammalian Evolution: Lessons From Human and Mouse Genomes
2002 · Pavel Pevzner, Glenn Tesler · Genome Research · 372
PDF
Sorting Permutations by Reversals and Eulerian Cycle Decompositions
1999 · Alberto Caprara · SIAM Journal on Discrete Mathematics · 229
1.375-Approximation Algorithm for Sorting by Reversals
2002 · Piotr Berman, Sridhar Hannenhalli, et al. · Lecture notes in computer science · 156
Breakpoint graphs and ancestral genome reconstructions
2009 · Max A. Alekseyev, Pavel A. Pevzner · Genome Research · 142
PDF
AmpliconReconstructor integrates NGS and optical mapping to resolve the complex structures of focal amplifications
2020 · Jens Luebeck, Ceyda Coruh, et al. · Nature Communications · 93
PDF
Computational Life Sciences
2005 · Michael R. Berthold, Robert C. Glen, et al. · Lecture notes in computer science · 86
nFuse: Discovery of complex genomic rearrangements in cancer using high-throughput sequencing
2012 · Andrew McPherson, Chunxiao Wu, et al. · Genome Research · 71
PDF
Colored de Bruijn Graphs and the Genome Halving Problem
2007 · Max Alekseyev, Pavel Pevzner · IEEE Transactions on Computational Biology and Bioinformatics · 44
PDF
Detection and analysis of ancient segmental duplications in mammalian genomes
2018 · Lianrong Pu, Yu Lin, et al. · Genome Research · 42
PDF
A Fast and Exact Algorithm for the Median of Three Problem: A Graph Decomposition Approach
2009 · Andrew Wei Xu · Journal of Computational Biology · 40
Severus detects somatic structural variation and complex rearrangements in cancer genomes using long-read sequencing
2025 · Ayse G. Keskus, Asher Bryant, et al. · Nature Biotechnology · 39
CoRAL accurately resolves extrachromosomal DNA genome structures with long-read sequencing
2024 · Kaiyuan Zhu, Matthew G. Jones, et al. · Genome Research · 38
PDF
DCJ-Indel sorting revisited
2013 · Phillip EC Compeau · Algorithms for Molecular Biology · 37
PDF
The Signal in the Genomes
2006 · David Sankoff · PLoS Computational Biology · 34
PDF
Reconstructing extrachromosomal DNA structural heterogeneity from long-read sequencing data using Decoil
2024 · Mădălina Giurgiu, Nadine Wittstruck, et al. · Genome Research · 28
PDF
What is the difference between the breakpoint graph and the de Bruijn graph?
2014 · Yu Lin, Sergey Nurk, et al. · BMC Genomics · 26
PDF
Sorting by Reversals, Generalized Transpositions, and Translocations Using Permutation Groups
2010 · Yen-Lin Huang, Chin Lung Lu · Journal of Computational Biology · 26
Hurdles Hardly Have to Be Heeded
2008 · Krister M. Swenson, Yu Lin, et al. · Lecture notes in computer science · 21
Reducibility of gene patterns in ciliates using the breakpoint graph
2006 · Robert Brijder, Hendrik Jan Hoogeboom, et al. · Theoretical Computer Science · 20
PDF
Approximating the double-cut-and-join distance between unsigned genomes
2011 · Xin Chen, Ruimin Sun, et al. · BMC Bioinformatics · 19
PDF
Moments of genome evolution by Double Cut-and-Join
2015 · Priscila Biller, Laurent Guéguen, et al. · BMC Bioinformatics · 18
PDF
Cactus Graphs for Genome Comparisons
2010 · Benedict Paten, Mark Diekhans, et al. · Lecture notes in computer science · 18
The distribution of cycles in breakpoint graphs of signed permutations
2013 · Simona Grusea, Anthony Labarre · Discrete Applied Mathematics · 15
Ordering Partially Assembled Genomes Using Gene Arrangements
2006 · Éric Gaul, Mathieu Blanchette · Lecture notes in computer science · 15
Works count: 124
Citation count: 2,317
Year
Topic
Type