Loading…

Clover: a clustering-oriented de novo assembler for Illumina sequences

Next-generation sequencing technologies revolutionized genomics by producing high-throughput reads at low cost, and this progress has prompted the recent development of de novo assemblers. Multiple assembly methods based on de Bruijn graph have been shown to be efficient for Illumina reads. However,...

Full description

Saved in:
Bibliographic Details
Published in:BMC bioinformatics 2020-11, Vol.21 (1), p.528-13, Article 528
Main Authors: Hsieh, Ming-Feng, Lu, Chin Lung, Tang, Chuan Yi
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c564t-1c86bfb6c2646336e4cc57eebac17601c67fe4c79a0d951565cce9ce053a88d03
cites cdi_FETCH-LOGICAL-c564t-1c86bfb6c2646336e4cc57eebac17601c67fe4c79a0d951565cce9ce053a88d03
container_end_page 13
container_issue 1
container_start_page 528
container_title BMC bioinformatics
container_volume 21
creator Hsieh, Ming-Feng
Lu, Chin Lung
Tang, Chuan Yi
description Next-generation sequencing technologies revolutionized genomics by producing high-throughput reads at low cost, and this progress has prompted the recent development of de novo assemblers. Multiple assembly methods based on de Bruijn graph have been shown to be efficient for Illumina reads. However, the sequencing errors generated by the sequencer complicate analysis of de novo assembly and influence the quality of downstream genomic researches. In this paper, we develop a de Bruijn assembler, called Clover (clustering-oriented de novo assembler), that utilizes a novel k-mer clustering approach from the overlap-layout-consensus concept to deal with the sequencing errors generated by the Illumina platform. We further evaluate Clover's performance against several de Bruijn graph assemblers (ABySS, SOAPdenovo, SPAdes and Velvet), overlap-layout-consensus assemblers (Bambus2, CABOG and MSR-CA) and string graph assembler (SGA) on three datasets (Staphylococcus aureus, Rhodobacter sphaeroides and human chromosome 14). The results show that Clover achieves a superior assembly quality in terms of corrected N50 and E-size while remaining a significantly competitive in run time except SOAPdenovo. In addition, Clover was involved in the sequencing projects of bacterial genomes Acinetobacter baumannii TYTH-1 and Morganella morganii KT. The marvel clustering-based approach of Clover that integrates the flexibility of the overlap-layout-consensus approach and the efficiency of the de Bruijn graph method has high potential on de novo assembly. Now, Clover is freely available as open source software from https://oz.nthu.edu.tw/~d9562563/src.html .
doi_str_mv 10.1186/s12859-020-03788-9
format article
fullrecord <record><control><sourceid>gale_doaj_</sourceid><recordid>TN_cdi_doaj_primary_oai_doaj_org_article_9f1465817f3741efb7f74d33c39d71cf</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><galeid>A650489933</galeid><doaj_id>oai_doaj_org_article_9f1465817f3741efb7f74d33c39d71cf</doaj_id><sourcerecordid>A650489933</sourcerecordid><originalsourceid>FETCH-LOGICAL-c564t-1c86bfb6c2646336e4cc57eebac17601c67fe4c79a0d951565cce9ce053a88d03</originalsourceid><addsrcrecordid>eNptkl1rFTEQhhdRbK3-AS9kwSsvtiabby-EcrB6oCD4cR2ys5M1h91NTXYP9d8be2rtAclFwuR9H2aGt6peUnJOqZZvM221MA1pSUOY0roxj6pTyhVtWkrE4wfvk-pZzjtCqNJEPK1OGGsJY4KfVpebMe4xvatdDeOaF0xhHpqYAs4L9nWP9Rz3sXY549SNmGofU70dx3UKs6sz_lxxBszPqyfejRlf3N1n1ffLD982n5qrzx-3m4urBoTkS0NBy853ElrJJWMSOYBQiJ0DqiShIJUvNWUc6Y2gQgoANIBEMKd1T9hZtT1w--h29jqFyaVfNrpgbwsxDdalJcCI1njKpdBUeaY4Rd8pr3jPGDDTKwq-sN4fWNdrN2EPZeLkxiPo8c8cftgh7q2SqtVGFcDrO0CKZQ95sbu4prnMb1suqRZty8U_1eBKV2H2scBgChnshRSEa2MYK6rz_6jK6XEKEGf0odSPDG-ODEWz4M0yuDVnu_365VjbHrSQYs4J_f2QlNg_UbKHKNkSJXsbJWuK6dXD9dxb_maH_QbAdcJp</addsrcrecordid><sourcetype>Open Website</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2461852245</pqid></control><display><type>article</type><title>Clover: a clustering-oriented de novo assembler for Illumina sequences</title><source>PubMed Central Free</source><source>Publicly Available Content (ProQuest)</source><creator>Hsieh, Ming-Feng ; Lu, Chin Lung ; Tang, Chuan Yi</creator><creatorcontrib>Hsieh, Ming-Feng ; Lu, Chin Lung ; Tang, Chuan Yi</creatorcontrib><description>Next-generation sequencing technologies revolutionized genomics by producing high-throughput reads at low cost, and this progress has prompted the recent development of de novo assemblers. Multiple assembly methods based on de Bruijn graph have been shown to be efficient for Illumina reads. However, the sequencing errors generated by the sequencer complicate analysis of de novo assembly and influence the quality of downstream genomic researches. In this paper, we develop a de Bruijn assembler, called Clover (clustering-oriented de novo assembler), that utilizes a novel k-mer clustering approach from the overlap-layout-consensus concept to deal with the sequencing errors generated by the Illumina platform. We further evaluate Clover's performance against several de Bruijn graph assemblers (ABySS, SOAPdenovo, SPAdes and Velvet), overlap-layout-consensus assemblers (Bambus2, CABOG and MSR-CA) and string graph assembler (SGA) on three datasets (Staphylococcus aureus, Rhodobacter sphaeroides and human chromosome 14). The results show that Clover achieves a superior assembly quality in terms of corrected N50 and E-size while remaining a significantly competitive in run time except SOAPdenovo. In addition, Clover was involved in the sequencing projects of bacterial genomes Acinetobacter baumannii TYTH-1 and Morganella morganii KT. The marvel clustering-based approach of Clover that integrates the flexibility of the overlap-layout-consensus approach and the efficiency of the de Bruijn graph method has high potential on de novo assembly. Now, Clover is freely available as open source software from https://oz.nthu.edu.tw/~d9562563/src.html .</description><identifier>ISSN: 1471-2105</identifier><identifier>EISSN: 1471-2105</identifier><identifier>DOI: 10.1186/s12859-020-03788-9</identifier><identifier>PMID: 33203354</identifier><language>eng</language><publisher>England: BioMed Central Ltd</publisher><subject>Algorithms ; Assemblers ; Assembling (Electronic computers) ; Assembly ; Base Sequence ; Chromosome 14 ; Chromosomes ; Chromosomes, Human, Pair 14 - genetics ; Cluster Analysis ; Clustering ; Clustering (Computers) ; Datasets ; De bruijn graph ; De novo genome assembly ; Design and construction ; DNA sequencing ; Flexibility ; Genome, Bacterial ; Genomes ; Genomics ; Genomics - methods ; Graph theory ; High-Throughput Nucleotide Sequencing ; Humans ; Layouts ; Methods ; Next-generation sequencing ; Nucleotide sequencing ; Public software ; Software ; Time Factors</subject><ispartof>BMC bioinformatics, 2020-11, Vol.21 (1), p.528-13, Article 528</ispartof><rights>COPYRIGHT 2020 BioMed Central Ltd.</rights><rights>2020. This work is licensed under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><rights>The Author(s) 2020</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c564t-1c86bfb6c2646336e4cc57eebac17601c67fe4c79a0d951565cce9ce053a88d03</citedby><cites>FETCH-LOGICAL-c564t-1c86bfb6c2646336e4cc57eebac17601c67fe4c79a0d951565cce9ce053a88d03</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://www.ncbi.nlm.nih.gov/pmc/articles/PMC7672897/pdf/$$EPDF$$P50$$Gpubmedcentral$$Hfree_for_read</linktopdf><linktohtml>$$Uhttps://www.proquest.com/docview/2461852245?pq-origsite=primo$$EHTML$$P50$$Gproquest$$Hfree_for_read</linktohtml><link.rule.ids>230,314,727,780,784,885,25753,27924,27925,37012,44590,53791,53793</link.rule.ids><backlink>$$Uhttps://www.ncbi.nlm.nih.gov/pubmed/33203354$$D View this record in MEDLINE/PubMed$$Hfree_for_read</backlink></links><search><creatorcontrib>Hsieh, Ming-Feng</creatorcontrib><creatorcontrib>Lu, Chin Lung</creatorcontrib><creatorcontrib>Tang, Chuan Yi</creatorcontrib><title>Clover: a clustering-oriented de novo assembler for Illumina sequences</title><title>BMC bioinformatics</title><addtitle>BMC Bioinformatics</addtitle><description>Next-generation sequencing technologies revolutionized genomics by producing high-throughput reads at low cost, and this progress has prompted the recent development of de novo assemblers. Multiple assembly methods based on de Bruijn graph have been shown to be efficient for Illumina reads. However, the sequencing errors generated by the sequencer complicate analysis of de novo assembly and influence the quality of downstream genomic researches. In this paper, we develop a de Bruijn assembler, called Clover (clustering-oriented de novo assembler), that utilizes a novel k-mer clustering approach from the overlap-layout-consensus concept to deal with the sequencing errors generated by the Illumina platform. We further evaluate Clover's performance against several de Bruijn graph assemblers (ABySS, SOAPdenovo, SPAdes and Velvet), overlap-layout-consensus assemblers (Bambus2, CABOG and MSR-CA) and string graph assembler (SGA) on three datasets (Staphylococcus aureus, Rhodobacter sphaeroides and human chromosome 14). The results show that Clover achieves a superior assembly quality in terms of corrected N50 and E-size while remaining a significantly competitive in run time except SOAPdenovo. In addition, Clover was involved in the sequencing projects of bacterial genomes Acinetobacter baumannii TYTH-1 and Morganella morganii KT. The marvel clustering-based approach of Clover that integrates the flexibility of the overlap-layout-consensus approach and the efficiency of the de Bruijn graph method has high potential on de novo assembly. Now, Clover is freely available as open source software from https://oz.nthu.edu.tw/~d9562563/src.html .</description><subject>Algorithms</subject><subject>Assemblers</subject><subject>Assembling (Electronic computers)</subject><subject>Assembly</subject><subject>Base Sequence</subject><subject>Chromosome 14</subject><subject>Chromosomes</subject><subject>Chromosomes, Human, Pair 14 - genetics</subject><subject>Cluster Analysis</subject><subject>Clustering</subject><subject>Clustering (Computers)</subject><subject>Datasets</subject><subject>De bruijn graph</subject><subject>De novo genome assembly</subject><subject>Design and construction</subject><subject>DNA sequencing</subject><subject>Flexibility</subject><subject>Genome, Bacterial</subject><subject>Genomes</subject><subject>Genomics</subject><subject>Genomics - methods</subject><subject>Graph theory</subject><subject>High-Throughput Nucleotide Sequencing</subject><subject>Humans</subject><subject>Layouts</subject><subject>Methods</subject><subject>Next-generation sequencing</subject><subject>Nucleotide sequencing</subject><subject>Public software</subject><subject>Software</subject><subject>Time Factors</subject><issn>1471-2105</issn><issn>1471-2105</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2020</creationdate><recordtype>article</recordtype><sourceid>PIMPY</sourceid><sourceid>DOA</sourceid><recordid>eNptkl1rFTEQhhdRbK3-AS9kwSsvtiabby-EcrB6oCD4cR2ys5M1h91NTXYP9d8be2rtAclFwuR9H2aGt6peUnJOqZZvM221MA1pSUOY0roxj6pTyhVtWkrE4wfvk-pZzjtCqNJEPK1OGGsJY4KfVpebMe4xvatdDeOaF0xhHpqYAs4L9nWP9Rz3sXY549SNmGofU70dx3UKs6sz_lxxBszPqyfejRlf3N1n1ffLD982n5qrzx-3m4urBoTkS0NBy853ElrJJWMSOYBQiJ0DqiShIJUvNWUc6Y2gQgoANIBEMKd1T9hZtT1w--h29jqFyaVfNrpgbwsxDdalJcCI1njKpdBUeaY4Rd8pr3jPGDDTKwq-sN4fWNdrN2EPZeLkxiPo8c8cftgh7q2SqtVGFcDrO0CKZQ95sbu4prnMb1suqRZty8U_1eBKV2H2scBgChnshRSEa2MYK6rz_6jK6XEKEGf0odSPDG-ODEWz4M0yuDVnu_365VjbHrSQYs4J_f2QlNg_UbKHKNkSJXsbJWuK6dXD9dxb_maH_QbAdcJp</recordid><startdate>20201117</startdate><enddate>20201117</enddate><creator>Hsieh, Ming-Feng</creator><creator>Lu, Chin Lung</creator><creator>Tang, Chuan Yi</creator><general>BioMed Central Ltd</general><general>BioMed Central</general><general>BMC</general><scope>CGR</scope><scope>CUY</scope><scope>CVF</scope><scope>ECM</scope><scope>EIF</scope><scope>NPM</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>ISR</scope><scope>3V.</scope><scope>7QO</scope><scope>7SC</scope><scope>7X7</scope><scope>7XB</scope><scope>88E</scope><scope>8AL</scope><scope>8AO</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FH</scope><scope>8FI</scope><scope>8FJ</scope><scope>8FK</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BBNVY</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>BHPHI</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FR3</scope><scope>FYUFA</scope><scope>GHDGH</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K7-</scope><scope>K9.</scope><scope>L7M</scope><scope>LK8</scope><scope>L~C</scope><scope>L~D</scope><scope>M0N</scope><scope>M0S</scope><scope>M1P</scope><scope>M7P</scope><scope>P5Z</scope><scope>P62</scope><scope>P64</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>Q9U</scope><scope>5PM</scope><scope>DOA</scope></search><sort><creationdate>20201117</creationdate><title>Clover: a clustering-oriented de novo assembler for Illumina sequences</title><author>Hsieh, Ming-Feng ; Lu, Chin Lung ; Tang, Chuan Yi</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c564t-1c86bfb6c2646336e4cc57eebac17601c67fe4c79a0d951565cce9ce053a88d03</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2020</creationdate><topic>Algorithms</topic><topic>Assemblers</topic><topic>Assembling (Electronic computers)</topic><topic>Assembly</topic><topic>Base Sequence</topic><topic>Chromosome 14</topic><topic>Chromosomes</topic><topic>Chromosomes, Human, Pair 14 - genetics</topic><topic>Cluster Analysis</topic><topic>Clustering</topic><topic>Clustering (Computers)</topic><topic>Datasets</topic><topic>De bruijn graph</topic><topic>De novo genome assembly</topic><topic>Design and construction</topic><topic>DNA sequencing</topic><topic>Flexibility</topic><topic>Genome, Bacterial</topic><topic>Genomes</topic><topic>Genomics</topic><topic>Genomics - methods</topic><topic>Graph theory</topic><topic>High-Throughput Nucleotide Sequencing</topic><topic>Humans</topic><topic>Layouts</topic><topic>Methods</topic><topic>Next-generation sequencing</topic><topic>Nucleotide sequencing</topic><topic>Public software</topic><topic>Software</topic><topic>Time Factors</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Hsieh, Ming-Feng</creatorcontrib><creatorcontrib>Lu, Chin Lung</creatorcontrib><creatorcontrib>Tang, Chuan Yi</creatorcontrib><collection>Medline</collection><collection>MEDLINE</collection><collection>MEDLINE (Ovid)</collection><collection>MEDLINE</collection><collection>MEDLINE</collection><collection>PubMed</collection><collection>CrossRef</collection><collection>Gale In Context: Science</collection><collection>ProQuest Central (Corporate)</collection><collection>Biotechnology Research Abstracts</collection><collection>Computer and Information Systems Abstracts</collection><collection>ProQuest_Health &amp; Medical Collection</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>Medical Database (Alumni Edition)</collection><collection>Computing Database (Alumni Edition)</collection><collection>ProQuest Pharma Collection</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Natural Science Collection</collection><collection>Hospital Premium Collection</collection><collection>Hospital Premium Collection (Alumni Edition)</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central</collection><collection>Advanced Technologies &amp; Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>Biological Science Collection</collection><collection>AUTh Library subscriptions: ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest Natural Science Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central</collection><collection>Engineering Research Database</collection><collection>Health Research Premium Collection</collection><collection>Health Research Premium Collection (Alumni)</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer science database</collection><collection>ProQuest Health &amp; Medical Complete (Alumni)</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>ProQuest Biological Science Collection</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>Computing Database</collection><collection>Health &amp; Medical Collection (Alumni Edition)</collection><collection>PML(ProQuest Medical Library)</collection><collection>ProQuest Biological Science Journals</collection><collection>ProQuest advanced technologies &amp; aerospace journals</collection><collection>ProQuest Advanced Technologies &amp; Aerospace Collection</collection><collection>Biotechnology and BioEngineering Abstracts</collection><collection>Publicly Available Content (ProQuest)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central Basic</collection><collection>PubMed Central (Full Participant titles)</collection><collection>Directory of Open Access Journals</collection><jtitle>BMC bioinformatics</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Hsieh, Ming-Feng</au><au>Lu, Chin Lung</au><au>Tang, Chuan Yi</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Clover: a clustering-oriented de novo assembler for Illumina sequences</atitle><jtitle>BMC bioinformatics</jtitle><addtitle>BMC Bioinformatics</addtitle><date>2020-11-17</date><risdate>2020</risdate><volume>21</volume><issue>1</issue><spage>528</spage><epage>13</epage><pages>528-13</pages><artnum>528</artnum><issn>1471-2105</issn><eissn>1471-2105</eissn><abstract>Next-generation sequencing technologies revolutionized genomics by producing high-throughput reads at low cost, and this progress has prompted the recent development of de novo assemblers. Multiple assembly methods based on de Bruijn graph have been shown to be efficient for Illumina reads. However, the sequencing errors generated by the sequencer complicate analysis of de novo assembly and influence the quality of downstream genomic researches. In this paper, we develop a de Bruijn assembler, called Clover (clustering-oriented de novo assembler), that utilizes a novel k-mer clustering approach from the overlap-layout-consensus concept to deal with the sequencing errors generated by the Illumina platform. We further evaluate Clover's performance against several de Bruijn graph assemblers (ABySS, SOAPdenovo, SPAdes and Velvet), overlap-layout-consensus assemblers (Bambus2, CABOG and MSR-CA) and string graph assembler (SGA) on three datasets (Staphylococcus aureus, Rhodobacter sphaeroides and human chromosome 14). The results show that Clover achieves a superior assembly quality in terms of corrected N50 and E-size while remaining a significantly competitive in run time except SOAPdenovo. In addition, Clover was involved in the sequencing projects of bacterial genomes Acinetobacter baumannii TYTH-1 and Morganella morganii KT. The marvel clustering-based approach of Clover that integrates the flexibility of the overlap-layout-consensus approach and the efficiency of the de Bruijn graph method has high potential on de novo assembly. Now, Clover is freely available as open source software from https://oz.nthu.edu.tw/~d9562563/src.html .</abstract><cop>England</cop><pub>BioMed Central Ltd</pub><pmid>33203354</pmid><doi>10.1186/s12859-020-03788-9</doi><tpages>13</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 1471-2105
ispartof BMC bioinformatics, 2020-11, Vol.21 (1), p.528-13, Article 528
issn 1471-2105
1471-2105
language eng
recordid cdi_doaj_primary_oai_doaj_org_article_9f1465817f3741efb7f74d33c39d71cf
source PubMed Central Free; Publicly Available Content (ProQuest)
subjects Algorithms
Assemblers
Assembling (Electronic computers)
Assembly
Base Sequence
Chromosome 14
Chromosomes
Chromosomes, Human, Pair 14 - genetics
Cluster Analysis
Clustering
Clustering (Computers)
Datasets
De bruijn graph
De novo genome assembly
Design and construction
DNA sequencing
Flexibility
Genome, Bacterial
Genomes
Genomics
Genomics - methods
Graph theory
High-Throughput Nucleotide Sequencing
Humans
Layouts
Methods
Next-generation sequencing
Nucleotide sequencing
Public software
Software
Time Factors
title Clover: a clustering-oriented de novo assembler for Illumina sequences
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-26T06%3A19%3A37IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-gale_doaj_&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Clover:%20a%20clustering-oriented%20de%20novo%20assembler%20for%20Illumina%20sequences&rft.jtitle=BMC%20bioinformatics&rft.au=Hsieh,%20Ming-Feng&rft.date=2020-11-17&rft.volume=21&rft.issue=1&rft.spage=528&rft.epage=13&rft.pages=528-13&rft.artnum=528&rft.issn=1471-2105&rft.eissn=1471-2105&rft_id=info:doi/10.1186/s12859-020-03788-9&rft_dat=%3Cgale_doaj_%3EA650489933%3C/gale_doaj_%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c564t-1c86bfb6c2646336e4cc57eebac17601c67fe4c79a0d951565cce9ce053a88d03%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2461852245&rft_id=info:pmid/33203354&rft_galeid=A650489933&rfr_iscdi=true