Problem 811. Genome Sequence 004: Long 3rd Generation Segment Correction

Created by Richard Zapor

Solve Later

{"relationships":[{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/document","targetMode":"","relationshipId":"rId1","target":"/matlab/document.xml"},{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/output","targetMode":"","relationshipId":"rId2","target":"/matlab/output.xml"}],"parts":[{"partUri":"/matlab/document.xml","relationship":[],"contentType":"application/vnd.mathworks.matlab.code.document+xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<w:document xmlns:w=\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\"><w:body><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>The Melopsittacus undulates genome, Parrot Budgerigar, was successfully sequenced in July 2012 using long 3rd Gen sequences provided by</w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:docLocation=\"http://www.pacificbiosciences.com/\"><w:r><w:t>PacBio</w:t></w:r></w:hyperlink><w:r><w:t>. The</w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:docLocation=\"http://assemblathon.org/a-parrot-a-fish-and-a-snake-walk-into-a-bar\"><w:r><w:t>Assemblathon Genome Contest</w:t></w:r></w:hyperlink><w:r><w:t> led the team of Phillippy, Koren and Jarvis to successfully</w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:docLocation=\"http://www.sciencedaily.com/releases/2012/07/120702210229.htm\"><w:r><w:t>Sequence Parrot DNA</w:t></w:r></w:hyperlink><w:r><w:t> using the PacBio 3rd Generation data and Illumina 2nd Gen data.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>The 3rd gen PacBio data is very long, 1K-20K, but has 15% error rate. The Illumina data is 100-500 long with &lt;1% error rate. Jarvis and his team combined this data to achieve &lt; 0.1% error rate.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Genome Challenge 004 is the correction of simplified PacBio simulated reads with high error rate.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:rPr><w:b/></w:rPr><w:t>Input:</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Call 1: empty array, segment Width, Flag=0</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Call 2: N PacBio DNA vectors (N x width), Segment Width, Flag=1</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:rPr><w:b/></w:rPr><w:t>Output:</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Call 1: empty vector, Number of Requested Vectors</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Call 2: Corrected DNA vector, Number of Requested Vectors</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:rPr><w:b/></w:rPr><w:t>Score:</w:t></w:r><w:r><w:t> Number of N vectors used to produce correct vector for w=1024 case</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>The first call to the PacBio_fix routine returns the number of vectors requested to produce a final product. This may be a function of w.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>The second call to PacBio_fix will have a DNA matix (N x width) and flag=1.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>The response to the second call is the fixed DNA sequence, vector of width w.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:rPr><w:b/></w:rPr><w:t>example:</w:t></w:r><w:r><w:t> First call return : N=3</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"code\"/></w:pPr><w:r><w:t><![CDATA[01230123111122223333 Truth\nInput example\n01232123112122221332 Injected errors\n01130123111122123323\n11230133121122223333\n\nOutput: \n01230123111122223333 Truth, hopefully]]></w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>This data is simplified by only having simple substitutions and the data sets are provided pre-aligned.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>The real PacBio data is quite a bit more complicated. Values may be added, deleted, substituted, and are of varying lengths. This causes alignment issues.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Follow-Up Challenges: Sample Data from the PacBio site for</w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:docLocation=\"http://www.cbcb.umd.edu/software/PBcR/\"><w:r><w:t>Lambda Phage</w:t></w:r></w:hyperlink><w:r><w:t> will be molded into various Challenges. Possible challenges are correcting individual long segments and assembling multiple long segments into the full Lambda Phage genome. The Parrot genome is too big for Cody to solve in 50 seconds.</w:t></w:r></w:p></w:body></w:document>"},{"partUri":"/matlab/output.xml","contentType":"text/xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\" standalone=\"no\" ?><embeddedOutputs><metaData><evaluationState>manual</evaluationState><layoutState>code</layoutState><outputStatus>ready</outputStatus></metaData><outputArray type=\"array\"/><regionArray type=\"array\"/></embeddedOutputs>"}]}

The Melopsittacus undulates genome, Parrot Budgerigar, was successfully sequenced in July 2012 using long 3rd Gen sequences provided by <a href="http://www.pacificbiosciences.com/">PacBio</a>. The <a href="http://assemblathon.org/a-parrot-a-fish-and-a-snake-walk-into-a-bar">Assemblathon Genome Contest</a> led the team of Phillippy, Koren and Jarvis to successfully <a href="http://www.sciencedaily.com/releases/2012/07/120702210229.htm">Sequence Parrot DNA</a> using the PacBio 3rd Generation data and Illumina 2nd Gen data.The 3rd gen PacBio data is very long, 1K-20K, but has 15% error rate. The Illumina data is 100-500 long with &lt;1% error rate. Jarvis and his team combined this data to achieve &lt; 0.1% error rate.Genome Challenge 004 is the correction of simplified PacBio simulated reads with high error rate.Input:Call 1: empty array, segment Width, Flag=0Call 2: N PacBio DNA vectors (N x width), Segment Width, Flag=1Output:Call 1: empty vector, Number of Requested VectorsCall 2: Corrected DNA vector, Number of Requested VectorsScore: Number of N vectors used to produce correct vector for w=1024 caseThe first call to the PacBio_fix routine returns the number of vectors requested to produce a final product. This may be a function of w.The second call to PacBio_fix will have a DNA matix (N x width) and flag=1.The response to the second call is the fixed DNA sequence, vector of width w.example:
First call return : N=3<pre class="language-matlab">01230123111122223333 Truth
Input example
01232123112122221332 Injected errors
01130123111122123323
11230133121122223333
</pre><pre class="language-matlab">Output: 
01230123111122223333 Truth, hopefully
</pre>This data is simplified by only having simple substitutions and the data sets are provided pre-aligned.The real PacBio data is quite a bit more complicated. Values may be added, deleted, substituted, and are of varying lengths. This causes alignment issues.Follow-Up Challenges: Sample Data from the PacBio site for <a href="http://www.cbcb.umd.edu/software/PBcR/">Lambda Phage</a> will be molded into various Challenges. Possible challenges are correcting individual long segments and assembling multiple long segments into the full Lambda Phage genome. The Parrot genome is too big for Cody to solve in 50 seconds.

Solve

Solution Stats

24 Solutions
3 Solvers

Last Solution submitted on Feb 20, 2019

Last 200 Solutions

Problem Recent Solvers3

Problem Tags

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Problem 811. Genome Sequence 004: Long 3rd Generation Segment Correction

Solution Stats

Last 200 Solutions

Problem Recent Solvers3

Suggested Problems

More from this Author247

Problem Tags

Community Treasure Hunt

Problem 811. Genome Sequence 004: Long 3rd Generation Segment Correction

Solution Stats

Last 200 Solutions

Problem Recent Solvers3

Suggested Problems

More from this Author247

Problem Tags

Community Treasure Hunt

Players