The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
A fast bit-vector algorithm for approximate string matching based on dynamic programming
Open accessAbstract
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k -or-fewer differences. Simple and practical bit-vector algorithms have been designed for this problem, most notably the one used in agrep . These algorithms compute a bit representation of the current state-set of the k -difference automaton for the query, and asymptotically run in either O ( nm/w ) or O ( nm log σ/ w ) time where w is the word size of the machine (e.g., 32 or 64 in practice), and σ is the size of the pattern alphabet. Here we present an algorithm of comparable simplicity that requires only O ( nm/w) time by virtue of computing a bit representation of the relocatable dynamic programming matrix for the problem. Thus, the algorithm's performance is independent of k , and it is found to be more efficient than the previous results for many choices of k and small m . Moreover, because the algorithm is not dependent on k , it can be used to rapidly compute blocks of the dynamic programming matrix as in the 4-Russians algorithm of Wu et al.(1996). This gives rise to an O(kn/w) expected-time algorithm for the case where m may be arbitrarily large. In practice this new algorithm, that computes a region of the dynamic progr amming (d.p.) matrx w entries at a time using the basic algorithm as a subroutine is significantly faster than our previous 4-Russians algorithm, that computes the same region 4 or 5 entries at a time using table lookup. This performance improvement yields a code that is either superior or competitive with all existing algorithms except for some filtration algorithms that are superior when k/m is sufficiently small.
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
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
The String-to-String Correction Problem
Wagner, R. A., & Fischer, M. J. (1974) · Journal of the ACM · doi:10.1145/321796.321811 · Cited by 3,032
Fast text searching: allowing errors
Wu, S., & Manber, U. (1992) · Communications of the ACM · doi:10.1145/135239.135244 · Cited by 727
A faster algorithm computing string edit distances
Masek, W. J., & Paterson, M. S. (1980) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(80)90002-1 · Cited by 651
Approximate string-matching with q-grams and maximal matches
Ukkonen, E. (1992) · Theoretical Computer Science · doi:10.1016/0304-3975(92)90143-4 · Cited by 605
A new approach to text searching
Baeza-Yates, R., & Gonnet, G. H. (1992) · Communications of the ACM · doi:10.1145/135239.135243 · Cited by 603
Finding approximate patterns in strings
Ukkonen, E. (1985) · Journal of Algorithms · doi:10.1016/0196-6774(85)90023-9 · Cited by 426
The theory and computation of evolutionary distances: Pattern recognition
Sellers, P. H. (1980) · Journal of Algorithms · doi:10.1016/0196-6774(80)90016-4 · Cited by 372
Sublinear approximate string matching and biological applications
Chang, W. I., & Lawler, E. L. (1994) · Algorithmica · doi:10.1007/bf01185431 · Cited by 187
Aligning two sequences within a specified diagonal band
Chao, K.-M., Pearson, W. R., & Miller, W. (1992) · Bioinformatics · doi:10.1093/bioinformatics/8.5.481 · Cited by 159
Approximate string-matching over suffix trees
Ukkonen, E. (2005) · Springer eBooks · doi:10.1007/bfb0029808 · Cited by 151
Multiple filtration and approximate pattern matching
Pevzner, P. A., & Waterman, M. S. (1995) · Algorithmica · doi:10.1007/bf01188584 · Cited by 86
A Subquadratic Algorithm for Approximate Limited Expression Matching
Wu, S., Manber, U., & Myers, E. W. (1996) · Algorithmica · doi:10.1007/bf01942606 · Cited by 77
Recent Developments in Linear-Space Alignment Methods: A Survey
Chao, K., Hardison, R. C., & Miller, W. (1994) · Journal of Computational Biology · doi:10.1089/cmb.1994.1.271 · Cited by 60
Cited by
Haplotype-resolved de novo assembly using phased assembly graphs with hifiasm
Cheng, H., Concepcion, G. T., Feng, X., Zhang, H., & Li, H. (2021) · Nature Methods · doi:10.1038/s41592-020-01056-5 · Cited by 5,859
Ribosomal Database Project: data and tools for high throughput rRNA analysis
Cole, J. R., Wang, Q., Fish, J. A., Chai, B., McGarrell, D. M., Sun, Y., Brown, C. T., Porras-Alfaro, A., Kuske, C. R., & Tiedje, J. M. (2014) · Nucleic Acids Research · doi:10.1093/nar/gkt1244 · Cited by 4,367
The Subread aligner: fast, accurate and scalable read mapping by seed-and-vote
Liao, Y., Smyth, G. K., & Shi, W. (2013) · Nucleic Acids Research · doi:10.1093/nar/gkt214 · Cited by 3,064
Fast and accurate de novo genome assembly from long uncorrected reads
Vaser, R., Sović, I., Nagarajan, N., & Šikić, M. (2017) · Genome Research · doi:10.1101/gr.214270.116 · Cited by 3,043
A guided tour to approximate string matching
Navarro, G. (2001) · ACM Computing Surveys · doi:10.1145/375360.375365 · Cited by 2,561
Metadata
- Authors
- Myers, G.
- Venue
- Journal of the ACM
- Published
- 1999-05
- Volume
- 46
- Issue
- 3
- Pages
- 395-415
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W2100751585
- Cited by
- 445
- References
- 14
- FWCI
- 12.21
- 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.