Computationele Biologie Chapter 05: How do we compare biological sequences?

This course is archived · This course is now in read-only mode. You can’t register or make new submissions anymore, but your previous work and results are still available.

Computationele Biologie

Chapter 05: How do we compare biological sequences?

Na de deadline zal de correctheid en de computationele complexiteit (tijd en geheugen) van de volgende oefening geëvalueerd worden op basis van peer review:

Global alignment in linear space

			Title	Class progress
			Change problem
			Longest path in a Manhattan-like grid
			Longest common subsequence
			Topological ordering of a DAG
			Longest path in a DAG
			Global alignment
			Local alignment
			Edit distance
			Fitting alignment
			Overlap alignment
			Global alignment with affine gap penalties
			Multiple longest common subsequence
			Find a middle edge in linear space
			Global alignment in linear space

Change problem

Longest path in a Manhattan-like grid

Longest common subsequence

Topological ordering of a DAG

Longest path in a DAG

Global alignment

Local alignment

Edit distance

Fitting alignment

Overlap alignment

Global alignment with affine gap penalties

Multiple longest common subsequence

Find a middle edge in linear space

Global alignment in linear space