The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Fast text searching: allowing errors
Open accessAbstract
article Free Access Share on Fast text searching: allowing errors Authors: Sun Wu Bell Labs, Murray Hill, NJ Bell Labs, Murray Hill, NJView Profile , Udi Manber Univ. of Arizona, Tucson Univ. of Arizona, TucsonView Profile Authors Info & Claims Communications of the ACMVolume 35Issue 10Oct. 1992 pp 83–91https://doi.org/10.1145/135239.135244Published:01 October 1992Publication History 567citation4,372DownloadsMetricsTotal Citations567Total Downloads4,372Last 12 Months234Last 6 weeks31 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my Alerts New Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
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
Binary Codes capable of currecting deletions, insertions, and reversals
Levenshtein, V. I. (1965) · Soviet physics. Doklady · Cited by 14,804
Introduction to automata theory, languages and computation
(1981) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(81)90068-9 · Cited by 10,699
Fast Pattern Matching in Strings
Knuth, D. E., Morris, Jr., & Pratt, V. R. (1977) · SIAM Journal on Computing · doi:10.1137/0206024 · Cited by 2,936
A fast string searching algorithm
Boyer, R. S., & Moore, J. S. (1977) · Communications of the ACM · doi:10.1145/359842.359859 · Cited by 2,290
AnO(ND) difference algorithm and its variations
Myers, E. W. (1986) · Algorithmica · doi:10.1007/bf01840446 · Cited by 893
Algorithms for approximate string matching
Ukkonen, E. (1985) · Information and Control · doi:10.1016/s0019-9958(85)80046-2 · Cited by 610
Hall, P. A. V., & Dowling, G. R. (1980) · ACM Computing Surveys · doi:10.1145/356827.356830 · Cited by 586
Handbook of algorithms and data structures
Gonnet, G. H. (1984) · CERN Document Server (European Organization for Nuclear Research) · Cited by 436
Finding approximate patterns in strings
Ukkonen, E. (1985) · Journal of Algorithms · doi:10.1016/0196-6774(85)90023-9 · Cited by 426
Fast parallel and serial approximate string matching
Landau, G. M., & Vishkin, U. (1989) · Journal of Algorithms · doi:10.1016/0196-6774(89)90010-2 · Cited by 328
Cited by
Agrawal, R., & Srikant, R. (2002) · Proceedings of the Eleventh International Conference on Data Engineering · doi:10.1109/icde.1995.380415 · Cited by 5,155
A guided tour to approximate string matching
Navarro, G. (2001) · ACM Computing Surveys · doi:10.1145/375360.375365 · Cited by 2,561
Efficient similarity search in sequence databases
Agrawal, R., Faloutsos, C., & Swami, A. (1993) · Lecture Notes in Computer Science · doi:10.1007/3-540-57301-1_5 · Cited by 1,979
Duplicate Record Detection: A Survey
Elmagarmid, A. K., Ipeirotis, P. G., & Verykios, V. S. (2007) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2007.250581 · Cited by 1,267
Chevreux, B., Pfisterer, T., Drescher, B., Driesel, A. J., Müller, W. E. G., Wetter, T., & Suhai, S. (2004) · Genome Research · doi:10.1101/gr.1917404 · Cited by 1,050
Extensive feature detection of N-terminal protein sorting signals
Bannai, H., Tamada, Y., Maruyama, O., Nakai, K., & Miyano, S. (2002) · Bioinformatics · doi:10.1093/bioinformatics/18.2.298 · Cited by 723
Kalign – an accurate and fast multiple sequence alignment algorithm
Lassmann, T., & Sonnhammer, E. L. (2005) · BMC Bioinformatics · doi:10.1186/1471-2105-6-298 · Cited by 705
Targeted Genome Editing Across Species Using ZFNs and TALENs
Wood, A. J., Lo, T.-W., Zeitler, B., Pickle, C. S., Ralston, E. J., Lee, A. H., Amora, R., Miller, J. C., Leung, E., Meng, X., et al. (2011) · Science · doi:10.1126/science.1207773 · Cited by 663
A fast bit-vector algorithm for approximate string matching based on dynamic programming
Myers, G. (1999) · Journal of the ACM · doi:10.1145/316542.316550 · Cited by 445
Algorithmics and applications of tree and graph searching
Shasha, D., Wang, J. T. L., & Giugno, R. (2002) · Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems · doi:10.1145/543613.543620 · Cited by 387
Automated Finishing with Autofinish
Gordon, D., Desmarais, C., & Green, P. (2001) · Genome Research · doi:10.1101/gr.171401 · Cited by 376
Positional Dependence, Cliques, and Predictive Motifs in the bHLH Protein Domain
Atchley, W. R., Terhalle, W., & Dress, A. (1999) · Journal of Molecular Evolution · doi:10.1007/pl00006494 · Cited by 345
A survey of temporal data mining
Laxman, S., & Sastry, P. S. (2006) · Sadhana · doi:10.1007/bf02719780 · Cited by 314
Lassmann, T., Frings, O., & Sonnhammer, E. L. L. (2009) · Nucleic Acids Research · doi:10.1093/nar/gkn1006 · Cited by 274
On-line string matching algorithms: survey and experimental results
Michailidis, P. D., & Margaritis, K. G. (2001) · International Journal of Computer Mathematics · doi:10.1080/00207160108805036 · Cited by 53
WHAM: a high-throughput sequence alignment method
Li, Y., Terrell, A., & Patel, J. M. (2011) · Proceedings of the 2011 ACM SIGMOD International Conference on Management of data · doi:10.1145/1989323.1989370 · Cited by 36
Metadata
- Authors
- Wu, S., & Manber, U.
- Venue
- Communications of the ACM
- Published
- 1992-10
- Volume
- 35
- Issue
- 10
- Pages
- 83-91
- ISSN
- 0001-0782 (ISSN-L)
- 1557-7317
- OpenAlex
- W2045821558
- Cited by
- 727
- References
- 12
- FWCI
- 19.67
- 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.