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.
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
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
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
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
An information-based sequence distance and its application to whole mitochondrial genome phylogeny
Li, M., Badger, J. H., Chen, X., Kwong, S., Kearney, P., & Zhang, H. (2001) · Bioinformatics · doi:10.1093/bioinformatics/17.2.149 · Cited by 527
Self-citationBennett, C. H., Gacs, P., Li, M., Vitanyi, P. M. B., & Zurek, W. H. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.681318 · Cited by 506
Self-citationBenedetto, D., Caglioti, E., & Loreto, V. (2002) · Physical Review Letters · doi:10.1103/physrevlett.88.048702 · Cited by 364
Whole genome-based phylogenetic analysis of free-living microorganisms
Fitz Gibbon, S. T., & House, C. H. (1999) · Nucleic Acids Research · doi:10.1093/nar/27.21.4218 · Cited by 311
A new challenge for compression algorithms: Genetic sequences
Grumbach, S., & Tahi, F. (1994) · Information Processing & Management · doi:10.1016/0306-4573(94)90014-0 · Cited by 272
Shared Information and Program Plagiarism Detection
Chen, X., Francia, B., Li, M., McKinnon, B., & Seker, A. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.830793 · Cited by 251
Self-citationConflict Among Individual Mitochondrial Proteins in Resolving the Phylogeny of Eutherian Orders
Cao, Y., Janke, A., Waddell, P. J., Westerman, M., Takenaka, O., Murata, S., Okada, N., Pääbo, S., & Hasegawa, M. (1998) · Journal of Molecular Evolution · doi:10.1007/pl00006389 · Cited by 234
A compression algorithm for DNA sequences and its applications in genome comparison
Chen, X., Kwong, S., & Li, M. (2000) · Proceedings of the fourth annual international conference on Computational molecular biology · doi:10.1145/332306.332352 · Cited by 218
Self-citationCommunication complexity of document exchange
Cormode, G., Paterson, M. S., Şahinalp, S. C., & Vishkin, U. (2026) · Symposium on Discrete Algorithms · doi:10.82444/warw.33642076 · Cited by 128
Nadeau, J. H., & Sankoff, D. (1998) · Trends in Genetics · doi:10.1016/s0168-9525(98)01607-2 · Cited by 114
Gács, P., Tromp, J., & Vitanyi, P. M. B. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.945257 · Cited by 112
Self-citationChain Letters and Evolutionary Histories
Bennett, C. H., Li, M., & Ma, B. (2003) · Scientific American · doi:10.1038/scientificamerican0603-76 · Cited by 111
Self-citationApproximate nearest neighbors and sequence comparison with block operations
Muthukrishnan, S., & Şahinalp, S. C. (2000) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/335305.335353 · Cited by 85
Reversibility and adiabatic computation: trading time and space for energy
Li, M., & Vitanyi, P. M. B. (1996) · Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rspa.1996.0039 · Cited by 77
Self-citationLi, M., & Vitanyi, P. M. B. (2001) · Elsevier eBooks · doi:10.1016/b0-08-043076-7/00550-7 · Cited by 7
Self-citation
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
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.