Because only the ends of each fragment are sequenced

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: f mutually incompaEble reads is the same as the minimum number of transcripts needed to “explain” all the fragments. •  A proof of Dilworth's Theorem that produces a minimal set of paths that cover all the fragments in the overlap graph by finding the largest set of reads with the property that no two could have originated from the same isoform. 19 20 Transcript Abundance is EsEmated •  Fragments are matched to the transcripts from which they could have originated. •  Transcript abundance is es>mated using a staEsEcal model in which the probability of observing each fragment is a linear funcEon of the abundance of the transcripts from which it could have originated. •  Because only the ends of each fragment are sequenced, the length maybe unknown. 21 Violet fragment Assigning a fragment to different isoforms o^en implies a length for it. Cufflinks incorporates the distribuEon of fragment lengths to help assign...
View Full Document

This note was uploaded on 02/10/2014 for the course CS 680 taught by Professor Staff during the Fall '08 term at Colorado State.

Ask a homework question - tutors are online