𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Efficient Algorithms for Approximate String Matching with Swaps

✍ Scribed by Dong Kyue Kim; Jee-Soo Lee; Kunsoo Park; Yookun Cho

Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
357 KB
Volume
15
Category
Article
ISSN
0885-064X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A Comparison of Approximate String Match
A Comparison of Approximate String Matching Algorithms
✍ PETTERI JOKINEN; JORMA TARHIO; ESKO UKKONEN πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 972 KB

Experimental comparisons of the running time of approximate string matching algorithms for the k differences problem are presented. Given a pattern string, a text string, and an integer k, the task is to find all approximate occurrences of the pattern in the text with at most k differences (insertio

Efficient Algorithms for Petersen's Matc
Efficient Algorithms for Petersen's Matching Theorem
✍ Therese C. Biedl; Prosenjit Bose; Erik D. Demaine; Anna Lubiw πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 293 KB

Petersen's theorem is a classic result in matching theory from 1891, stating that every 3-regular bridgeless graph has a perfect matching. Our work explores efficient algorithms for finding perfect matchings in such graphs. Previously, the only relevant matching algorithms were for general graphs, a

Computationally efficient algorithms for
Computationally efficient algorithms for state estimation with ellipsoidal approximations
✍ D. G. Maksarov; J. P. Norton πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 205 KB

## Abstract Computationally efficient algorithms for computing minimal‐volume ellipsoidal bounds on the state of a linear, discrete‐time dynamical system are presented. Ellipsoidally bounded noise is considered, rather than the scalar‐noise case usually treated; the latter is covered as a degenerat

Efficient Approximation Algorithms for T
Efficient Approximation Algorithms for Tiling and Packing Problems with Rectangles
✍ Piotr Berman; Bhaskar DasGupta; S Muthukrishnan; Suneeta Ramaswami πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 202 KB

We provide improved approximation algorithms for several rectangle tiling and packing problems (RTILE, DRTILE, and d-RPACK) studied in the literature. Most of our algorithms are highly efficient since their running times are near-linear in the sparse input size rather than in the domain size. In add

Word-oriented approximate string matchin
Word-oriented approximate string matching using occurrence heuristic tables: A heuristic for searching Arabic text
✍ Suleiman H. Mustafa πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 143 KB πŸ‘ 2 views

## Abstract In this article, a word‐oriented approximate string matching approach for searching Arabic text is presented. The distance between a pair of words is determined on the basis of aligning the two words by using occurrence heuristic tables. Two words are considered related if they have the