The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
A file comparison program
Abstract
This paper presents a simple method for computing a shortest sequence of insertion and deletion commands that converts one given file to another. The method is particularly efficient when the difference between the two files is small compared to the files' lengths. In experiments performed on typical files, the program often ran four times faster than the UNIX diff command.
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
Hall, P. A. V., & Dowling, G. R. (1980) · ACM Computing Surveys · doi:10.1145/356827.356830 · Cited by 586
Cited by
A Greedy Algorithm for Aligning DNA Sequences
Zhang, Z., Schwartz, S., Wagner, L., & Miller, W. (2000) · Journal of Computational Biology · doi:10.1089/10665270050081478 · Cited by 5,478
Self-citationOptimal alignments in linear space
Myers, E. W., & Miller, W. (1988) · Bioinformatics · doi:10.1093/bioinformatics/4.1.11 · Cited by 1,235
Self-citationAnO(ND) difference algorithm and its variations
Myers, E. W. (1986) · Algorithmica · doi:10.1007/bf01840446 · Cited by 893
Self-citationA Computer Program for Aligning a cDNA Sequence with a Genomic DNA Sequence
Florea, L., Hartzell, G., Zhang, Z., Rubin, G. M., & Miller, W. (1998) · Genome Research · doi:10.1101/gr.8.9.967 · Cited by 729
Self-citationA survey of longest common subsequence algorithms
Bergroth, L., Hakonen, H., & Raita, T. (2002) · Proceedings Seventh International Symposium on String Processing and Information Retrieval. SPIRE 2000 · doi:10.1109/spire.2000.878178 · Cited by 655
Metadata
- Authors
- Miller, W., & Myers, E. W.
- Venue
- Software: Practice and Experience
- Publisher
- Wiley
- Published
- 1985-11
- Volume
- 15
- Issue
- 11
- Pages
- 1025-1040
- ISSN
- 0038-0644 (ISSN-L)
- 1097-024X
- OpenAlex
- W2021487990
- Cited by
- 186
- References
- 1
- FWCI
- 0.85
- 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.