program

1.

Sequence Comparison;

1.1

Local, global and semi-global comparison;

1.2

Sparing time;

1.3

Sparing memory;

2.

Suffix Trees;

2.1

Building a Suffix Tree;

2.2

Selected applications of Suffix Trees;

3.

Phylogenetic Trees;

3.1

The Perfect Phylogeny Problem;

3.2

Some open phylogeny problems;

4.

Physical Mapping of DNA;

4.1

The Interval Graph Model;

4.2

The Consecutive Ones Property;

5.

Genome Rearrangements;

5.1

Signed Sorting by Reversals;

5.2

Unsigned Sorting by Reversals;