The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
An information-based sequence distance and its application to whole mitochondrial genome phylogeny
Open accessAbstract
Motivation: Traditional sequence distances require an alignment and therefore are not directly applicable to the problem of whole genome phylogeny where events such as rearrangements make full length alignments impossible. We present a sequence distance that works on unaligned sequences using the information theoretical concept of Kolmogorov complexity and a program to estimate this distance. Results: We establish the mathematical foundations of our distance and illustrate its use by constructing a phylogeny of the Eutherian orders using complete unaligned mitochondrial genomes. This phylogeny is consistent with the commonly accepted one for the Eutherians. A second, larger mammalian dataset is also analyzed, yielding a phylogeny generally consistent with the commonly accepted one for the mammals. Availability: The program to estimate our sequence distance, is available at http://www.cs.cityu.edu.hk/~cssamk/gencomp/GenCompress1.htm. The distance matrices used to generate our phylogenies are available at http://www.math.uwaterloo.ca/~mli/distance.html Contact: mli@wh.math.uwaterloo.ca * To whom correspondence should be addressed.
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
The neighbor-joining method: a new method for reconstructing phylogenetic trees.
(1987) · Molecular Biology and Evolution · doi:10.1093/oxfordjournals.molbev.a040454 · Cited by 59,715
An Introduction to Kolmogorov Complexity and Its Applications
Li, M., & Vitányi, P. (2019) · Texts in Computer Science · doi:10.1007/978-3-030-11298-1 · Cited by 3,681
Self-citationAn Introduction to Kolmogorov Complexity and Its Applications
Li, M., & Vitányi, P. (1997) · Springer eBooks · doi:10.1007/978-1-4757-2606-0 · Cited by 1,775
Self-citationA simulation comparison of phylogeny algorithms under equal and unequal evolutionary rates.
(1994) · Molecular Biology and Evolution · doi:10.1093/oxfordjournals.molbev.a040126 · Cited by 824
Genome phylogeny based on gene content
Snel, B., Bork, P., & Huynen, M. A. (1999) · Nature Genetics · doi:10.1038/5052 · Cited by 716
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
Big trees from little genomes: mitochondrial gene order as a phylogenetic tool
Boore, J. L., & Brown, W. M. (1998) · Current Opinion in Genetics & Development · doi:10.1016/s0959-437x(98)80035-x · Cited by 665
MOLPHY version 2.3 : programs for molecular phylogenetics based on maximum likelihood
Adachi, J. (1996) · Cited by 604
The guinea-pig is not a rodent
D'Erchia, A. M., Gissi, C., Pesole, G., Saccone, C., & Arnason, U. (1996) · Nature · doi:10.1038/381597a0 · Cited by 353
Graur, D., Hide, W. A., & Li, W.-H. (1991) · Nature · doi:10.1038/351649a0 · Cited by 313
Cited by
HyPhy: hypothesis testing using phylogenies
Pond, S. L. K., Frost, S. D. W., & Muse, S. V. (2005) · Bioinformatics · doi:10.1093/bioinformatics/bti079 · Cited by 2,866
The Google Similarity Distance
Cilibrasi, R. L., & Vitanyi, P. M. B. (2007) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2007.48 · Cited by 1,760
Cilibrasi, R., & Vitanyi, P. M. B. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.844059 · Cited by 1,188
Li, M., Chen, X., Li, X., Ma, B., & Vitanyi, P. M. B. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.838101 · Cited by 1,062
Self-citationAlignment-free sequence comparison—a review
Vinga, S., & Almeida, J. (2003) · Bioinformatics · doi:10.1093/bioinformatics/btg005 · Cited by 804
Towards parameter-free data mining
Keogh, E., Lonardi, S., & Ratanamahatana, C. A. (2004) · Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1014052.1014077 · Cited by 567
Simplicity: a unifying principle in cognitive science?
Chater, N., & Vitányi, P. (2003) · Trends in Cognitive Sciences · doi:10.1016/s1364-6613(02)00005-0 · Cited by 494
From words to literature in structural proteomics
Sali, A., Glaeser, R., Earnest, T., & Baumeister, W. (2003) · Nature · doi:10.1038/nature01513 · Cited by 475
TSclust: An R Package for Time Series Clustering
Montero, P., & Vilar, J. A. (2014) · Journal of Statistical Software · doi:10.18637/jss.v062.i01 · Cited by 430
Alignment-free genome comparison with feature frequency profiles (FFP) and optimal resolutions
Sims, G. E., Jun, S.-R., Wu, G. A., & Kim, S.-H. (2009) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0813249106 · Cited by 400
A new sequence distance measure for phylogenetic tree construction
Otu, H. H., & Sayood, K. (2003) · Bioinformatics · doi:10.1093/bioinformatics/btg295 · Cited by 348
En route to a genome-based classification of Archaea and Bacteria?
Klenk, H.-P., & Göker, M. (2010) · Systematic and Applied Microbiology · doi:10.1016/j.syapm.2010.03.003 · Cited by 275
Hahn, U., Chater, N., & Richardson, L. B. (2003) · Cognition · doi:10.1016/s0010-0277(02)00184-1 · Cited by 258
Yoshizawa, S., Terano, T., & Yoshikawa, A. (2012) · IEEE Transactions on Professional Communication · doi:10.1109/tpc.2011.2172833 · Cited by 11
Metadata
- Authors
- Li, M., Badger, J. H., Chen, X., Kwong, S., Kearney, P., & Zhang, H.
- Venue
- Bioinformatics
- Publisher
- Oxford University Press (OUP)
- Published
- 2001-02-01
- Volume
- 17
- Issue
- 2
- Pages
- 149-154
- ISSN
- 1367-4803 (ISSN-L)
- 1367-4811
- OpenAlex
- W2125598538
- Cited by
- 527
- References
- 19
- FWCI
- 7.60
- 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
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.