PHYSICAL & LIFE SCIENCE TECHNOLOGIES
Sequencing technology Heightened accuracy
A new computer program provides a more accurate way of assembling DNA sequences from fragmented data
A better knowledge of human DNA sequences can improve our understanding of diseases and the mechanisms that trigger them. However, the full DNA strand contains a vast amount of genetic information, which is often too large and complex to be read in its entirety. To overcome this problem, scientists have devised tools that break the full strands into smaller fragments to ease the reading process, as well as systems to reassemble the data in their proper order. Niranjan Nagarajan at the A*STAR Genome Institute of Singapore and co-workers1
have now created a program called
Opera that could speed up the DNA reading process. Opera automatically finds the best way to piece together sequence fragments of DNA into longer strands. Their software produces fewer errors and has better overall assembly quality than ever before. The process of assembling DNA fragments is akin to solving a giant jigsaw puzzle. Due to the sheer scale and complexity of data analysis, with datasets that are hundreds of gigabytes in size, computer programs are required to handle the assembly process. Even so, there are problems with accuracy within these computer-generated sequences, because the programs operate using generalized rules of thumb and look for overlapping ends of fragments in order to link the pieces back together. For large groups of fragments, it is difficult to perform such a search in very repetitive genetic code, and the resulting strands contain errors. Nagarajan and co-workers created the Opera algorithm to optimize the ordering — or ‘scaffolding’ — of DNA strands, replacing the traditional generalized rules. “We designed an algorithm that exploits the features of real datasets and runs efficiently,” says Nagarajan. “With Opera you have a guarantee that natural optimization criterion will be met, so you know what you can expect.” The algorithm calculates a scaffolding solution for each set
of DNA fragments, and ‘explains’ its linking choices as it pro- gresses, showing how different options were investigated and eliminated. This provides the user with a clearer picture of the scaffolding and the progress achieved by the program. “The
62 A*STAR RESEARCH OCTOBER 2011– MARCH 2012
DNA strands must be broken up into smaller parts and reassembled, rather like a jigsaw puzzle, for specific types of analysis. The Opera program incorporates a new algorithm to improve the accuracy of reassembling DNA fragment data.
robustness of Opera arises from the fact that it does not rely on ad-hoc criteria in its algorithm,” says Nagarajan. “Instead it does an exhaustive search of all possibilities.” Nagarajan and his co-workers are continuing to improve the
program for more complex datasets. They are working towards a toolset for ‘perfect assembly’, or in other words, one that recon- structs the genome without any errors.
■
1. Gao, S., Sung, W.-K. & Nagarajan, N. Opera: Reconstructing optimal genomic scaffolds with high-throughput paired-end sequences. Journal of Computational Biology 18, 1681–1691 (2011).
Page 1 |
Page 2 |
Page 3 |
Page 4 |
Page 5 |
Page 6 |
Page 7 |
Page 8 |
Page 9 |
Page 10 |
Page 11 |
Page 12 |
Page 13 |
Page 14 |
Page 15 |
Page 16 |
Page 17 |
Page 18 |
Page 19 |
Page 20 |
Page 21 |
Page 22 |
Page 23 |
Page 24 |
Page 25 |
Page 26 |
Page 27 |
Page 28 |
Page 29 |
Page 30 |
Page 31 |
Page 32 |
Page 33 |
Page 34 |
Page 35 |
Page 36 |
Page 37 |
Page 38 |
Page 39 |
Page 40 |
Page 41 |
Page 42 |
Page 43 |
Page 44 |
Page 45 |
Page 46 |
Page 47 |
Page 48 |
Page 49 |
Page 50 |
Page 51 |
Page 52 |
Page 53 |
Page 54 |
Page 55 |
Page 56 |
Page 57 |
Page 58 |
Page 59 |
Page 60 |
Page 61 |
Page 62 |
Page 63 |
Page 64 |
Page 65 |
Page 66 |
Page 67 |
Page 68 |
Page 69 |
Page 70 |
Page 71 |
Page 72 |
Page 73 |
Page 74 |
Page 75 |
Page 76 |
Page 77 |
Page 78 |
Page 79 |
Page 80 |
Page 81 |
Page 82 |
Page 83 |
Page 84 |
Page 85 |
Page 86 |
Page 87 |
Page 88 |
Page 89 |
Page 90 |
Page 91 |
Page 92 |
Page 93 |
Page 94 |
Page 95 |
Page 96