<?xml version='1.0'?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:georss="http://www.georss.org/georss" xmlns:atom="http://www.w3.org/2005/Atom" >
<channel>
	<title><![CDATA[BOL: Related items]]></title>
	<link>https://bioinformaticsonline.com/related/44489?offset=440</link>
	<atom:link href="https://bioinformaticsonline.com/related/44489?offset=440" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43909/human-complete-genome</guid>
	<pubDate>Wed, 06 Jul 2022 06:42:55 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43909/human-complete-genome</link>
	<title><![CDATA[Human Complete Genome]]></title>
	<description><![CDATA[<h1 dir="auto">Telomere-to-telomere consortium</h1>
<p dir="auto">We have sequenced the CHM13hTERT human cell line with a number of technologies. Human genomic DNA was extracted from the cultured cell line. As the DNA is native, modified bases will be preserved. The data includes 30x&nbsp;<a href="https://www.pacb.com/">PacBio</a>&nbsp;<a href="https://www.ncbi.nlm.nih.gov/sra/?term=SRX789768*+CHM13">HiFi</a>, 120x coverage of&nbsp;<a href="https://nanoporetech.com/">Oxford Nanopore</a>, 70x&nbsp;<a href="https://www.pacb.com/">PacBio</a>&nbsp;CLR, 50x&nbsp;<a href="https://www.10xgenomics.com/">10X Genomics</a>, as well as&nbsp;<a href="https://bionanogenomics.com/technology/dls-technology/">BioNano DLS</a>&nbsp;and&nbsp;<a href="https://arimagenomics.com/kit/">Arima Genomics HiC</a>. Most raw data is available from this site, with the exception of the PacBio data which was generated by the University of Washington/PacBio and is available from&nbsp;<a href="https://www.ncbi.nlm.nih.gov/sra?linkname=bioproject_sra_all&amp;from_uid=269593">NCBI SRA</a>.</p>
<p dir="auto">A UCSC browser is available for&nbsp;<a href="https://genome.ucsc.edu/h/GCA_009914755.4">v2.0</a>&nbsp;(as well as legacy&nbsp;<a href="http://genome.ucsc.edu/cgi-bin/hgTracks?genome=t2t-chm13-v1.0&amp;hubUrl=http://t2t.gi.ucsc.edu/chm13/hub/hub.txt">v1.0</a>&nbsp;and&nbsp;<a href="http://genome.ucsc.edu/cgi-bin/hgTracks?genome=t2t-chm13-v1.1&amp;hubUrl=http://t2t.gi.ucsc.edu/chm13/hub/hub.txt">v1.1</a>&nbsp;versions). An interactive dotplot visualization of all genomic repeats is also available from&nbsp;<a href="https://resgen.io/paper-data/T2T-Nurk-et-al-2021/views/t2t-identity-v2">resgen.io</a>. Known issues identified in the assembly are tracked at&nbsp;<a href="https://github.com/marbl/CHM13-issues">CHM13 issues</a>.</p>
<p dir="auto">&nbsp;</p>
<p dir="auto">MORE at&nbsp;https://github.com/marbl/CHM13</p><p>Address of the bookmark: <a href="https://www.science.org/doi/10.1126/science.abj6987" rel="nofollow">https://www.science.org/doi/10.1126/science.abj6987</a></p>]]></description>
	<dc:creator>Shruti Paniwala</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/44371/steps-to-find-all-the-repeats-in-the-genome</guid>
	<pubDate>Thu, 31 Aug 2023 02:43:28 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/44371/steps-to-find-all-the-repeats-in-the-genome</link>
	<title><![CDATA[Steps to find all the repeats in the genome !]]></title>
	<description><![CDATA[<div><p>To find repeats in a genome from 2 to 9 length using a Perl script, you can use the RepeatMasker tool with the "--length" option<a href="https://mobilednajournal.biomedcentral.com/articles/10.1186/1759-8753-5-13" target="_blank">[0]</a>. Here's a step-by-step guide:</p></div><div><ol>
<li>Install RepeatMasker: First, you need to install RepeatMasker on your system. You can download it from the RepeatMasker website<a href="https://mobilednajournal.biomedcentral.com/articles/10.1186/1759-8753-5-13" target="_blank">[0]</a>.</li>
</ol></div><div><ol>
<li>Prepare the genome sequence: Make sure you have the genome sequence in a FASTA file format. Let's assume the file is named "genome.fasta".</li>
</ol><blockquote><p>./RepeatMasker -pa &lt;number_of_processors&gt; -nolow -norna -no_is -div &lt;divergence_value&gt; -lib RepeatMaskerLib.embl -gff -xsmall -small -poly -species &lt;species_name&gt; -dir &lt;output_directory&gt; -length &lt;min_length&gt;-&lt;max_length&gt; genome.fasta</p></blockquote><div><p>Replace the following placeholders with appropriate values:</p><ul>
<li><code>&lt;number_of_processors&gt;</code>: The number of processors/threads you want to use for parallel processing.</li>
<li><code>&lt;divergence_value&gt;</code>: The divergence value for the species you are analyzing. You can find divergence values for different species in the RepeatMasker documentation<a href="https://mobilednajournal.biomedcentral.com/articles/10.1186/1759-8753-5-13" target="_blank">[0]</a>.</li>
<li><code>&lt;species_name&gt;</code>: The name of the species you are analyzing.</li>
<li><code>&lt;output_directory&gt;</code>: The directory where you want the output files to be saved.</li>
<li><code>&lt;min_length&gt;</code>&nbsp;and&nbsp;<code>&lt;max_length&gt;</code>: The minimum and maximum lengths of the repeats you want to find (in this case, 2 and 9).</li>
</ul></div><div><ol>
<li>Analyze the output: RepeatMasker will generate several output files, including a .out file. You can parse this file to extract the information you need. There is a Perl tool called "one_code_to_find_them_all.pl" that can help you parse RepeatMasker output files<a href="https://mobilednajournal.biomedcentral.com/articles/10.1186/1759-8753-5-13" target="_blank">[0]</a>. You can download it from the source provided.</li>
</ol></div><div><ol>
<li>Use the provided Perl script: Once you have the "one_code_to_find_them_all.pl" script, you can run it to conveniently parse the RepeatMasker output files. Here's an example of how to use it:</li>
</ol><blockquote><p>perl one_code_to_find_them_all.pl --rm &lt;RepeatMasker_out_file&gt; --length &lt;length_file&gt;</p></blockquote></div><p>&nbsp;</p></div><div><div><p>Replace&nbsp;<code>&lt;RepeatMasker_out_file&gt;</code>&nbsp;with the path to your RepeatMasker .out file, and&nbsp;<code>&lt;length_file&gt;</code>&nbsp;with the path to a file containing the lengths of the reference elements.</p></div><div><p>This script will generate several output files, including .log.txt and .copynumber.csv, which contain quantitative information about the identified repeat elements.</p></div><div><p>Remember to adjust the parameters and options according to your specific needs and the characteristics of your genome.</p></div></div>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44628/uncovar-workflow-for-transparent-and-robust-virus-variant-calling-genome-reconstruction-and-lineage-assignment</guid>
	<pubDate>Mon, 05 Aug 2024 23:01:29 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44628/uncovar-workflow-for-transparent-and-robust-virus-variant-calling-genome-reconstruction-and-lineage-assignment</link>
	<title><![CDATA[UnCoVar: Workflow for Transparent and Robust Virus Variant Calling, Genome Reconstruction and Lineage Assignment]]></title>
	<description><![CDATA[<p>UnCoVar: Workflow for Transparent and Robust Virus Variant Calling, Genome Reconstruction and Lineage Assignment</p>
<ul>
<li>
<p>Using state of the art tools, easily extended for other viruses</p>
</li>
<li>
<p>Tool and database updates for critical components via Conda</p>
</li>
<li>
<p>Built using modern design patterns with Conda and Snakemake</p>
</li>
<li>
<p>Extensible and easy to customize</p>
</li>
<li>
<p>Submission Ready Genomes</p>
</li>
<li>
<p>Customizable reporting with comprehensive visualization</p>
</li>
</ul>
<p>https://ikim-essen.github.io/uncovar/</p>
<p>Github&nbsp;https://github.com/IKIM-Essen/uncovar</p>
<p>&nbsp;</p>
<p>&nbsp;</p><p>Address of the bookmark: <a href="https://ikim-essen.github.io/uncovar/" rel="nofollow">https://ikim-essen.github.io/uncovar/</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/44766/genome-simulation-with-slim-and-msprime</guid>
	<pubDate>Fri, 31 Jan 2025 12:47:43 -0600</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/44766/genome-simulation-with-slim-and-msprime</link>
	<title><![CDATA[Genome Simulation with SLiM and msprime]]></title>
	<description><![CDATA[<p>Genome simulation is an essential tool in population genetics, enabling researchers to model evolutionary processes and study genetic variation. Two widely used simulation tools in this field are <strong style="font-size: 12.8px;">SLiM</strong><span style="font-size: 12.8px; font-weight: normal;"> and </span><strong style="font-size: 12.8px;">msprime</strong><span style="font-size: 12.8px; font-weight: normal;">. While both serve different purposes, they can be used together with the </span><strong style="font-size: 12.8px;">slendr</strong><span style="font-size: 12.8px; font-weight: normal;"> framework to compare simulation outputs effectively.</span></p><h2>Overview of SLiM and msprime</h2><h3>SLiM: Forward Genetic Simulator</h3><p>SLiM is a <strong>free, open-source</strong> tool designed for forward genetic simulations. It allows researchers to model complex evolutionary scenarios, including selection, recombination, and demographic events, making it particularly useful for studying adaptation and selection in populations.</p><p><strong>Key Features of SLiM:</strong></p><ul>
<li>
<p>Simulates population evolution forward in time</p>
</li>
<li>
<p>Supports custom evolutionary models using an embedded scripting language</p>
</li>
<li>
<p>Allows modeling of spatial and ecological dynamics</p>
</li>
<li>
<p>Provides high flexibility and extensibility for user-defined scenarios</p>
</li>
<li>
<p>Available on GitHub as an open-source project</p>
</li>
</ul><h3>msprime: Ancestry and Mutation Simulator</h3><p>msprime is an efficient, <strong>open-source</strong> tool that simulates ancestry and mutations using a coalescent framework. It is known for its high-speed performance and low memory requirements, making it a popular choice for large-scale genomic simulations.</p><p><strong>Key Features of msprime:</strong></p><ul>
<li>
<p>Implements coalescent simulations for ancestry modeling</p>
</li>
<li>
<p>Efficiently simulates large population histories</p>
</li>
<li>
<p>Supports the addition of mutations to genealogies</p>
</li>
<li>
<p>Developed using an open-source community model</p>
</li>
<li>
<p>Often faster and more memory-efficient than alternative simulators</p>
</li>
</ul><h2>Using SLiM and msprime with slendr</h2><p>Both SLiM and msprime can be integrated with <strong>slendr</strong>, a framework that facilitates structured population genetic simulations. This integration allows for seamless comparison of simulation outputs.</p><h3>How They Work Together:</h3><ul>
<li>
<p>SLiM and msprime simulations can be analyzed within slendr.</p>
</li>
<li>
<p>The <strong>ts_read()</strong> function in slendr enables loading and comparing tree sequence outputs from both simulators.</p>
</li>
<li>
<p>This integration allows researchers to validate simulation results and gain deeper insights into evolutionary processes.</p>
</li>
</ul><h2>Performance Considerations</h2><p>While SLiM offers powerful forward simulations with extensive customization, msprime is often preferred for its <strong>speed and memory efficiency</strong> when simulating ancestry and mutations. The choice between the two depends on the research goals:</p><ul>
<li>
<p><strong>For detailed evolutionary modeling with selection and recombination:</strong> Use SLiM.</p>
</li>
<li>
<p><strong>For large-scale coalescent simulations with mutations:</strong> Use msprime.</p>
</li>
<li>
<p><strong>For comparing different simulation models and their outputs:</strong> Use slendr to integrate SLiM and msprime results.</p>
</li>
</ul><h2>Conclusion</h2><p>SLiM and msprime are valuable tools for genome simulation, each serving distinct but complementary purposes in population genetics research. By leveraging the strengths of both simulators with slendr, researchers can conduct robust and efficient evolutionary simulations, enhancing our understanding of genetic diversity and adaptation.</p><p>For more information, check out the official GitHub repositories for <strong>SLiM</strong> and <strong>msprime</strong>, and explore the <strong>slendr</strong> framework for streamlined simulation workflow</p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/45240/pg2-making-pangenome-graphs-easier-to-understand</guid>
	<pubDate>Tue, 18 Aug 2026 04:38:23 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/45240/pg2-making-pangenome-graphs-easier-to-understand</link>
	<title><![CDATA[PG2: Making Pangenome Graphs Easier to Understand]]></title>
	<description><![CDATA[<p>Genomics is moving beyond the traditional approach of studying DNA using a single reference genome. Today, researchers are increasingly using pangenomes, which represent genetic information from multiple genomes and capture a much broader range of genetic diversity.</p><p>However, pangenome graphs can be highly complex, making them difficult to visualize and interpret. A recent study published in BMC Bioinformatics introduces PG2 (PanGenoGrapher), an open-source, web-based tool designed to address this challenge.&nbsp;The source code and user guide are openly available on GitHub at https://github.com/iVis-at-Bilkent/pangenographer. A publicly accessible sample deployment is hosted at http://pg2.cs.bilkent.edu.tr. In addition, a demonstration video illustrating the primary use cases of PG2 is available at https://www.youtube.com/watch?v=yCd7-aGY6CQ.</p><p>PG2 combines advanced graph-layout algorithms with an interactive visualization platform. It allows researchers to explore genomic paths, identify variations, and examine relationships between different parts of a pangenome graph more easily.</p><p>This is important because visualization can play a major role in bioinformatics. When complex genomic information is presented clearly, researchers can more easily identify patterns, understand genetic variation, and generate new biological insights.</p><p>The development of PG2 represents a step toward making pangenome analysis more accessible and intuitive. As genomic datasets continue to grow and graph-based representations become more common, tools like PG2 can help researchers navigate this increasing complexity.</p><p>Ultimately, PG2 demonstrates how combining genomics, graph algorithms, and interactive visualization can make sophisticated biological data easier to understand and analyze.</p><p>Reference: Solun, G. K., Dogrusoz, U., Bing&ouml;l, Z., &amp; Alkan, C. (2026). PG2: algorithms and a web-based tool for effective layout and visual analysis of pangenome graphs. BMC Bioinformatics. DOI: 10.1186/s12859-026-06555-4.</p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/45303/the-tree-that-learned-to-read-genomes</guid>
	<pubDate>Fri, 11 Sep 2026 00:51:02 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/45303/the-tree-that-learned-to-read-genomes</link>
	<title><![CDATA[The Tree That Learned to Read Genomes]]></title>
	<description><![CDATA[<p>Imagine trying to reconstruct a family tree when many family photographs are missing, some names are unclear, and different relatives remember the past differently. This is similar to the challenge scientists face when trying to understand how organisms are related. Their family records are genomes, and the family tree is a phylogenetic tree. With modern sequencing technologies, scientists now have access to thousands of genomes, but comparing them can be difficult, especially when genomes are incomplete or poorly annotated.</p><p>A recent study by Webster and Chapman introduces Buscogeny (https://github.com/Jwebster89/Buscogeny), an open-source bioinformatics pipeline designed to make this process easier. The tool uses BUSCO (Benchmarking Universal Single-Copy Orthologs), which identifies conserved genes that are expected to occur as single copies in particular groups of organisms. These genes act like evolutionary landmarks, allowing researchers to compare genomes and investigate their relationships.</p><p>Buscogeny brings several steps of phylogenomic analysis into one workflow. It identifies BUSCO genes, extracts and aligns their sequences, removes unreliable regions, combines information from multiple genes, and uses the resulting data to construct a phylogenetic tree. It also provides quality-control information, helping researchers identify genomes that may be too incomplete for reliable analysis.</p><p>The authors demonstrate the usefulness of Buscogeny with bacterial and fungal genomes, including Alternaria. This is particularly valuable because fungal genomes can vary greatly in quality and annotation. Ultimately, Buscogeny helps transform massive amounts of genomic data into an understandable evolutionary story. Each DNA sequence becomes a clue, each conserved gene becomes a landmark, and together these clues reveal a picture of how life is connected.</p><p>More at&nbsp;https://link.springer.com/article/10.1007/s10123-025-00752-6?</p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34398/ont-assembly-and-illumina-polishing-pipeline</guid>
	<pubDate>Thu, 23 Nov 2017 10:13:42 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34398/ont-assembly-and-illumina-polishing-pipeline</link>
	<title><![CDATA[ONT assembly and Illumina polishing pipeline]]></title>
	<description><![CDATA[<p>This pipeline performs the following steps:</p>
<ul>
<li>Assembly of nanopore reads using&nbsp;<a href="http://canu.readthedocs.io/">Canu</a>.</li>
<li>Polish canu contigs using&nbsp;<a href="https://github.com/isovic/racon">racon</a>&nbsp;(<em>optional</em>).</li>
<li>Map a paired-end Illumina dataset onto the contigs obtained in the previous steps using&nbsp;<a href="http://bio-bwa.sourceforge.net/">BWA</a>&nbsp;mem.</li>
<li>Perform correction of contigs using&nbsp;<a href="https://github.com/broadinstitute/pilon/wiki">pilon</a>&nbsp;and the Illumina dataset.</li>
</ul><p>Address of the bookmark: <a href="https://github.com/nanoporetech/ont-assembly-polish" rel="nofollow">https://github.com/nanoporetech/ont-assembly-polish</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34501/dnapipete-de-novo-assembly-annotation-pipeline-for-transposable-elements</guid>
	<pubDate>Sat, 02 Dec 2017 18:25:44 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34501/dnapipete-de-novo-assembly-annotation-pipeline-for-transposable-elements</link>
	<title><![CDATA[dnaPipeTE: de-novo assembly &amp; annotation Pipeline for Transposable Elements]]></title>
	<description><![CDATA[<p>dnaPipeTE (for de-novo assembly &amp; annotation Pipeline for Transposable Elements), is a pipeline designed to find, annotate and quantify Transposable Elements in small samples of NGS datasets. It is very useful to quantify the proportion of TEs in newly sequenced genomes since it does not require genome assembly and works on small datasets (&lt; 1X).</p>
<ul>
<li>
<p>dnaPipeTE is developped by Cl&eacute;ment Goubert, Laurent Modolo and the TREEP team of the LBBE:&nbsp;<a href="http://lbbe.univ-lyon1.fr/-Equipe-Elements-transposables-.html?lang=en">http://lbbe.univ-lyon1.fr/-Equipe-Elements-transposables-.html?lang=en</a></p>
</li>
<li>
<p>You can find the original publication in GBE here:&nbsp;<a href="https://academic.oup.com/gbe/article/7/4/1192/533768">https://academic.oup.com/gbe/article/7/4/1192/533768</a></p>
</li>
</ul>
<p><a href="https://github.com/clemgoub/dnaPipeTE/blob/dev/dnaPipefront.png" target="_blank"><img src="https://github.com/clemgoub/dnaPipeTE/raw/dev/dnaPipefront.png" alt="Front" style="border: 0px;"></a><em>output examples of quantification and TE landscape (relative age) produced by dnaPipeTE</em></p>
<p><em>&nbsp;</em></p><p>Address of the bookmark: <a href="https://github.com/clemgoub/dnaPipeTE" rel="nofollow">https://github.com/clemgoub/dnaPipeTE</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34914/ra-assembler-a-de-novo-dna-assembler-for-third-generation-sequencing-data</guid>
	<pubDate>Wed, 27 Dec 2017 20:36:54 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34914/ra-assembler-a-de-novo-dna-assembler-for-third-generation-sequencing-data</link>
	<title><![CDATA[Ra assembler - a de novo DNA assembler for third generation sequencing data]]></title>
	<description><![CDATA[<p>Integration of the Ra assembler - a de novo DNA assembler for third generation sequencing data developed on Faculty of Electrical Engineering and Computing (FER), Ruder Boskovic Institute (RBI) and Genome Institute of Singapore (GIS).</p>
<p>Ra is in development since 2014 in the form of several separate components that used to be run individually.<br>This project aims to ease the usage of Ra by integrating it into a complete de novo assembly tool.</p>
<p>Unlike other state-of-the-art assemblers,&nbsp;<span>Ra does not have an error correction step.</span>&nbsp;Instead, it relies on detecting overlaps using a very sensitive and specific overlapper ("graphmap -w owler",&nbsp;<a href="https://github.com/isovic/graphmap">https://github.com/isovic/graphmap</a>) and constructing and reducing an overlap graph (Ra layout,&nbsp;<a href="https://github.com/mariokostelac/ra">https://github.com/mariokostelac/ra</a>).</p><p>Address of the bookmark: <a href="https://github.com/mariokostelac/ra-integrate/" rel="nofollow">https://github.com/mariokostelac/ra-integrate/</a></p>]]></description>
	<dc:creator>biogeek</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36985/swalo-scaffolding-with-assembly-likelihood-optimization</guid>
	<pubDate>Wed, 20 Jun 2018 02:45:16 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36985/swalo-scaffolding-with-assembly-likelihood-optimization</link>
	<title><![CDATA[SWALO: Scaffolding with assembly likelihood optimization]]></title>
	<description><![CDATA[SWALO (scaffolding with assembly likelihood optimization) is a method for scaffolding based on likelihood of genome assemblies computed using generative models for sequencing.

Please email your questions, comments, suggestions, and bug reports to atif.bd@gmail.com.<p>Address of the bookmark: <a href="https://atifrahman.github.io/SWALO/" rel="nofollow">https://atifrahman.github.io/SWALO/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>