The computed minimum and maximum substrings from both

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: 65-2871 © The Author(s) 2009. Published by Oxford University Press. •  The 3+ end of the mapped read is defined as anchor point. •  Then pa[ern growth algorithm is used to search for minimum and maximum unique substrings from the 3+ end of unmapped reads within the range of two /mes of insert size star/ng from the anchor point. •  Using pa[ern growth algorithm again to search for minimum and maximum unique substrings from the 5+ of unmapped read within the range of read length+user defined maximum dele/on size star/ng from the already mapped 3+ end of the unmapped read. •  The computed minimum and maximum substrings from both 3+ and 5+ are examined. •  All possible solu/ons are stored in a database for sor/ng according to the break point coordinates. •  A dele/on event is reported if at least two reads support it. 41 Detecting deletion events. Ye K et al. Bioinformatics 2009;25:2865-2871 © The Author(s) 2009. Published by Oxford University Press. •  The 3+ end of the mapped read is defined as anchor point. •  Then pa[ern growth algorithm is used to search for minimum and maximum unique substrings from the 3+ end of unmapped reads within the range of two /mes of insert size star/ng from the anchor point. •  Using pa[ern growth algorithm again to search for minimum and maximum unique substrings from the 5+ of un...
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