✦ LIBER ✦

An algorithm for string matching with a sequence of don't cares

✍ Scribed by Udi Manber; Ricardo Baeza–Yates

Book ID: 107765943
Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 578 KB
Volume: 37
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(91)90032-d

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A faster algorithm for matching a set of

A faster algorithm for matching a set of patterns with variable length don't cares

✍ Meng Zhang; Yi Zhang; Liang Hu 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 377 KB

A fast algorithm for string matching wit

A fast algorithm for string matching with mismatches

✍ A Dermouche 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 423 KB

An analysis of the Karp-Rabin string mat

An analysis of the Karp-Rabin string matching algorithm

✍ Gaston H. Gonnet; Ricardo A. Baeza-Yates 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 238 KB

An algorithm for finding the natural fre

An algorithm for finding the natural frequencies of a randomly supported string

✍ Thomas P. Mitchell; Hossein A. Moini 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 252 KB

A regularizing algorithm for the solutio

A regularizing algorithm for the solution of the inverse problem for an inhomogeneous string

✍ A. V. Baev 📂 Article 📅 1990 🏛 Springer 🌐 English ⚖ 471 KB

An algorithm for projective point matchi

An algorithm for projective point matching in the presence of spurious points

✍ Jason A. Denton; J. Ross Beveridge 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 513 KB

Point matching is the task of finding correspondences between two sets of points such that the two sets of points are aligned with each other. Pure point matching uses only the location of the points to constrain the problem. This is a problem with broad practical applications, but it has only been