A comparison of three string matching algorithms
From MaRDI portal
Publication:3919092
DOI10.1002/spe.4380120106zbMath0466.68050OpenAlexW2080902012MaRDI QIDQ3919092
Publication date: 1982
Published in: Software: Practice and Experience (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/spe.4380120106
Related Items
On-Line Approximate String Searching Algorithms: Survey and Experimental Results ⋮ On-line string matching algorithms: survey and experimental results ⋮ How the character comparison order shapes the shift function of on-line pattern matching algorithms ⋮ Fast string matching for multiple searches ⋮ Unnamed Item ⋮ Fast String Matching in Stationary Ergodic Sources ⋮ Automatic error correction in flexion languages