CSE 589 Applied Algorithms Spring 1999

6/1/99


Click here to start


Table of Contents

CSE 589 Applied Algorithms Spring 1999

DNA Sequence Reconstruction

Tagging the Clones

Problem to Solve

Contiguous Ordering Solutions

Linear Time Algorithm

PQ Trees

Example PQ-Tree

Equivalent PQ Trees

Orderings Defined by a PQ Tree

PQ Tree Solution for the Contiguous Ordering Problem

Example Solution

PQ Tree Restriction

High Level PQ tree Algorithm

Marking Nodes

Marks of Nodes

Structure of the Marked PQ Tree

Restrict(T,S)

Restricting a P Node with Partial Children

Restricting a P node with no Partial Children

Restricting a Q node

Directing a P Node

Directing a Q Node

Example (1)

Example (2)

Example (3)

Example (4)

Example (5)

Example (6)

Example (7)

Example (8)

Example (9)

Example (10)

Example (11)

Example (12)

Linear Number of Nodes Processed

Number of Processed Nodes Amortized

Partials with Partial Children Below the Key Node

Restricting a P Node with Partial Children

Restricting a P node with no Partial Children

Restricting a Q node

Directing a P Node

Directing a Q Node

PQ Tree Notes

Example of Data Structure Trick

Applied Algorithms in a Nutshell (1)

Applied Algorithms in a Nutshell (2)

Applied Algorithms in a Nutshell (3)

Applied Algorithms in a Nutshell (4)

Author: Richard E. Ladner

Email: ladner@cs.washington.edu

Home Page: http://www.cs.washington.edu/education/courses/589/CurrentQtr/

Other information:
CSE 589: Applied Algorithms

Download presentation source