Re: Levinshtein Distances

"Lionel Delafosse" <lionel_delafosse@mail.dotcom.fr>
19 Nov 1999 22:38:59 -0500

From comp.compilers

Related articles
Levinshtein Distances qjackson@wave.home.com (Quinn Tyler Jackson) (1999-11-16)
Re: Levinshtein Distances derek@knosof.co.uk (1999-11-18)
Re: Levinshtein Distances world!jhallen@uunet.uu.net (1999-11-18)
*Re: Levinshtein Distances lionel_delafosse@mail.dotcom.fr (Lionel Delafosse)* (1999-11-19)**
Re: Levinshtein Distances Burak.Emir@dimail.epfl.ch (Burak Emir) (1999-12-20)

From:	"Lionel Delafosse" <lionel_delafosse@mail.dotcom.fr>
Newsgroups:	comp.compilers,comp.editors
Date:	19 Nov 1999 22:38:59 -0500
Organization:	Wanadoo, l'internet avec France Telecom
Distribution:	inet
References:	99-11-083 99-11-098
Keywords:	theory

Hi,

You could have a look to :

    Longest Common Subsequences :
            http://www.ics.uci.edu/~eppstein/161/960229.html

  Sequence comparison :
      http://www.dir.univ-rouen.fr/~charras/seqcomp/

Lionel Delafosse

---------------------------------------------------------------
E-mail : lionel_delafosse@mail.dotcom.fr
Home Page : http://www.citeweb.net/delafoss/index.htm
Sort Factory : http://www.citeweb.net/delafoss/Sort/Factory.htm
Miroir/Mirror: http://perso.wanadoo.fr/ldelafosse/index.htm
---------------------------------------------------------------

>Quinn Tyler Jackson <qjackson@wave.home.com> wrote:
>>Would anyone happen to know where I might be able to find C or C++ code
>>that >>implements the Levinshtein Distance (minimal edit distance) metric?