{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T09:57:45Z","timestamp":1775037465343,"version":"3.50.1"},"reference-count":65,"publisher":"Oxford University Press (OUP)","license":[{"start":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T00:00:00Z","timestamp":1768953600000},"content-version":"vor","delay-in-days":20,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100009894","name":"Lodz University of Technology","doi-asserted-by":"publisher","award":["501\/12-24-1-5418"],"award-info":[{"award-number":["501\/12-24-1-5418"]}],"id":[{"id":"10.13039\/501100009894","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026,1,21]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:sec>\n                    <jats:title>Background<\/jats:title>\n                    <jats:p>FASTA is the primary format for representing DNA, RNA, and protein sequences. While progress has been made, specialized FASTA collection compressors still struggle with practical limitations and inconsistent performance across different datasets, hindering effective storage and transfer of large genomic datasets.<\/jats:p>\n                  <\/jats:sec>\n                  <jats:sec>\n                    <jats:title>Results<\/jats:title>\n                    <jats:p>We present an enhanced version of the Multiple Bacteria Genome Compressor (MBGC), a high-throughput, in-memory algorithm for compressing genome collections. It relies on information about maximum exact matches in the compressed set to identify possibly long approximate matches. It encodes them even when they partially overlap, boosting the compression ratio by an average of 14% across bacterial datasets, while the reengineered multithreaded decoding speeds up decompression compared to its predecessor by around 40%. The compression ratio improvement is even more pronounced on other collections, reaching 18% for Homo sapiens and up to 55% for Saccharomyces paradoxus. MBGC2 performs consistently across diverse datasets and introduces practical features to ease data management, such as archive appending, repacking, fast content listing, and flexible decompression options. Benchmark tests covering nucleotide-based bacterial, viral, and human genome collections show that MBGC2 combines compression efficiency and processing speed. The tool supports working with single genomes or amino acid collections but does not guarantee such high performance in these cases.<\/jats:p>\n                  <\/jats:sec>\n                  <jats:sec>\n                    <jats:title>Conclusions<\/jats:title>\n                    <jats:p>MBGC2 addresses critical limitations in genome collection compression by delivering reliable performance, improved compression ratios, and enhanced usability features. The consistent efficiency across diverse genomic datasets makes it a versatile tool for managing the growing volume of genomic data in research and clinical settings. The balance between compression ratio and speed positions MBGC2 as a practical solution for the storage and transfer of large genomic collections.<\/jats:p>\n                  <\/jats:sec>","DOI":"10.1093\/gigascience\/giag008","type":"journal-article","created":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T12:25:50Z","timestamp":1768911950000},"source":"Crossref","is-referenced-by-count":3,"title":["MBGC2: Boosting compression via efficient encoding of approximate matches in genome collections"],"prefix":"10.1093","volume":"15","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0953-3762","authenticated-orcid":false,"given":"Tomasz M","family":"Kowalski","sequence":"first","affiliation":[{"name":"Institute of Applied Computer Science, Lodz University of Technology , ul. Stefanowskiego 18, 90-537 Lodz ,","place":["Poland"]}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2026,1,21]]},"reference":[{"issue":"7","key":"2026022510263722900_bib1","doi-asserted-by":"publisher","first-page":"e1002195","DOI":"10.1371\/journal.pbio.1002195","article-title":"Big data: astronomical or genomical?","volume":"13","author":"Stephens","year":"2015","journal-title":"PLoS Biol"},{"issue":"4","key":"2026022510263722900_bib2","doi-asserted-by":"publisher","first-page":"56","DOI":"10.3390\/info7040056","article-title":"A survey on data compression methods for biological sequences","volume":"7","author":"Hosseini","year":"2016","journal-title":"Information"},{"issue":"7","key":"2026022510263722900_bib3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1093\/gigascience\/giaa072","article-title":"Sequence Compression Benchmark (SCB) database\u2014a comprehensive evaluation of reference-free compressors for FASTA-formatted sequences","volume":"9","author":"Kryukov","year":"2020","journal-title":"Gigascience"},{"issue":"1","key":"2026022510263722900_bib4","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/0092-8674(80)90131-2","article-title":"DNA rearrangements associated with a transposable element in yeast","volume":"21","author":"Roeder","year":"1980","journal-title":"Cell"},{"issue":"7793","key":"2026022510263722900_bib5","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1038\/s41586-019-1913-9","article-title":"Patterns of somatic structural variation in human cancer genomes","volume":"578","author":"Li","year":"2020","journal-title":"Nature"},{"issue":"1","key":"2026022510263722900_bib6","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1186\/s44342-024-00018-z","article-title":"Compression rates of microbial genomes are associated with genome size and base composition","volume":"22","author":"Bohlin","year":"2024","journal-title":"Genom Inform"},{"issue":"8","key":"2026022510263722900_bib7","doi-asserted-by":"publisher","first-page":"980","DOI":"10.1002\/gepi.22257","article-title":"Estimation of DNA contamination and its sources in genotyped samples","volume":"43","author":"Zajac","year":"2019","journal-title":"Genet Epidemiol"},{"key":"2026022510263722900_bib8","doi-asserted-by":"publisher","first-page":"102449","DOI":"10.1016\/j.fsigen.2020.102449","article-title":"The analogy between DNA kinship and DNA mixture evaluation, with applications for the interpretation of likelihood ratios produced by possibly imperfect models","volume":"52","author":"Slooten","year":"2021","journal-title":"Forensic Sci Int Gen"},{"key":"2026022510263722900_bib9","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1109\/DCC.1993.253115","article-title":"Compression of DNA sequences","volume-title":"Proceedings of the Data Compression Conference\u00a0(DCC 1993), Snowbird, Utah, USA","author":"Grumbach","year":"1993"},{"key":"2026022510263722900_bib10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s12859-015-0628-7","article-title":"Light-weight reference-based compression of FASTQ data","volume":"16","author":"Zhang","year":"2015","journal-title":"BMC Bioinformatics"},{"issue":"4","key":"2026022510263722900_bib11","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/s10142-023-01259-x","article-title":"A new efficient referential genome compression technique for FastQ files","volume":"23","author":"Kumar","year":"2023","journal-title":"Funct Int Genom"},{"issue":"2","key":"2026022510263722900_bib12","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1093\/bioinformatics\/btn582","article-title":"Human genomes as email attachments","volume":"25","author":"Christley","year":"2009","journal-title":"Bioinformatics"},{"issue":"17","key":"2026022510263722900_bib13","doi-asserted-by":"publisher","first-page":"2199","DOI":"10.1093\/bioinformatics\/btt362","article-title":"The human genome contracts again","volume":"29","author":"Pavlichin","year":"2013","journal-title":"Bioinformatics"},{"issue":"3","key":"2026022510263722900_bib14","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1093\/bioinformatics\/btu698","article-title":"iDoComp: a compression scheme for assembled genomes","volume":"31","author":"Ochoa","year":"2015","journal-title":"Bioinformatics"},{"issue":"22","key":"2026022510263722900_bib15","doi-asserted-by":"publisher","first-page":"3405","DOI":"10.1093\/bioinformatics\/btw505","article-title":"NRGC: a novel referential genome compression algorithm","volume":"32","author":"Saha","year":"2016","journal-title":"Bioinformatics"},{"issue":"1","key":"2026022510263722900_bib16","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1109\/TCBB.2017.2762302","article-title":"Clustering-based compression for population DNA sequences","volume":"16","author":"Cheng","year":"2017","journal-title":"IEEE\/ACM Trans Comput Biol Bioinform"},{"key":"2026022510263722900_bib17","doi-asserted-by":"publisher","first-page":"3108950","DOI":"10.1155\/2019\/3108950","article-title":"HRCM: an efficient hybrid referential compression method for genomic big data","volume":"2019","author":"Yao","year":"2019","journal-title":"BioMed Res Int"},{"issue":"18","key":"2026022510263722900_bib18","doi-asserted-by":"publisher","first-page":"4675","DOI":"10.1093\/bioinformatics\/btaa572","article-title":"Allowing mutations in maximal matches boosts genome compression performance","volume":"36","author":"Liu","year":"2020","journal-title":"Bioinformatics"},{"issue":"1","key":"2026022510263722900_bib19","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1186\/s12859-023-05500-z","article-title":"Reference-based genome compression using the longest matched substrings with parallelization consideration","volume":"24","author":"Lu","year":"2023","journal-title":"BMC Bioinformatics"},{"issue":"5","key":"2026022510263722900_bib20","doi-asserted-by":"publisher","first-page":"e0232942","DOI":"10.1371\/journal.pone.0232942","article-title":"Vertical lossless genomic data compression tools for assembled genomes: a systematic literature review","volume":"15","author":"Kredens","year":"2020","journal-title":"PLoS One"},{"key":"2026022510263722900_bib21","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1109\/DCC.2007.7","article-title":"A simple statistical algorithm for biological sequence compression","volume-title":"Proceedings of the Data Compression Conference (DCC 2007), Snowbird, Utah, USA","author":"Cao","year":"2007"},{"issue":"1","key":"2026022510263722900_bib22","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1093\/BIOINFORMATICS\/BTT594","article-title":"MFCompress: a compression tool for FASTA and multi-FASTA data","volume":"30","author":"Pinho","year":"2014","journal-title":"Bioinformatics"},{"issue":"19","key":"2026022510263722900_bib23","doi-asserted-by":"publisher","first-page":"2527","DOI":"10.1093\/bioinformatics\/bts467","article-title":"DELIMINATE\u2014a fast and efficient method for loss-less compression of genomic sequences: sequence analysis","volume":"28","author":"Mohammed","year":"2012","journal-title":"Bioinformatics"},{"issue":"15","key":"2026022510263722900_bib24","doi-asserted-by":"publisher","first-page":"2213","DOI":"10.1093\/bioinformatics\/btu208","article-title":"DSRC 2\u2014industry-oriented compression of FASTQ files","volume":"30","author":"Roguski","year":"2014","journal-title":"Bioinformatics"},{"key":"2026022510263722900_bib25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s12859-015-0709-7","article-title":"Reference-free compression of high throughput sequencing data with a probabilistic de Bruijn graph","volume":"16","author":"Benoit","year":"2015","journal-title":"BMC Bioinformatics"},{"key":"2026022510263722900_bib26","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/978-3-030-23873-5_17","article-title":"GeCo2: an optimized tool for lossless compression and analysis of DNA sequences","volume-title":"International Conference on Practical Applications of Computational Biology and Bioinformatics (PACBB 2019), \u00c1vila, Spain","author":"Pratas","year":"2019"},{"issue":"11","key":"2026022510263722900_bib27","doi-asserted-by":"publisher","first-page":"giaa119","DOI":"10.1093\/gigascience\/giaa119","article-title":"Efficient DNA sequence compression with neural networks","volume":"9","author":"Silva","year":"2020","journal-title":"Gigascience"},{"issue":"12","key":"2026022510263722900_bib28","doi-asserted-by":"publisher","first-page":"btae725","DOI":"10.1093\/bioinformatics\/btae725","article-title":"JARVIS3: an efficient encoder for genomic data","volume":"40","author":"Sousa","year":"2024","journal-title":"Bioinformatics"},{"key":"2026022510263722900_bib29","doi-asserted-by":"publisher","first-page":"103083","DOI":"10.1016\/j.inffus.2025.103083","article-title":"Efficient genome sequence compression via the fusion of MDL-based heuristics","volume":"120","author":"Nawaz","year":"2025","journal-title":"Inform Fusion"},{"issue":"11","key":"2026022510263722900_bib30","doi-asserted-by":"publisher","first-page":"1415","DOI":"10.1093\/bioinformatics\/bts173","article-title":"Large-scale compression of genomic sequence databases with the Burrows\u2013Wheeler transform","volume":"28","author":"Cox","year":"2012","journal-title":"Bioinformatics"},{"issue":"1","key":"2026022510263722900_bib31","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1093\/bioinformatics\/btt257","article-title":"Adaptive reference-free compression of sequence quality scores","volume":"30","author":"Janin","year":"2014","journal-title":"Bioinformatics"},{"issue":"3","key":"2026022510263722900_bib32","doi-asserted-by":"publisher","first-page":"e59190","DOI":"10.1371\/journal.pone.0059190","article-title":"Compression of FASTQ and SAM format sequencing data","volume":"8","author":"Bonfield","year":"2013","journal-title":"PLoS One"},{"issue":"15","key":"2026022510263722900_bib33","doi-asserted-by":"publisher","first-page":"2674","DOI":"10.1093\/bioinformatics\/bty1015","article-title":"SPRING: a next-generation compressor for FASTQ data","volume":"35","author":"Chandak","year":"2019","journal-title":"Bioinformatics"},{"issue":"19","key":"2026022510263722900_bib34","doi-asserted-by":"publisher","first-page":"3826","DOI":"10.1093\/bioinformatics\/btz144","article-title":"Nucleotide Archival Format (NAF) enables efficient lossless reference-free compression of DNA sequences","volume":"35","author":"Kryukov","year":"2019","journal-title":"Bioinformatics"},{"issue":"7","key":"2026022510263722900_bib35","doi-asserted-by":"publisher","first-page":"e1009229","DOI":"10.1371\/journal.pcbi.1009229","article-title":"Hamming-shifting graph of genomic short reads: efficient construction and its application for compression","volume":"17","author":"Liu","year":"2021","journal-title":"PLoS Comput Biol"},{"issue":"7","key":"2026022510263722900_bib36","doi-asserted-by":"publisher","first-page":"2082","DOI":"10.1093\/bioinformatics\/btz919","article-title":"PgRC: pseudogenome-based read compressor","volume":"36","author":"Kowalski","year":"2020","journal-title":"Bioinformatics"},{"issue":"3","key":"2026022510263722900_bib37","doi-asserted-by":"publisher","first-page":"btaf101","DOI":"10.1093\/bioinformatics\/btaf101","article-title":"PgRC2: engineering the compression of sequencing reads","volume":"41","author":"Kowalski","year":"2025","journal-title":"Bioinformatics"},{"key":"2026022510263722900_bib38","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1109\/ISPDC51135.2020.00030","article-title":"Accelerated implementation of FQSqueezer novel genomic compression method","volume-title":"2020 19th International Symposium on Parallel and Distributed Computing (ISPDC), Warsaw, Poland","author":"Amich","year":"2020"},{"issue":"12","key":"2026022510263722900_bib39","doi-asserted-by":"publisher","first-page":"3294","DOI":"10.1093\/bioinformatics\/btac333","article-title":"CURC: a CUDA-based reference-free read compressor","volume":"38","author":"Xie","year":"2022","journal-title":"Bioinformatics"},{"issue":"10","key":"2026022510263722900_bib40","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1371\/journal.pone.0109384","article-title":"Indexes of large genome collections on a PC","volume":"9","author":"Danek","year":"2014","journal-title":"PLoS One"},{"issue":"24","key":"2026022510263722900_bib41","doi-asserted-by":"publisher","first-page":"3499","DOI":"10.1093\/bioinformatics\/btu438","article-title":"Journaled string tree\u2014a scalable data structure for analyzing thousands of similar genomes on your laptop","volume":"30","author":"Rahn","year":"2014","journal-title":"Bioinformatics"},{"issue":"7","key":"2026022510263722900_bib42","doi-asserted-by":"publisher","first-page":"e0133198","DOI":"10.1371\/journal.pone.0133198","article-title":"Indexing arbitrary-length k-mers in sequencing reads","volume":"10","author":"Kowalski","year":"2015","journal-title":"PLoS One"},{"issue":"2","key":"2026022510263722900_bib43","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1038\/s41587-018-0010-1","article-title":"Ultrafast search of all deposited bacterial and viral genomic data","volume":"37","author":"Bradley","year":"2019","journal-title":"Nat Biotechnol"},{"key":"2026022510263722900_bib44","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jcss.2020.11.002","article-title":"Block trees","volume":"117","author":"Belazzougui","year":"2021","journal-title":"J Comput Syst Sci"},{"issue":"4","key":"2026022510263722900_bib45","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1093\/bioinformatics\/bty670","article-title":"copMEM: finding maximal exact matches via sampling both genomes","volume":"35","author":"Grabowski","year":"2019","journal-title":"Bioinformatics"},{"issue":"5","key":"2026022510263722900_bib46","doi-asserted-by":"publisher","first-page":"btad313","DOI":"10.1093\/bioinformatics\/btad313","article-title":"copMEM2: robust and scalable maximum exact match finding","volume":"39","author":"Grabowski","year":"2023","journal-title":"Bioinformatics"},{"issue":"22","key":"2026022510263722900_bib47","doi-asserted-by":"publisher","first-page":"4560","DOI":"10.1093\/bioinformatics\/btz273","article-title":"Fast detection of maximal exact matches via fixed sampling of query k-mers and Bloom filtering of index k-mers","volume":"35","author":"Liu","year":"2019","journal-title":"Bioinformatics"},{"issue":"4","key":"2026022510263722900_bib48","doi-asserted-by":"publisher","first-page":"692","DOI":"10.1038\/s41592-025-02625-2","article-title":"Efficient and robust search of microbial genomes via phylogenetic compression","volume":"22","author":"B\u0159inda","year":"2025","journal-title":"Nat Methods"},{"key":"2026022510263722900_bib49","doi-asserted-by":"publisher","DOI":"10.1101\/2024.03.08.584059","article-title":"AllTheBacteria-all bacterial genomes assembled, available and searchable","author":"Hunt","year":"2025","journal-title":"bioRxiv"},{"key":"2026022510263722900_bib50","doi-asserted-by":"publisher","first-page":"102948","DOI":"10.1016\/j.artmed.2024.102948","article-title":"Enhancing metagenomic classification with compression-based features","volume":"156","author":"Silva","year":"2024","journal-title":"Artif Intell Med"},{"key":"2026022510263722900_bib51","doi-asserted-by":"publisher","first-page":"giac079","DOI":"10.1093\/gigascience\/giac079","article-title":"The complexity landscape of viral genomes","volume":"11","author":"Silva","year":"2022","journal-title":"Gigascience"},{"key":"2026022510263722900_bib52","doi-asserted-by":"publisher","first-page":"12, eprint 1","DOI":"10.3389\/fbioe.2015.00012","article-title":"Searching and indexing genomic databases via kernelization","volume":"3","author":"Gagie","year":"2015","journal-title":"Front Bioeng Biotechnol"},{"issue":"4","key":"2026022510263722900_bib53","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1089\/cmb.2019.0309","article-title":"Efficient construction of a complete index for pan-genomics read alignment","volume":"27","author":"Kuhnle","year":"2020","journal-title":"J Comput Biol"},{"key":"2026022510263722900_bib54","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1038\/s41576-020-0210-7","article-title":"Pan-genomics in the human genome era","volume":"21","author":"Sherman","year":"2020","journal-title":"Nat Rev Genet"},{"key":"2026022510263722900_bib55","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/978-3-642-16321-0_20","article-title":"Relative Lempel-Ziv compression of genomes for large-scale storage and retrieval","volume-title":"String Processing and Information Retrieval\u201417th International Symposium, SPIRE 2010, Los Cabos, Mexico, October 11-13, 2010. Proceedings. vol. 6393 of Lecture Notes in Computer Science","author":"Kuruppu","year":"2010"},{"issue":"21","key":"2026022510263722900_bib56","doi-asserted-by":"publisher","first-page":"2979","DOI":"10.1093\/bioinformatics\/btr505","article-title":"Robust relative compression of genomes with random access","volume":"27","author":"Deorowicz","year":"2011","journal-title":"Bioinformatics"},{"key":"2026022510263722900_bib57","doi-asserted-by":"publisher","first-page":"11565","DOI":"10.1038\/srep11565","article-title":"GDC 2: Compression of large collections of genomes","volume":"5","author":"Deorowicz","year":"2015","journal-title":"Sci Rep"},{"issue":"5","key":"2026022510263722900_bib58","doi-asserted-by":"publisher","first-page":"1275","DOI":"10.1109\/tcbb.2013.122","article-title":"FRESCO: Referential compression of highly similar sequences","volume":"10","author":"Wandelt","year":"2013","journal-title":"IEEE\/ACM Trans Comput Biol Bioinform"},{"key":"2026022510263722900_bib59","doi-asserted-by":"publisher","first-page":"giab099","DOI":"10.1093\/gigascience\/giab099","article-title":"MBGC: Multiple Bacteria Genome Compressor","volume":"11","author":"Grabowski","year":"2022","journal-title":"Gigascience"},{"issue":"3","key":"2026022510263722900_bib60","doi-asserted-by":"publisher","first-page":"btad097","DOI":"10.1093\/bioinformatics\/btad097","article-title":"AGC: compact representation of assembled genomes with fast queries and updates","volume":"39","author":"Deorowicz","year":"2023","journal-title":"Bioinformatics"},{"issue":"4","key":"2026022510263722900_bib61","doi-asserted-by":"publisher","first-page":"928","DOI":"10.1145\/322344.322346","article-title":"Data compression via textual substitution","volume":"29","author":"Storer","year":"1982","journal-title":"J ACM"},{"issue":"11","key":"2026022510263722900_bib62","doi-asserted-by":"publisher","first-page":"e3001421","DOI":"10.1371\/journal.pbio.3001421","article-title":"Exploring bacterial diversity via a curated and searchable snapshot of archived DNA sequences","volume":"19","author":"Blackwell","year":"2021","journal-title":"PLoS Biol"},{"key":"2026022510263722900_bib63","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/978-3-642-24583-1_41","article-title":"Reference sequence construction for relative compression of genomes","volume-title":"String Processing and Information Retrieval\u201418th International Symposium, SPIRE 2011, Pisa, Italy,\u00a0October 17-21,\u00a02011. Proceedings. vol. 7024 of Lecture Notes in Computer Science","author":"Kuruppu","year":"2011"},{"issue":"16","key":"2026022510263722900_bib64","doi-asserted-by":"publisher","first-page":"2225","DOI":"10.1093\/bioinformatics\/btab102","article-title":"Genozip: a universal extensible genomic data compressor","volume":"37","author":"Lan","year":"2021","journal-title":"Bioinformatics"},{"key":"2026022510263722900_bib65","doi-asserted-by":"crossref","unstructured":"Kowalski TM . Supporting data for \u201cMBGC2: Boosting Compression via Efficient Encoding of Approximate Matches in Genome Collections.\u201d \u00a0GigaScience Database. 2025. 10.5524\/102796.","DOI":"10.1093\/gigascience\/giag008"}],"container-title":["GigaScience"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/gigascience\/advance-article-pdf\/doi\/10.1093\/gigascience\/giag008\/66511330\/giag008.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/gigascience\/article-pdf\/doi\/10.1093\/gigascience\/giag008\/66511330\/giag008.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/gigascience\/article-pdf\/doi\/10.1093\/gigascience\/giag008\/66511330\/giag008.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T15:26:47Z","timestamp":1772033207000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/gigascience\/article\/doi\/10.1093\/gigascience\/giag008\/8435319"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"references-count":65,"URL":"https:\/\/doi.org\/10.1093\/gigascience\/giag008","relation":{},"ISSN":["2047-217X"],"issn-type":[{"value":"2047-217X","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2026]]},"published":{"date-parts":[[2026]]},"article-number":"giag008"}}