The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Efficient sorting of genomic permutations by translocation, inversion and block interchange
Open accessAbstract
MOTIVATION: Finding genomic distance based on gene order is a classic problem in genome rearrangements. Efficient exact algorithms for genomic distances based on inversions and/or translocations have been found but are complicated by special cases, rare in simulations and empirical data. We seek a universal operation underlying a more inclusive set of evolutionary operations and yielding a tractable genomic distance with simple mathematical form. RESULTS: We study a universal double-cut-and-join operation that accounts for inversions, translocations, fissions and fusions, but also produces circular intermediates which can be reabsorbed. The genomic distance, computable in linear time, is given by the number of breakpoints minus the number of cycles (b-c) in the comparison graph of the two genomes; the number of hurdles does not enter into it. Without changing the formula, we can replace generation and re-absorption of a circular intermediate by a generalized transposition, equivalent to a block interchange, with weight two. Our simple algorithm converts one multi-linear chromosome genome to another in the minimum distance.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Evolution's cauldron: Duplication, deletion, and rearrangement in the mouse and human genomes
Kent, W. J., Baertsch, R., Hinrichs, A., Miller, W., & Haussler, D. (2003) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1932072100 · Cited by 850
Transforming cabbage into turnip
Hannenhalli, S. S., & Pevzner, P. A. (1999) · Journal of the ACM · doi:10.1145/300515.300516 · Cited by 647
Transforming men into mice (polynomial algorithm for genomic distance problem)
Hannenhalli, S., & Pevzner, P. A. (2002) · Proceedings of IEEE 36th Annual Foundations of Computer Science · doi:10.1109/sfcs.1995.492588 · Cited by 327
Sturtevant, A. H., & Dobzhansky, T. (1936) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.22.7.448 · Cited by 208
The chromosome inversion problem
Watterson, G. A., Ewens, W. J., Hall, T. E., & Morgan, A. (1982) · Journal of Theoretical Biology · doi:10.1016/0022-5193(82)90384-8 · Cited by 200
Efficient algorithms for multichromosomal genome rearrangements
Tesler, G. (2002) · Journal of Computer and System Sciences · doi:10.1016/s0022-0000(02)00011-9 · Cited by 164
Parametric genome rearrangement
Blanchette, M., Kunisawa, T., & Sankoff, D. (1996) · Gene · doi:10.1016/0378-1119(95)00878-0 · Cited by 147
Qiu, W., Schutzer, S. E., Bruno, J. F., Attie, O., Xu, Y., Dunn, J. J., Fraser, C. M., Casjens, S., & Luft, B. J. (2004) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0402745101 · Cited by 128
Self-citationReconstructing tumor amplisomes
Raphael, B. J., & Pevzner, P. A. (2004) · Bioinformatics · doi:10.1093/bioinformatics/bth931 · Cited by 33
Mobile Elements in Animal and Plant Genomes
Deininger, P. L., & Roy‐Engel, A. M. (2007) · Wiley eBooks · doi:10.1128/9781555817954.ch47 · Cited by 25
Cited by
progressiveMauve: Multiple Genome Alignment with Gene Gain, Loss and Rearrangement
Darling, A. E., Mau, B., & Perna, N. T. (2010) · PLoS ONE · doi:10.1371/journal.pone.0011147 · Cited by 3,848
Exploring the landscape of focal amplifications in cancer using AmpliconArchitect
Deshpande, V., Luebeck, J., Nguyen, N.-P. D., Bakhtiari, M., Turner, K. M., Schwab, R., Carter, H., Mischel, P. S., & Bafna, V. (2019) · Nature Communications · doi:10.1038/s41467-018-08200-y · Cited by 356
A Unifying View of Genome Rearrangements
Bergeron, A., Mixtacki, J., & Stoye, J. (2006) · Lecture Notes in Computer Science · doi:10.1007/11851561_16 · Cited by 298
Whole-genome microsynteny-based phylogeny of angiosperms
Zhao, T., Zwaenepoel, A., Xue, J.-Y., Kao, S.-M., Li, Z., Schranz, M. E., & Van de Peer, Y. (2021) · Nature Communications · doi:10.1038/s41467-021-23665-0 · Cited by 117
Cactus Graphs for Genome Comparisons
Paten, B., Diekhans, M., Earl, D., John, J. S., Ma, J., Suh, B., & Haussler, D. (2011) · Journal of Computational Biology · doi:10.1089/cmb.2010.0252 · Cited by 102
Metadata
- Authors
- Yancopoulos, S., Attie, O., & Friedberg, R.
- Venue
- Bioinformatics
- Publisher
- Oxford University Press (OUP)
- Published
- 2005-06-09
- Volume
- 21
- Issue
- 16
- Pages
- 3340-3346
- ISSN
- 0266-7061 (ISSN-L)
- 1367-4803
- 1460-2059
- OpenAlex
- W2149628296
- Cited by
- 501
- References
- 10
- FWCI
- 10.92
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Efficient sorting of genomic permutations by translocation, inversion and block interchange. https://app.cochat.ai/papers/10.1093/bioinformatics/bti535
- The paper
- Yancopoulos, S., Attie, O., & Friedberg, R. (2005). Efficient sorting of genomic permutations by translocation, inversion and block interchange. Bioinformatics. https://doi.org/10.1093/bioinformatics/bti535
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.