« ALEA Home | Email msg. | Reply to msg. | Post new | Board info. Previous | Home | Next

Repetitive elements

By: DigSpace in ALEA | Recommend this post (0)
Fri, 04 Jul 14 3:11 AM | 23 view(s)
Boardmark this board | The Trust Matrix
Msg. 15785 of 54959
(This msg. is a reply to 15784 by DigSpace)

Jump:
Jump to board:
Jump to msg. #

Take that same encyclopedia, but imagine it being read and transcribed onto the same string of words with punctuation and all (no difference so far) but that the reader occasionally said the word "um" and did it in strings, sometimes 20 or 30 "um"s.

This string then cut into the same 5-7 word fragments by the same preschoolers and dumped into computer would not be solvable. The non-um part would be solved, and then there would be brackets for any um elements in excess of 7 words or so and it would simply be called a "um element" . There is no way with 5-7 word fragments to assemble conclusively a 20 um sequence. 20 ums and 2000 ums look identical.

One could count the number of pages in the encyclopedia, know the font size, and speak towards the total number of ums, but they cannot define the specific size of a particular um element.

Such is the case with things like the human genome.


- - - - -
View Replies (2) »



» You can also:
- - - - -
The above is a reply to the following message:
An "assembly"
By: DigSpace
in ALEA
Fri, 04 Jul 14 2:49 AM
Msg. 15784 of 54959

Imagine one took 1000 copies of Encyclopedia Britanica printed out as one long linear string of words with punctuation and all and then had a group of preschoolers randomly cutting it up into fragments averaging 5-7 words. One could dump those fragments into a computer and get the Encyclopedia to come out the other end ... an "assembly". That is modern genomics in a nutshell. The number of overlapping instances throughout the entire encyclopedia is a measure of "coverage" and today, 50x coverage is a piece of cake.


« ALEA Home | Email msg. | Reply to msg. | Post new | Board info. Previous | Home | Next