Overview
Examples
Screenshots
Comparisons
Applications
Download
Documentation
Tutorials
Bazaar
Status & Roadmap
FAQ
Authors & License
Forums
Funding Ultimate++
Search on this site
Search in forums












SourceForge.net Logo
Home » Developing U++ » UppHub » String near match algorithm
Re: String near match algorithm [message #22635 is a reply to message #22634] Mon, 03 August 2009 00:36 Go to previous messageGo to previous message
koldo is currently offline  koldo
Messages: 3361
Registered: August 2008
Senior Veteran
Hello Didier

Perhaps this is something close to:

COMPARE (REPETITION , REPETETION )
Patterns:
1. REPET
2. E
3. I
4. TION
REPETITION = 1+3+4
REPETETION = 1+2+4

I have seen two interesting papers from Colin Percival (second is his PhD Thesis). This is if we have an insane interest in this area Smile
- http://www.daemonology.net/papers/bsdiff.pdf
- http://www.daemonology.net/papers/thesis.pdf

Best regards
Koldo


Best regards
IƱaki
 
Read Message
Read Message
Read Message
Read Message
Read Message
Read Message
Read Message
Read Message
Read Message
Read Message
Read Message
Read Message
Read Message
Read Message
Previous Topic: PlotCtrl
Next Topic: question on tool development for the IDE
Goto Forum:
  


Current Time: Thu May 09 04:45:45 CEST 2024

Total time taken to generate the page: 0.02530 seconds