Package de.jstacs.algorithms

Provides classes for algorithms on graphs.

See:
Description

Interface Summary

Alignment.Costs

The general interface for the costs of an alignment.

Class Summary

Alignment	Class for gapped global alignments using the extended Needleman-Wunsch algorithm.
Alignment.SimpleCosts	Class for simple costs with costs mismatch for a mismatch, costs start to start a new gap, costs elong to elongate a gap by one position and costs of 0 for a match.
Alignment.StringAlignment	Class for the representation of an alignment of two Strings.

Enum Summary

Alignment.Costs.Direction

The direction of the predecessor in the DP (dynamic programming)-matrix.

Package de.jstacs.algorithms Description

Provides classes for algorithms on graphs. This includes maximum spanning trees of directed and undirected weighted graphs.