The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Multiple Genome Rearrangement and Breakpoint Phylogeny
Abstract
Multiple alignment of macromolecular sequences generalizes from N = 2 to N > or = 3 the comparison of N sequences which have diverged through the local processes of insertion, deletion and substitution. Gene-order sequences diverge through non-local genome rearrangement processes such as inversion (or reversal) and transposition. In this paper we show which formulations of multiple alignment have counterparts in multiple rearrangement. Based on difficulties inherent in rearrangement edit-distance calculation and interpretation, we argue for the simpler "breakpoint analysis." Consensus-based multiple rearrangement of N > or = 3 orders can be solved exactly through reduction to instances of the Travelling Salesman Problem (TSP). We propose a branch-and-bound solution to TSP particularly suited to these instances. Simulations show how non-uniqueness of the solution is attenuated with increasing numbers of data genomes. Tree-based multiple alignment can be achieved to a great degree of accuracy by decomposing the tree into a number of overlapping 3-stars centered on the non-terminal nodes, and solving the consensus-based problem iteratively for these nodes until convergence. Accuracy improves with very careful initializations at the non-terminal nodes. The degree of non-uniqueness of solutions depends on the position of the node in the tree in terms of path length to the terminal vertices.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Introduction to Computational Biology
Waterman, M. S. (1995) · Springer eBooks · doi:10.1007/978-1-4899-6846-3 · Cited by 960
Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals
Hannenhalli, S. S., & Pevzner, P. A. (1999) · Journal of the ACM · doi:10.1145/300515.300516 · Cited by 695
Introduction to Computational Molecular Biology
Setúbal, J. C., & Meidânis, J. (1997) · Cited by 673
Gene order comparisons for phylogenetic inference: evolution of the mitochondrial genome.
Sankoff, D., Leduc, G., Antoine, N., Paquin, B., Lang, B. F., & Cedergren, R. (1992) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.89.14.6575 · Cited by 421
Self-citationTransforming 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
Boore, J. L., & Brown, W. M. (2000) · Molecular Biology and Evolution · doi:10.1093/oxfordjournals.molbev.a026241 · Cited by 324
Parametric genome rearrangement
Blanchette, M., Kunisawa, T., & Sankoff, D. (1996) · Gene · doi:10.1016/0378-1119(95)00878-0 · Cited by 162
Self-citationFrequency of insertion-deletion, transversion, and transition in the evolution of 5S ribosomal RNA
Sankoff, D., Cedergren, R., & Lapalme, G. (1976) · Journal of Molecular Evolution · doi:10.1007/bf01732471 · Cited by 139
Self-citationGenome Sequence Comparison and Scenarios for Gene Rearrangements: A Test Case
Hannenhalli, S. S., Chappey, C., Koonin, E. V., & Pevzner, P. A. (1995) · Genomics · doi:10.1006/geno.1995.9873 · Cited by 126
Evolution of 5S RNA and the Non-randomness of Base Replacement
Sankoff, D., MOREL, C., & Cedergren, R. (1973) · Nature New Biology · doi:10.1038/newbio245232a0 · Cited by 94
Self-citation
Cited by
Invitation to Fixed-Parameter Algorithms
Niedermeier, R. (2006) · doi:10.1093/acprof:oso/9780198566076.001.0001 · Cited by 1,668
A new sequence distance measure for phylogenetic tree construction
Otu, H. H., & Sayood, K. (2003) · Bioinformatics · doi:10.1093/bioinformatics/btg295 · Cited by 348
Mathematics of Evolution and Phylogeny
(2005) · doi:10.1093/oso/9780198566106.001.0001 · Cited by 347
Probability Models for DNA Sequence Evolution
Durrett, R. (2002) · Probability and its Applications · doi:10.1007/978-1-4757-6285-3 · Cited by 337
Boore, J. L., & Brown, W. M. (2000) · Molecular Biology and Evolution · doi:10.1093/oxfordjournals.molbev.a026241 · Cited by 324
Metadata
- Authors
- SANKOFF, D., & BLANCHETTE, M.
- Venue
- Journal of Computational Biology
- Publisher
- SAGE Publications
- Published
- 1998-01
- Volume
- 5
- Issue
- 3
- Pages
- 555-570
- ISSN
- 1066-5277 (ISSN-L)
- 1557-8666
- OpenAlex
- W2049796549
- Cited by
- 258
- References
- 13
- FWCI
- 5.31
- Type
- journal article
- Language
- en
- Open access
- closed
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: Multiple Genome Rearrangement and Breakpoint Phylogeny. https://app.cochat.ai/papers/10.1089/cmb.1998.5.555
- The paper
- SANKOFF, D., & BLANCHETTE, M. (1998). Multiple Genome Rearrangement and Breakpoint Phylogeny. Journal of Computational Biology. https://doi.org/10.1089/cmb.1998.5.555
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.