✦ LIBER ✦

Efficient string matching with wildcards and length constraints

✍ Scribed by Gong Chen; Xindong Wu; Xingquan Zhu; Abdullah N. Arslan; Yu He

Book ID: 106280275
Publisher: Springer-Verlag
Year: 2006
Tongue: English
Weight: 458 KB
Volume: 10
Category: Article
ISSN: 0219-1377
DOI: 10.1007/s10115-006-0016-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Pattern matching with wildcards and gap-

Pattern matching with wildcards and gap-length constraints based on a centrality-degree graph

✍ Guo, Dan; Hu, Xuegang; Xie, Fei; Wu, Xindong 📂 Article 📅 2012 🏛 Springer US 🌐 English ⚖ 909 KB

String matching with variable length gap

String matching with variable length gaps

✍ Philip Bille; Inge Li Gørtz; Hjalte Wedel Vildhøj; David Kofoed Wind 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 493 KB

Efficient string matching with k mismatc

Efficient string matching with k mismatches

✍ Gad M. Landau; Uzi Vishkin 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 575 KB

Simple and efficient string matching wit

Simple and efficient string matching with k mismatches

✍ R. Grossi; F. Luccio 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 875 KB

Efficient Algorithms for Approximate Str

Efficient Algorithms for Approximate String Matching with Swaps

✍ Dong Kyue Kim; Jee-Soo Lee; Kunsoo Park; Yookun Cho 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 357 KB

Parallel String Matching with Variable L

Parallel String Matching with Variable Length Don′t Cares

✍ A.A. Bertossi; F. Logi 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 450 KB

String matching is the problem of finding all the occurrences of a pattern \(P\) in a text \(T\), where \(P\) and \(T\) are strings over a finite alphabet \(\mathbf{\Sigma}\). A variable length don't care is a special character, not belonging to \(\Sigma\), which can match any string in \(\Sigma^{*}