Skip to search formSkip to main contentSkip to account menu

Wagner–Fischer algorithm

Known as: Wagner–Fisher algorithm, Wagner-Fischer algorithm, Wagner–Fischer edit distance 
In computer science, the Wagner–Fischer algorithm is a dynamic programming algorithm that computes the edit distance between two strings of… 
Wikipedia (opens in a new tab)

Related topics

Related topics

12 relations
Computer scienceDamerau–Levenshtein distanceData dependencyDynamic programming

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Automata Technique for The LCS Problem
In this paper, we introduce two efficient algorithms in practice for computing the length of a longest common subsequence of two… 
2018
2018
Real-Time Comparable Phrases Searching Via the Levenshtein Distance with the Use of CUDA Technology
The paper presents a real-time method for finding strings similar to a given pattern. The method is based on the Levenshtein… 
2015
2015
On Parallel Evaluation of Matrix-Based Dynamic Programming Algorithms
Dynamic programming techniques are well established and employed by various practical algorithms, for instance the edit-distance… 
2014
2014
„O poszukiwaniu prawdy i przekładzie, który dotyka do żywego”. Rozmowa z Eryką Fischer i Katarzyną Weintraub
„O poszukiwaniu prawdy i przekladzie, ktory dotyka do zywego”. Rozmowa z Eryką Fischer i Katarzyną Weintraub 
2010
2010
Réacteur pour des réactions catalytiques exothermiques ou endothermiques
La presente invention concerne un reacteur pour une reaction de Fischer-Tropsch qui est mise en œuvre dans un systeme tri… 
2007
2007
Benefits of Talking about the College Transition: Exploring Growth through Cognitive Processing
An experimental study was conducted to examine the effects of a cognitive processing manipulation on stress-related growth… 
2003
2003
Poecilimon Fischer (Orthoptera: Tettigoniidae: Phaneropterinae) Species of the Bati Karadeniz Region of Turkey, N.W. Anatolia
2001
2001
Preliminary study of oscillating triangular jets
A visualisation experiment and measurements with a Pitot probe show that fluidic instability of a partially confined triangular… 
1999
1999
Comparison of different image subband coding methods at low bit rates
Two image subband coding methods are introduced as combinations of trellis-coded quantization (TCQ) with zerotree and stack-run… 
1999
1999
Running parallel algorithms with APL on a sequential machine
Every APLer knows the trick that one way to cut down on the CPU time is to avoid writing explicit APL loops. But it is not so… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)