The DOI matches its Crossref record.
On the resemblance and containment of documents
Abstract
Given two documents A and B we define two mathematical notions: their resemblance r(A, B) and their containment c(A, B) that seem to capture well the informal notions of "roughly the same" and "roughly contained." The basic idea is to reduce these issues to set intersection problems that can be easily evaluated by a process of random sampling that can be done independently for each document. Furthermore, the resemblance can be evaluated using a fixed size sample for each document. This paper discusses the mathematical properties of these measures and the efficient implementation of the sampling process using Rabin (1981) fingerprints.
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
No references could be resolved yet.
Research works printed but not linked: 10
- broder, 1998, Min-Wise Independent Permutations, Proceedings of the thirtieth annual ACM symposium on Theory of computing, 10.1145/276698.276781 · DOI · Paper page
- broder, 1993, Sequences II Methods in Communications Security and Computer Science, 143, 10.1007/978-1-4613-9323-8_11 · DOI · Paper page
- rabin, 1981, Fingerprinting by random polynomials
- heintze, 1996, Scalable Document Fingerprinting, Proceedings of the Second Usenix Workshop on Electronic Commerce
- 10.1016/S0169-7552(97)00031-7 · DOI · Paper page
- shivakumar, 1995, SCAM: A Copy Detection Mechanism for Digital Documents, Proceedings of the International Conference on the Theory and Practice of Digital Libraries
- manber, 1994, Finding similar files in a large file system, Proc 1994 USENIX Conf
- 10.1145/223784.223855 · DOI · Paper page
- 10.1145/226931.226961 · DOI · Paper page
- alon, 1992, The Probabilistic Method
Cited by
High throughput ANI analysis of 90K prokaryotic genomes reveals clear species boundaries
Jain, C., Rodriguez-R, L. M., Phillippy, A. M., Konstantinidis, K. T., & Aluru, S. (2018) · Nature Communications · doi:10.1038/s41467-018-07641-9 · Cited by 5,748
Approximate nearest neighbors: towards removing the curse of dimensionality
Indyk, P., & Motwani, R. (1998) · Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98 · doi:10.1145/276698.276876 · Cited by 4,188
Mash: fast genome and metagenome distance estimation using MinHash
Ondov, B. D., Treangen, T. J., Melsted, P., Mallonee, A. B., Bergman, N. H., Koren, S., & Phillippy, A. M. (2016) · Genome biology · doi:10.1186/s13059-016-0997-x · Cited by 3,373
Huang, L., Yu, W., Ma, W., Zhong, W., Feng, Z., Wang, H., Chen, Q., Peng, W., Feng, X., Qin, B., et al. (2025) · ACM Transactions on Information Systems · doi:10.1145/3703155 · Cited by 4,688
PacBio Sequencing and its Applications
Rhoads, A., & Au, K. F. (2015) · Genomics, Proteomics & Bioinformatics · doi:10.1016/j.gpb.2015.08.002 · Cited by 2,135
Metadata
- Authors
- Broder, A. Z.
- Venue
- Proceedings. Compression and Complexity of SEQUENCES 1997 (Cat. No.97TB100171)
- Publisher
- IEEE Comput. Soc
- Published
- 2002-11-22
- Pages
- 21-29
- OpenAlex
- W2132069633
- Cited by
- 1,698
- References
- 0
- FWCI
- 25.28
- Type
- conference paper
- 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: On the resemblance and containment of documents. https://app.cochat.ai/papers/10.1109/sequen.1997.666900
- The paper
- Broder, A. Z. (2002). On the resemblance and containment of documents. Proceedings. Compression and Complexity of SEQUENCES 1997 (Cat. No.97TB100171). https://doi.org/10.1109/sequen.1997.666900
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.
