Evidence map›Paper›PMID 33471088›Full record

ArticleBioinformatics (Oxford, England)2021

Genome-scale de novo assembly using ALGA.

Sylwester Swat, Artur Laskowski, Jan Badura, Wojciech Frohmberg, Pawel Wojciechowski, Aleksandra Swiercz, Marta Kasprzak, Jacek Blazewicz

Abstract read
In one paragraph

Article in Bioinformatics (Oxford, England), 2021. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 4 papers.

0numbers the graph read from it
0cells of the map it votes in
4citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

4 citing papers in PubMed.

  1. Article
  2. Article
  3. Review
  4. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

8 authors.

Sylwester SwatPoznan University of Technology, Institute of Computing Science, 60-965 Poznan, Poland.
Artur LaskowskiPoznan University of Technology, Institute of Computing Science, 60-965 Poznan, Poland.
Jan BaduraPoznan University of Technology, Institute of Computing Science, 60-965 Poznan, Poland.
Wojciech FrohmbergPoznan University of Technology, Institute of Computing Science, 60-965 Poznan, Poland.
Pawel WojciechowskiPoznan University of Technology, Institute of Computing Science, 60-965 Poznan, Poland.
Aleksandra SwierczPoznan University of Technology, Institute of Computing Science, 60-965 Poznan, Poland.
Marta KasprzakPoznan University of Technology, Institute of Computing Science, 60-965 Poznan, Poland.ORCID 0000-0002-9863-5412
Jacek BlazewiczPoznan University of Technology, Institute of Computing Science, 60-965 Poznan, Poland.

Funding

European Center for Bioinformatics an Genomics project POIR.04.02.00-30-A004/16European Regional Development Fund
6 · The paper itself

Abstract

motivationThere 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.

resultsWe 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.

Identifiers

PMID33471088
PMCPMC8289375

What OpenQuestion holds

Textmetadata
LicenceCC BY-NC
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.