Home
Project Folders
Teacher Resources
Student Resources
How Do I?
Literacy
MWForum
Site Map
Search
Our Team

MWForum Message [Date Index] [Threads] [Authors] [Attachments] [Subscribe]

[Thread Prev] [Thread Next]

To: <MWcybercourse@xxxxxxxxxxxxxxx>
Subject: Re: Next Lesson
From: "Gary McCallister" <mccallis@xxxx>
Date: Fri, 12 Oct 2001 07:32:24 -0600

Mendelian assortment simply refers to the predictions made by Mendel about how 
certain dominant allelles are inherited. Tall peas crossed with short peas 
give a 1:2:1 assortment of geneotypes etc. If we could keep track of how many 
times a straight mouth occured with square noses etc. we could seeif 
assortment was occuring in the same manner as with genes. I am not sure how to 
program dominance and recessive traits in MW.

>>> dajoy@xxxx 10/11/01 06:32PM >>>
On 11 Oct 2001, at 14:58, Gary McCallister wrote:

> It would also
> be valuable to a biologist to be able to keep track of the
> varios offspring in some way so we could test the mendelian
> assortment taking place. Anyway, what do you all suggest?
>=20

I have some interest in genetic algorithms. And I have implemented some 
using=20
Logo.

What is the mendelian assortment?

Is it true that if you put a 20 families in a starship, in a trip to some=20
distant star, for say, 500 years, the intelligence traits of their 
decendants=20
would be noticeably reduced?


Daniel





Send messages to: MWcybercourse@xxxxxxxxxxxxxxx=20
To unsubscribe, e-mail: MWcybercourse-unsubscribe@xxxxxxxxxxxxxxx=20

MWcybercourse messages are archived at:
http://groups.yahoo.com/group/MWcybercourse=20




=20

Your use of Yahoo! Groups is subject to http://docs.yahoo.com/info/terms/=20





  • Previous by thread: Re: Next Lesson
  • Next by thread: Re: Next Lesson

  • To save an attachment to your computer, PC users should right-click (Mac users, click and hold the mouse button) on the link and then choose 'save target as' from the pop-up menu. A window will then pop up in which you can choose a location for the file.


    © copyright 2001 - 2008