The DOI matches its Crossref record; 29 of the 29 references it cites were found in a registry or an index.
The Similarity Metric
Abstract
A new class of distances appropriate for measuring similarity relations between sequences, say one type of similarity per distance, is studied. We propose a new "normalized information distance," based on the noncomputable notion of Kolmogorov complexity, and show that it is in this class and it minorizes every computable distance in the class (that is, it is universal in that it discovers all computable similarities). We demonstrate that it is a metric and call it the similarity metric . This theory forms the foundation for a new practical tool. To evidence generality and robustness, we give two distinctive applications in widely divergent areas using standard compression programs like gzip and GenCompress. First, we compare whole mitochondrial genomes and infer their evolutionary history. This results in a first completely automatic computed whole mitochondrial phylogeny tree. Secondly, we fully automatically compute the language tree of 52 different languages.
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
Johnson, A. P. (2024) · Being and Becoming Teachers of Writing · doi:10.4324/9781003334798-34 · Cited by 4,502
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-citationFitch, W. M., & Margoliash, E. (1967) · Science · doi:10.1126/science.155.3760.279 · Cited by 3,610
Three approaches to the quantitative definition of information*
Kolmogorov, A. N. (1968) · International Journal of Computer Mathematics · doi:10.1080/00207166808803030 · Cited by 2,031
An 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-citationGenome-scale approaches to resolving incongruence in molecular phylogenies.
Rokas, A., Williams, B. L., King, N., & Carroll, S. B. (2003) · Nature · doi:10.1038/nature02053 · Cited by 1,512
Cilibrasi, R., & Vitanyi, P. M. B. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.844059 · Cited by 1,188
Self-citationPatternHunter: faster and more sensitive homology search
Ma, B., Tromp, J., & Li, M. (2002) · Bioinformatics · doi:10.1093/bioinformatics/18.3.440 · Cited by 829
Self-citationGenome phylogeny based on gene content
Snel, B., Bork, P., & Huynen, M. A. (1999) · Nature Genetics · doi:10.1038/5052 · Cited by 716
Cited by
Vinh, N. X., Epps, J., & Bailey, J. (2010) · Minerva Access (University of Melbourne) · doi:10.5555/1756006.1953024 · Cited by 1,781
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
Self-citationCilibrasi, R., & Vitanyi, P. M. B. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.844059 · Cited by 1,188
Self-citationk-Nearest Neighbour Classifiers - A Tutorial
Cunningham, P., & Delany, S. J. (2022) · ACM Computing Surveys · doi:10.1145/3459665 · Cited by 942
On the Mathematical Properties of the Structural Similarity Index
Brunet, D., Vrscay, E. R., & Wang, Z. (2012) · IEEE Transactions on Image Processing · doi:10.1109/tip.2011.2173206 · Cited by 600
A Statistical Deterministic Approach to Hurricane Risk Assessment
Emanuel, K., Ravela, S., Vivant, E., & Risi, C. (2006) · Bulletin of the American Meteorological Society · doi:10.1175/bams-87-3-299 · Cited by 592
Alignment-free sequence comparison: benefits, applications, and tools
Zielezinski, A., Vinga, S., Almeida, J., & Karlowski, W. M. (2017) · Genome Biology · doi:10.1186/s13059-017-1319-7 · Cited by 542
Measuring semantic similarity between words using web search engines
(2007) · Proceedings of the 16th international conference on World Wide Web · doi:10.1145/1242572.1242675 · Cited by 540
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
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
Cowley, G. S., Weir, B. A., Vazquez, F., Tamayo, P., Scott, J. A., Rusin, S., East-Seletsky, A., Ali, L. D., Gerath, W. F., Pantel, S. E., et al. (2014) · Scientific Data · doi:10.1038/sdata.2014.35 · Cited by 387
Cunningham, P., Cord, M., & Delany, S. J. (2008) · Cognitive Technologies · doi:10.1007/978-3-540-75171-7_2 · Cited by 387
K-means with Three different Distance Metrics
Singh, A., Yadav, A., & Rana, A. (2013) · International Journal of Computer Applications · doi:10.5120/11430-6785 · Cited by 380
Distance Weighted Cosine Similarity Measure for Text Classification
Li, B., & Han, L. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-41278-3_74 · Cited by 321
Distance spectra of graphs: A survey
Aouchiche, M., & Hansen, P. (2014) · Linear Algebra and its Applications · doi:10.1016/j.laa.2014.06.010 · Cited by 297
A review on distance based time series classification
Abanda, A., Mori, U., & Lozano, J. A. (2019) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-018-0596-4 · Cited by 296
Labbé, C., & Labbé, D. (2013) · Scientometrics · doi:10.1007/s11192-012-0781-y · Cited by 132
Efficient DNA sequence compression with neural networks
Silva, M., Pratas, D., & Pinho, A. J. (2020) · GigaScience · doi:10.1093/gigascience/giaa119 · Cited by 57
Compression ensembles quantify aesthetic complexity and the evolution of visual art
Karjus, A., Canet Solà, M., Ohm, T., Ahnert, S. E., & Schich, M. (2023) · EPJ Data Science · doi:10.1140/epjds/s13688-023-00397-3 · Cited by 32
Predicting phenotype transition probabilities via conditional algorithmic probability approximations
Dingle, K., Novev, J. K., Ahnert, S. E., & Louis, A. A. (2022) · Journal of the Royal Society Interface · doi:10.1098/rsif.2022.0694 · Cited by 13
Yoshizawa, S., Terano, T., & Yoshikawa, A. (2012) · IEEE Transactions on Professional Communication · doi:10.1109/tpc.2011.2172833 · Cited by 11
Detecting translations of the same text and data with common source
Koroutchev, K., & Cebrián, M. (2006) · Journal of Statistical Mechanics: Theory and Experiment · doi:10.1088/1742-5468/2006/10/p10009 · Cited by 9
Taxonomy of academic plagiarism methods
Vrbanec, T., & Meštrović, A. (2021) · Zbornik Veleučilišta u Rijeci · doi:10.31784/zvr.9.1.17 · Cited by 9
Metadata
- Authors
- Li, M., Chen, X., Li, X., Ma, B., & Vitanyi, P. M. B.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2004-12
- Volume
- 50
- Issue
- 12
- Pages
- 3250-3264
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2144221002
- Cited by
- 1,062
- References
- 29
- FWCI
- 36.05
- 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
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.