✦ LIBER ✦

Finding approximate patterns in strings

✍ Scribed by Esko Ukkonen

Publisher: Elsevier Science
Year: 1985
Tongue: English
Weight: 340 KB
Volume: 6
Category: Article
ISSN: 0196-6774
DOI: 10.1016/0196-6774(85)90023-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Fastest Pattern Matching in Strings

✍ L. Colussi 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 850 KB

An algorithm is presented that substantially improves the algorithm of Boyer and Moore for pattern matching in strings, both in the worst case and in the average. Both the Boyer and Moore algorithm and the new algorithm assume that the characters in the pattern and in the text are taken from a given

An umbral relation between pattern and c

An umbral relation between pattern and commutation in strings

✍ I.P. Goulden; D.M. Jackson; C.M. Springer 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 556 KB

String Block Vs Superblock Patterns of D

String Block Vs Superblock Patterns of Dispersal in China

✍ Kjersti Monson 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 871 KB

Rough approximation of shapes in pattern

Rough approximation of shapes in pattern recognition

✍ Zbigniew Wojcik 📂 Article 📅 1987 🏛 Elsevier Science ⚖ 70 KB

Second order approximations in structura

Second order approximations in structural genesis and shape finding

✍ H. P. Mlejnek; U. Jehle; R. Schirrmacher 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 804 KB

An O(n log n) algorithm for finding all

An O(n log n) algorithm for finding all repetitions in a string

✍ Michael G Main; Richard J Lorentz 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 602 KB