LEDA NUMBERS

LEDA HOME
About LEDA

LEDA 6.x
LEDA 5.2
LEDA 5.1
Change Files

Professional Edition
Research Edition
Free Edition
Resources
Supported Platforms
Maintenance & Support
Sample Projects
Evaluation
Order

  LEDA Book:
  Free Download

Schuetzenstrasse 3-5
66123 Saarbruecken
Germany

Phone: +49 (0)681 3710612
Fax: +49 (0)681 77012646

contact@algorithmic-solutions.com
http://www.algorithmic-solutions.com


HOME » LEDA » About LEDA » LEDA 5.2

New Module: String Alignment

 

String Distance Functions:

Hamming distance
Levenshtein distance
General Levenshtein distance
Damerau-Levenshtein distance

 

Alignment Algorithms:

global alignment of Needleman and Wunsch, quadratic space
global alignment of Needleman and Wunsch, quadratic space, affine gap cost
local alignment of Smith and Waterman, quadratic space
local alignment of Smith and Waterman, quadratic space, affine gap
longest common subsequence

 

Exact String Matching Algorithms:

Karp and Rabin
Morris and Pratt
Knuth, Morris and Pratt
Galil and Seiferas
Boyer and Moore (also turbo and tuned version)
Zhu and Takaoka
Berry and Ravindran
Smith
Raita
Horspool
brute force method
shoft-or method
reverse colussi method
and several more.

 

More Information in the Manual / Alignment Data Types.

IMPRESSUM | PRIVACY & TERMS OF USE | WEB CONTACT
Google
 
Copyright © 2015 Algorithmic Solutions Software GmbH. All rights reserved.