<?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/43614?offset=380</link>
	<atom:link href="https://bioinformaticsonline.com/related/43614?offset=380" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	
<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/43762/vicoso-group</guid>
  <pubDate>Wed, 02 Feb 2022 02:51:27 -0600</pubDate>
  <link></link>
  <title><![CDATA[Vicoso group]]></title>
  <description><![CDATA[
<p>The Vicoso group investigates how sex chromosomes evolve over time, and what biological forces are driving their patterns of differentiation.</p>

<p>The Vicoso group is interested in understanding several aspects of the biology of sex chromosomes, and the evolutionary processes that shape their peculiar features. By combining the use of next-generation sequencing technologies with studies in several model and non-model organisms, they can address a variety of standing questions, such as: Why do some Y chromosomes degenerate while others remain homomorphic, and how does this relate to the extent of sexual dimorphism of the species? What forces drive some species to acquire global dosage compensation of the X, while others only compensate specific genes? What are the frequency and molecular dynamics of sex-chromosome turnover?</p>

<p>More at https://ist.ac.at/en/research/vicoso-group/<br />http://pub.ist.ac.at/~bvicoso/</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43714/hiv-genome-database</guid>
	<pubDate>Fri, 21 Jan 2022 05:40:15 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43714/hiv-genome-database</link>
	<title><![CDATA[HIV genome database !]]></title>
	<description><![CDATA[<p>HIV resources</p>
<p>https://www.hiv.lanl.gov/components/sequence/HIV/search/search.html</p><p>Address of the bookmark: <a href="https://www.hiv.lanl.gov/components/sequence/HIV/search/search.html" rel="nofollow">https://www.hiv.lanl.gov/components/sequence/HIV/search/search.html</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<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/45251/aurora-a-new-detective-for-bacterial-genomes</guid>
	<pubDate>Fri, 21 Aug 2026 11:31:00 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/45251/aurora-a-new-detective-for-bacterial-genomes</link>
	<title><![CDATA[Aurora: A New Detective for Bacterial Genomes]]></title>
	<description><![CDATA[<p>Imagine trying to solve a mystery with thousands of clues&mdash;but some of the clues are labelled incorrectly.</p><p>That is the challenge researchers face when studying how bacteria adapt to different environments. A bacterial gene may appear to be linked to a particular habitat, when the real reason is simply that closely related bacteria happen to live there.</p><p>In their 2025 Genome Biology paper, Bujdo&scaron;, Walter, and O&rsquo;Toole introduce aurora, a machine-learning tool designed to tackle this problem.</p><p>Aurora identifies potentially mislabeled or unusual bacterial strains before performing genome-wide association studies (GWAS). By cleaning up the dataset and accounting for bacterial evolutionary relationships, it can help researchers find genetic features that are more genuinely connected to habitat adaptation.</p><p>The researchers tested aurora using simulated and real bacterial datasets and found that it could recover important genetic associations even when datasets contained misleading labels.</p><p>The bigger lesson is simple: better biological discoveries often begin with better data.</p><p>Aurora gives researchers a new way to separate real genetic clues from misleading ones&mdash;and could help us better understand how bacteria adapt, survive, and evolve in the environments they call home.</p><p>Based on Bujdo&scaron; et al., &ldquo;aurora: a machine learning GWAS tool for analyzing microbial habitat adaptation,&rdquo; Genome Biology (2025).[Read the original paper](https://link.springer.com/article/10.1186/s13059-025-03524-7?)</p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/45296/luo-lab-symbiosis-genomics-evolution</guid>
  <pubDate>Wed, 09 Sep 2026 03:30:30 -0500</pubDate>
  <link></link>
  <title><![CDATA[Luo Lab | Symbiosis Genomics &amp; Evolution]]></title>
  <description><![CDATA[
<p>We study the evolutionary genomics of marine invertebrates to understand their origins and diversity. Our lab combines high-throughput sequencing and single-cell transcriptomics to explore a wide range of non-model systems. We are particularly interested in how evolutionary novelty arises, with a focus on animal development and photosymbiosis.</p>

<p>Research Directions</p>

<p>Stony corals: evolution of novelty and photosymbiosis</p>

<p>Symbiotic acoels: cell type evolution and photosymbiosis</p>

<p>Animal genomes: structural evolution and gene regulation</p>

<p>https://sgel.biodiv.tw/home</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/45358/the-variant-everyone-ignored</guid>
	<pubDate>Mon, 05 Oct 2026 12:14:20 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/45358/the-variant-everyone-ignored</link>
	<title><![CDATA[The Variant Everyone Ignored]]></title>
	<description><![CDATA[<p>Consider a scenario in which a patient's genome has been sequenced. Among billions of DNA bases, a structural alteration may explain the patient's disease. Multiple advanced algorithms analyze the data, yet only one detects the variant, while the others do not. In standard bioinformatics workflows, such a solitary result is often regarded as unreliable and subsequently discarded. Although the solution exists within the data, prevailing computational protocols may overlook it.</p><p>A recent study published in Genome Biology (https://link.springer.com/article/10.1186/s13059-026-04280-y) addressed this challenge by introducing dicast (https://github.com/burgshrimps/dicast), a machine-learning approach for detecting structural variants in short-read sequencing data. Structural variants, such as large deletions, insertions, duplications, and inversions, can have significant biological and clinical implications, yet they are challenging to identify with short-read technologies. Because different detection methods frequently yield divergent results, researchers commonly employ consensus calling, considering a variant valid only if multiple tools detect it. While this approach reduces false positives, it relies on the potentially flawed assumption that the majority is always correct.</p><p>The researchers explored the impact of evaluating the supporting evidence for each variant, rather than simply tallying the number of algorithms that identified it. To establish a ground truth, they analyzed nine genomes using multiple sequencing technologies and 15 detection methods, initially identifying approximately 35 million potential variants. Through extensive filtering, evidence integration, and manual review of over 11,500 variants, they developed a robust benchmark comprising more than 236,000 structural variants. The findings underscored the complexity of the problem: short-read methods detected fewer than half of deletions and less than 10 percent of insertions, with performance declining markedly in repetitive genomic regions. In contrast, long-read technologies demonstrated superior detection capabilities. However, replacing the substantial volume of existing short-read data in clinical and research settings is not immediately feasible. Consequently, the researchers questioned whether short-read data might harbor more information than conventional analytical pipelines currently extract.</p><p>This line of inquiry led to the development of dicast. Rather than merely confirming agreement among multiple tools, dicast identifies patterns in sequencing data, including split and clipped reads, discordant read pairs, alignment characteristics, and the surrounding genomic context. An XGBoost machine-learning model evaluates which combinations of these signals are indicative of genuine structural variants. Thus, the approach shifts from tallying algorithmic consensus to interpreting the underlying evidence.</p><p>The researchers subsequently conducted a targeted evaluation by examining structural variants detected by only a single short-read tool, which are typically missed by consensus-based approaches. dicast successfully recovered approximately 81% of these single-caller deletions, insertions, and duplications. The signals for these variants were present in the data, but conventional filtering methods failed to integrate them effectively.</p><p>The utility of dicast was further demonstrated in cohorts with rare diseases, including congenital limb malformations, atrial fibrillation, and neuromuscular disorders. In one instance, dicast achieved a deletion recall rate of approximately 0.96, compared to 0.74 using consensus calling. The median number of variants requiring manual review was 29 per sample. Among 31 experimentally validated variants that standard filters would have missed, dicast identified 12, whereas consensus calling detected only one.</p><p>Overall, dicast identified approximately 20 percent more potential disease-causing deletions than consensus-based methods. While a 20 percent increase may appear modest, in clinical genomics such improvements can have significant practical implications. Missing a deletion may leave a case unresolved, whereas detecting a structural variant can provide critical diagnostic insights.</p><p>The study does not claim that machine learning has rendered short-read sequencing superior to long-read approaches. Instead, the results underscore the effectiveness of long-read sequencing for structural variant detection. However, dicast highlights a more nuanced perspective: substantial biological information may still be recoverable from the extensive short-read datasets already available.</p><p>The principal lesson extends beyond the detection of structural variants. For many years, bioinformatics pipelines have relied on threshold-based criteria, such as minimum coverage, quality scores, or support from multiple tools. While these rules are useful, biological phenomena do not always conform to rigid checklists; multiple weak signals, when considered collectively, can provide compelling evidence.</p><p>This perspective prompts consideration of the solitary variant: one algorithm identifies it, while several others do not. Traditional consensus techniques might have dismissed it, yet machine learning approaches evaluate the available evidence to determine whether the variant is plausible.</p><p>Occasionally, the most significant variant within a genome is the one that is almost universally overlooked.</p><p>Read more at&nbsp;https://link.springer.com/article/10.1186/s13059-026-04280-y</p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36017/alpha-a-toolkit-for-automated-local-phylogenomic-analyses</guid>
	<pubDate>Wed, 21 Mar 2018 18:12:06 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36017/alpha-a-toolkit-for-automated-local-phylogenomic-analyses</link>
	<title><![CDATA[ALPHA: A Toolkit for Automated Local Phylogenomic Analyses]]></title>
	<description><![CDATA[<p><span>Automated Local Phylogenomic Analyses, or ALPHA, is a python-based application that provides an intuitive user interface for phylogenetic analyses and data visualization. It has four distinct modes that are useful for different types of phylogenetic analysis: RAxML, File Converter, MS Comparison, and D-statistic.</span></p><p>Address of the bookmark: <a href="https://github.com/chilleo/ALPHA" rel="nofollow">https://github.com/chilleo/ALPHA</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>