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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
In this paper, we introduce two efficient algorithms in practice for computing the length of a longest common subsequence of two… 
2010
2010
There is growing consensus that, for trained readers, poetic-text processing involves a genre decision, which triggers genre… 
2010
2010
La presente invention concerne un reacteur pour une reaction de Fischer-Tropsch qui est mise en œuvre dans un systeme tri… 
2006
2006
Detection of discourse structure is crucial in many text-based applications. This paper presents an original framework for… 
2004
2004
The signal and threshold quantization and noise level estimation effects on the performance of two power-law detectors are… 
2003
2003
In this paper, we make use of the Attributed String Matching (ASM) technique to deal with three-lines matching in the frame of… 
2001
2001
A visualisation experiment and measurements with a Pitot probe show that fluidic instability of a partially confined triangular… 
1999
1999
Two image subband coding methods are introduced as combinations of trellis-coded quantization (TCQ) with zerotree and stack-run… 
Review
1990
Review
1990
A Technique for Order Placement and Sizing This article presents a unique heuristic model for purchased item lot-sizing. The…