<?xml version="1.0" encoding="UTF-8"?><rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:dcq="http://purl.org/dc/terms/"><records count="1" morepages="false" start="1" end="1"><record rownumber="1"><dc:product_type>Journal Article</dc:product_type><dc:title>MetaCC allows scalable and integrative analyses of both long-read and short-read metagenomic Hi-C data</dc:title><dc:creator>Du, Yuxuan; Sun, Fengzhu</dc:creator><dc:corporate_author/><dc:editor/><dc:description>&lt;title&gt;Abstract&lt;/title&gt; &lt;p&gt;Metagenomic Hi-C (metaHi-C) can identify contig-to-contig relationships with respect to their proximity within the same physical cell. Shotgun libraries in metaHi-C experiments can be constructed by next-generation sequencing (short-read metaHi-C) or more recent third-generation sequencing (long-read metaHi-C). However, all existing metaHi-C analysis methods are developed and benchmarked on short-read metaHi-C datasets and there exists much room for improvement in terms of more scalable and stable analyses, especially for long-read metaHi-C data. Here we report MetaCC, an efficient and integrative framework for analyzing both short-read and long-read metaHi-C datasets. MetaCC outperforms existing methods on normalization and binning. In particular, the MetaCC normalization module, named NormCC, is more than 3000 times faster than the current state-of-the-art method HiCzin on a complex wastewater dataset. When applied to one sheep gut long-read metaHi-C dataset, MetaCC binning module can retrieve 709 high-quality genomes with the largest species diversity using one single sample, including an expansion of five uncultured members from the order&lt;italic&gt;Erysipelotrichales&lt;/italic&gt;, and is the only binner that can recover the genome of one important species&lt;italic&gt;Bacteroides vulgatus&lt;/italic&gt;. Further plasmid analyses reveal that MetaCC binning is able to capture multi-copy plasmids.&lt;/p&gt;</dc:description><dc:publisher>Nature Communications</dc:publisher><dc:date>2023-12-01</dc:date><dc:nsf_par_id>10478145</dc:nsf_par_id><dc:journal_name>Nature Communications</dc:journal_name><dc:journal_volume>14</dc:journal_volume><dc:journal_issue>1</dc:journal_issue><dc:page_range_or_elocation/><dc:issn>2041-1723</dc:issn><dc:isbn/><dc:doi>https://doi.org/10.1038/s41467-023-41209-6</dc:doi><dcq:identifierAwardId>2125142</dcq:identifierAwardId><dc:subject/><dc:version_number/><dc:location/><dc:rights/><dc:institution/><dc:sponsoring_org>National Science Foundation</dc:sponsoring_org></record></records></rdf:RDF>