Deletion mapping Difficult, key and answer looking for a breakdown

Please let us know when you get something.  I believe this to be a pretty tough problem requiring a good bit of work, both thinking and explaining.

Ha yes, yes it is. If I can I will!!  Or if anyone is willing to help

I have an idea, but I'm not confident enough to assist

An idea is good, an idea can lead to an answer

Well my idea is very close to what the key says.  I just don't have anything more than a surface level understand of what they key says.  I had a similar question for a genetics class recently, but it wasn't nearly as complicated as this.

sooo hears a little more claritiy

The way to read the data is "this mutant failed to recombine with this mutant, so they must overlap". Then from the pattern of what deletions overlap with which other deletions, develop a map. This is where the pencil an paper come in handy.

 

I found it helpful to find the longest deletions and then the shortest deletions. Deletion 10 overlaps the most other deletions, so the first part of our map is a long box labeled "10". Next, the shortest ones. Deletion 3 only overlaps 10 and 6, so we'll put a box overlapping one end of 10 and label it "3" and draw another box that overlaps 3 and not 10 and label it "6".

Just continue using that same kind of logic ("this overlaps this and this, but not this") to finish part a.

 

Part b gives you similar data, but with point mutations. a overlaps 8 and 10; b overlaps 1 and 2; and so on.

 

Part c doesn't actually require the map. Remember the rule is "if two mutations fail to complement, then they're in the same gene". Point mutation "g" for example, complements with all of the other point mutations, so it is in its own gene.

One of the Ta's helped explain this

hi im new, look forward to utilizing this forum to expand my knwoledge