Genome-scale de novo assembly using ALGA
| Autor: | Wojciech Frohmberg, Jacek Blazewicz, Paweł T. Wojciechowski, Sylwester Swat, Aleksandra Swiercz, Jan Badura, Artur Laskowski, Marta Kasprzak |
|---|---|
| Rok vydání: | 2021 |
| Předmět: |
Statistics and Probability
Theoretical computer science AcademicSubjects/SCI01060 Computer science Sequence assembly Minimum spanning tree Biochemistry Genome De Bruijn graph Set (abstract data type) 03 medical and health sciences symbols.namesake 0302 clinical medicine Graph traversal Molecular Biology 030304 developmental biology De Bruijn sequence 0303 health sciences Genome Analysis Original Papers Graph Computer Science Applications Computational Mathematics Computational Theory and Mathematics symbols Graph (abstract data type) 030217 neurology & neurosurgery |
| Zdroj: | Bioinformatics |
| ISSN: | 1367-4811 1367-4803 |
| Popis: | Motivation There are very few methods for de novo genome assembly based on the overlap graph approach. It is considered as giving more exact results than the so-called de Bruijn graph approach but in much greater time and of much higher memory usage. It is not uncommon that assembly methods involving the overlap graph model are not able to successfully compute greater datasets, mainly due to memory limitation of a computer. This was the reason for developing in last decades mainly de Bruijn-based assembly methods, fast and fairly accurate. However, the latter methods can fail for longer or more repetitive genomes, as they decompose reads to shorter fragments and lose a part of information. An efficient assembler for processing big datasets and using the overlap graph model is still looked out. Results We propose a new genome-scale de novo assembler based on the overlap graph approach, designed for short-read sequencing data. The method, ALGA, incorporates several new ideas resulting in more exact contigs produced in short time. Among these ideas, we have creation of a sparse but quite informative graph, reduction of the graph including a procedure referring to the problem of minimum spanning tree of a local subgraph, and graph traversal connected with simultaneous analysis of contigs stored so far. What is rare in genome assembly, the algorithm is almost parameter-free, with only one optional parameter to be set by a user. ALGA was compared with nine state-of-the-art assemblers in tests on genome-scale sequencing data obtained from real experiments on six organisms, differing in size, coverage, GC content and repetition rate. ALGA produced best results in the sense of overall quality of genome reconstruction, understood as a good balance between genome coverage, accuracy and length of resulting sequences. The algorithm is one of tools involved in processing data in currently realized national project Genomic Map of Poland. Availability and implementation ALGA is available at http://alga.put.poznan.pl. Supplementary information Supplementary data are available at Bioinformatics online. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|