restriction map 1 construct a plasmid restriction map of the following digest. include cuts and...

25
Restriction Map 1 Construct a plasmid restriction map of the following digest. Include cuts and fragment sizes. EcoR EcoR I I EcoRI + Hind Hind II II I I HindII I 7,000 7,000 6,000 10,000 10,000 3,000 3,000 3,000 1,000 Hind Hind II II I EcoR EcoRI 10K 1K 6K EcoR EcoR I = 2 sites I = 2 sites Hind Hind III = 1 site III = 1 site EcoR EcoRI 3k 3k 10k 10k 10k 10k 10k 10k 10k 10k 7k 7k 1.) Linear or Plasmid ? 2.) What’s the Size? 3.) How many cuts? 4.) Easy Cuts First! 5.) Find relationships! 6.) Rotate =10K =10K = 3 = 3 sites sites =HindIII =HindIII Linear: Fragments = cuts + 1 Plasmid : Fragments = cuts

Upload: moris-davidson

Post on 24-Dec-2015

220 views

Category:

Documents


1 download

TRANSCRIPT

Restriction Map 1Construct a plasmid restriction map of the

following digest. Include cuts and fragment sizes.

EcoREcoRII EcoRI + HindHindIIIIII

  HindIII  

7,0007,000 6,000 10,00010,000

3,0003,000 3,000

1,000HindHindIIIIII

EcoREcoRII

10K

1K

6K

EcoREcoRI = 2 sitesI = 2 sites

HindHindIII = 1 siteIII = 1 site

EcoREcoRII

3k3k

10k10k10k10k

10k10k

10k10k

7k7k1.) Linear or Plasmid ?2.) What’s the Size?3.) How many cuts?

4.) Easy Cuts First!5.) Find relationships!

6.) Rotate

=10K=10K= 3 sites= 3 sites

=HindIII=HindIII

Linear: Fragments = cuts + 1Plasmid : Fragments = cuts

Restriction Map 2Construct a plasmid restriction map of the following

digest. Include cuts and fragment sizes.

HhaII HhaII + XhoI

  XhoI  

6,000 4,000 6,000

2,000 HhaII

XhoI

6K 2K4K

HhaHhaII = 1 siteII = 1 site

XhoXhoI = 1 siteI = 1 site

Restriction Map 3Restriction Map 3A RIVER runs from Stanton to Fredericksburg. Two Cabins are located on this stretch of river. The Teelin’s cabin and the Larson’s cabin are 5 km apart. The Larson’s cabin is 8 km from Stanton while the Teelin’s cabin is 11 km from Fredericksburg.

Using the data, make a mapmake a map of the river and the cabins located along it. Use a horizontal free line to represent the river and symbols to represent the cabins. Label the symbols and intervals between symbols with the measurements of distance between the cabins.

– How far is the Teelin’s cabin to Stanton?How far is the Teelin’s cabin to Stanton?– How far is the Larson’s cabin to Fredericksburg?How far is the Larson’s cabin to Fredericksburg?– Is there an alternate Map?Is there an alternate Map?

Stan

ton

Stan

ton

Larso

n’s

Larso

n’s

Teelin

’sT

eelin’s

Fred

ericksbu

rgF

redericksb

urg

8 km8 km 5 km5 km 11 km11 km

Stan

ton

Stan

ton

Larso

n’s

Larso

n’s

Teelin

’sT

eelin’s

Fred

ericksbu

rgF

redericksb

urg

8 km8 km 11 km11 km

5 km5 km

How far is the Teelin’s cabin to Stanton? How far is the Larson’s cabin to Fredericksburg?Is there an alternate Map?

13K13Kmm 16K16K

mmYou Betcha , See You Betcha , See Below!Below!

Now how far is the Teelin’s cabin to Stanton? Now how far is the Larson’s cabin to Fredericksburg?

3Km3Km6Km6Km

Restriction Map 4Restriction Map 4There are towns along highway 28 running east to west. Using the data below, make a mapmake a map of highway 28 and the towns located along it. Use a free horizontal line to represent highway 28 and symbols to represent towns. Label the intervals between the towns with the measurements of distance.

•Freeville : Mt. Crumpit Freeville : Mt. Crumpit 160 km160 km•Mt. Crumpit : WhovilleMt. Crumpit : Whoville 200 km200 km•Waterville : FreevilleWaterville : Freeville 120 km120 km•Whoville : WatervilleWhoville : Waterville 240 km240 km•Mt. Crumpit : WatervilleMt. Crumpit : Waterville 40 km 40 km•Freeville hunters get to start each hunting day 8 Freeville hunters get to start each hunting day 8 min. sooner than Waterville hunters.min. sooner than Waterville hunters.

EastEastWestWest

120K120K40K40K200K200K

Fre

evill

eF

reev

ille

Wat

ervi

lleW

ater

ville

Mt.

Cru

mpi

tM

t. C

rum

pit

Who

ville

Who

ville

Restriction Map 5Construct a Linear restriction map of the following

digest. Include cuts and fragment sizes.SamIII SamIII + TrpII

  TrpII  

13,00013,000 10,000 17,00017,000

9,0009,000 9,000 10,00010,000

5,0005,000 5,000

3,000

TrpIISamIIISamIII10K

10K10K17K17K

3K5K5K9K9K

27K27K

27K27K

27K27K

SamSamIII = 2 sitesIII = 2 sites

TrpTrpII = 1 siteII = 1 site

13K13K

Restriction Map 6Construct a plasmid restriction map of the following

digest. Include cuts and fragment sizes.

CabCabIIII CabII + MtGMtGII

  MtGI  

6,0006,000 4,500 8,0008,000

3,0003,000 2,500 2,0002,000

1,0001,000 1,500

1,000

10K10K

500

8K8K

CabCabII = 3 sitesII = 3 sites

MtGMtGI = 2 siteI = 2 site

500

MtGMtGII

MtGMtGII2K2K10K10K

10K10K

10K10K

CabCabIIII1,500

CabCabIIIICabCabIIII

2,500

1,000

4,500

Restriction Map 73. There is a trail that runs along a mountain ridge in eastern Vermont

from James Camp to Camp Five. Using a horizontal line to represent the trail and dots to represent climbing features. Label the intervals between climbs with the measured distance.

• Blood Lake : Washington Peak 3 km• Washington Peak : Misery Rock 4.5 km• Hangman's Cliff : One Way Jacks Trail 1 km• James Camp : Jackson's Thrill 2 km• Hangman’s Cliff : Misery Rock 9.5 km• Washington’s Peak : Jackson’s Thrill 4 km• Jackson’s Thrill : Misery Rock .5 km• One Way Jacks Trail : Jackson’s Thrill 10 km• Blood Lake : Camp Five 6.5 km

• Jackson’s Thrill should be climbed in the sun before the sun sets behind Washington’s Peak

James C

amp

James C

amp

Misery R

ock

Misery R

ock

Jackson

’s Th

rillJackso

n’s T

hrill

Wash

ing

ton

’s Peak

Wash

ing

ton

’s Peak

Blo

od

Lake

Blo

od

Lake

Han

gm

an’s C

liffH

ang

man

’s Cliff

On

e Way Jack’s T

railO

ne W

ay Jack’s Trail

Cam

p V

Cam

p V

1K1K 3.5K3.5K2K2K3K3K4K4K.5.5KK

1.5K1.5K

Cow Person

Superhero samurai

Pirate

Problem set 1: #1

EcoRIEcoRIEcoRI + BamHI BamHIBamHI

10,000 8,000 10,000

2,000

10K10K

EcoRIEcoRI

BamHIBamHI

2K

8K

Problem set 1: #2

12K12K

EcoRIEcoRIBamHIBamHI

2K

4K

EcoRIEcoRIEcoRI + BamHI BamHIBamHI

8,000 6,000 12,000

4,000 4,000

2,000

EcoRIEcoRI

6K

Problem set 1: #3

12K12K

EcoRIEcoRI

BamHIBamHI

1K

6.5K

EcoRIEcoRIEcoRI + BamHI BamHIBamHI

8,000 6,500 6,500

4,000 4,000 5,500

1,000

500

EcoRIEcoRI

4K

500

BamHIBamHI

Problem set 1: #4ClaIClaI ClaIClaI +

HindIIIHindIII HindIIIHindIII

11,000 8,000 14,000

8,000 7,000 7,000

2,000 4,000

2,000

Cla

IC

laI

HindIIIHindIII

Cla

IC

laI

Hin

dIII

Hin

dIII

80008000 20002000 40004000 70007000

= 1site= 1site

ClaIClaI =2 sites=2 sites

Problem set 1: #5

HindIIIHindIII

Hin

dIII

Hin

dIII

= 2 sites= 2 sites

BamHIBamHI =1 site=1 site

HindIIIHindIII HindIII HindIII

+ BamHIBamHI

BamHIBamHI

15,000 15,000 18,000

10,000 7,000 13,000

6,000 6,000

3,000

1500015000 30003000 70007000 60006000B

amH

IB

amH

I

Hin

dIII

Hin

dIII

Problem set 1: #6

SmaISmaI

Sm

aIS

maI

= 4 sites= 4 sites

PvuIPvuI = 4 sites= 4 sites

Pvu

IP

vuI

3200320055005500 28002800

Pvu

IP

vuI

PvulPvul SmalSmal + PvulPvul SmalSmal

8,800 8,000 11,800

8,000 5,500 8,700

6,700 4,500 7300

6000 3,800 4200

5500 3200 3000

3000

2800

2200

2000S

maI

Sm

aI

45004500 20002000P

vuI

Pvu

I22002200 30003000

Sm

aIS

maI

Sm

aIS

maI

38003800

Pvu

IP

vuI

80008000

Problem set 2: #7EcoRIEcoRI EcoRIEcoRI +

BamHIBamHI BamHIBamHI

6,000 4,500 8,000

3,000 2,500 2,000

1,000 1,500

500

BamHIBamHI1,0001,000

= 2site= 2site

EcoRIEcoRI =3 sites=3 sites

BamHIBamHI

BamHIBamHI

EcoRIEcoRIEcoRIEcoRI

EcoRIEcoRI

2,5002,500

500500

1,5001,500

4,5004,500

Problem set 2: #8

Eco

RI

Eco

RI

Eco

RI

Eco

RI

Hin

dIII

Hin

dIII

Bam

HI

Bam

HI

3,5003,500 4,5004,500 9,0009,000

Bam

HI

Bam

HI

1,0001,000H

indI

IIH

indI

II1,8001,800 2,2002,200 5,0005,000 1,5001,500

Eco

RI

Eco

RI

EcoRIEcoRI + BamHI

BamHIBamHI+ HindIII

HindIIIHindIII + EcoRI

18,000 9,000 11,500 9,000 16,300 14,500

5,000 8,000 9,000 8,700 8,700 5,000

4,000 5,000 8,000 4,500 3,500 3,500

1,500 4,000 3,500 2,200

1,500 2,800 1,800

1,000 1,500

8,0008,000 4,0004,000

Problem set 2: #9EcoRIEcoRI EcoRIEcoRI +

BamHIBamHI BamHIBamHI

9,000 8,000 11,000

6,000 6,000 7,000

3,000 3,000

1,000

Eco

RI

Eco

RI

BamHIBamHI

Eco

RI

Eco

RI

Bam

HI

Bam

HI

6,0006,000 1,0001,000 8,0008,000 3,0003,000

= 1site= 1site

EcoRIEcoRI =2 sites=2 sites

Problem set 2: #10

EcoRIEcoRIEcoRI EcoRI

+ BamHIBamHI

BamHIBamHI HindIIIHindIIIHindIII HindIII

+ EcoRIEcoRI

ClaI ClaI +

EcoRIEcoRIClaIClaI

14,000 9,000 17,000 12,000 11,000 14,000 19,000

9,000 8,000 6,000 11,000 9,000 5,000 4,000

6,000 3,000 4,000

Bam

HI

Bam

HI

Hin

dIII

Hin

dIII

Eco

RI

Eco

RI

Cla

IC

laI

6,0006,000 5,0005,000 3,0003,000 5,0005,000 4,0004,000

Quick Draw Δ (linear)

SnaTIISnaTII

SnaTIISnaTII+ BkaIBkaI

BkaIBkaI

16,000 15,000 18,000

15,000 13,000 13,000

3,000S

naT

IIS

naT

II

15,00015,000 3,0003,000 13,00013,000B

kaI

Bka

I

31,000

Quick Draw Σ (Plasmid)

TtHIITtHII TtHIITtHII + ZtoPIZtoPI ZtoPIZtoPI

8,500 8,000 8,500

500

TtHIITtHII ZtoPIZtoPI

8,0008,000

500500

8,5008,500

Quick Draw Ω (linear)

SpaZIIISpaZIII

SpaZIIISpaZIII+ HmmIHmmI

HmmIHmmI

115 100 130

40 30 15

15 10

10

Spa

ZII

IS

paZ

III

1010 3030 100100

Hm

mI

Hm

mI

Hm

mI

Hm

mI

1515

155

Quick Draw β (Plasmid)

RamIIRamII RamIIRamII + PhaTIPhaTI PhaTIPhaTI

8,500 8,500 11,000

2,500 2,000

500

RamIIRamII

PhaTIPhaTI

2,0002,000500500

8,5008,500

RamIIRamII

11,00011,000