Improved string matching with k mismatches

Article Properties
  • Language
    English
  • DOI (url)
  • Publication Date
    1986/03/01
  • Journal
  • Indian UGC (journal)
  • Refrences
    5
  • Citations
    46
  • Z Galil Department of Computer Science, Tel-Aviv University and Department of Computer Science, Columbia University
  • R Giancarlo Department of Computer Science, Columbia University
Refrences
Title Journal Journal Categories Citations Publication Date
Efficient String Matching in the Presence of Errors. Symposium on Fundations of Computer Science, IEEE 1986
Linear Pattern Matching Algorithms. Symposium on Switching and Automata Theory, IEEE 1973
Efficient String Matching with k Differences. Dept. of Computer Science 1985
Fast Algorithms for Finding Nearest Common Ancestors SIAM Journal on Computing
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
  • Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software
  • Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics: Computer engineering. Computer hardware
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
400 1984
3 . G.M. Landau and U. Vishkin. "Efficient String Matching with k Mismatches". Theoretical Computer Science to appear. 3. G.M. Landau and U. Vishkin. "Efficient String Matching with k Mismatches". Theoretical Computer Science to appear .
Citations
Title Journal Journal Categories Citations Publication Date
Computing the index of non-isometric k-ary words with Hamming and Lee distance

Computability
  • Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods
2024
On the Multiple Pattern String Matching in DNA Databases SN Computer Science 2023
Maximal degenerate palindromes with gaps and mismatches Theoretical Computer Science
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software
  • Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics: Computer engineering. Computer hardware
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
2023
Multidimensional Period Recovery Algorithmica
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software
  • Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods
  • Science: Mathematics
  • Technology: Engineering (General). Civil engineering (General)
1 2022
Double String Tandem Repeats Algorithmica
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software
  • Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods
  • Science: Mathematics
  • Technology: Engineering (General). Civil engineering (General)
2022
Citations Analysis
The category Science: Mathematics: Instruments and machines: Electronic computers. Computer science 32 is the most commonly referenced area in studies that cite this article. The first research to cite this article was titled Parallel string matching with k mismatches and was published in 1987. The most recent citation comes from a 2024 study titled Computing the index of non-isometric k-ary words with Hamming and Lee distance. This article reached its peak citation in 2022, with 3 citations. It has been cited in 23 different journals, 8% of which are open access. Among related journals, the Theoretical Computer Science cited this research the most, with 9 citations. The chart below illustrates the annual citation trends for this article.
Citations used this article by year