<?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/33482?offset=70</link>
	<atom:link href="https://bioinformaticsonline.com/related/33482?offset=70" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40298/environment-for-tree-exploration-ete-is-a-python-programming-toolkit-that-assists-in-the-recontruction-manipulation-analysis-and-visualization-of-phylogenetic-trees</guid>
	<pubDate>Wed, 27 Nov 2019 05:32:33 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40298/environment-for-tree-exploration-ete-is-a-python-programming-toolkit-that-assists-in-the-recontruction-manipulation-analysis-and-visualization-of-phylogenetic-trees</link>
	<title><![CDATA[Environment for Tree Exploration (ETE) is a Python programming toolkit that assists in the recontruction, manipulation, analysis and visualization of phylogenetic trees]]></title>
	<description><![CDATA[<p><span>The Environment for Tree Exploration (ETE) is a Python programming toolkit that assists in the recontruction, manipulation, analysis and visualization of phylogenetic trees (although clustering trees or any other tree-like data structure are also supported).</span></p>
<p><span>Other tools</span></p>
<p><span><a href="https://github.com/shenwei356/taxonkit">https://github.com/shenwei356/taxonkit</a></span></p>
<p>&nbsp;</p>
<ul>
<li>ETE, version:&nbsp;<a href="https://pypi.org/project/ete3/3.1.1/">3.1.1</a></li>
<li>BioPython, version:&nbsp;<a href="https://pypi.org/project/biopython/1.73/">1.73</a></li>
<li>taxadb, version:&nbsp;<a href="https://pypi.org/project/taxadb/0.9.0">0.10.1</a></li>
<li>TaxonKit, version:&nbsp;<a href="https://github.com/shenwei356/taxonkit/releases/tag/0.10.1">0.5.0</a></li>
</ul><p>Address of the bookmark: <a href="https://pypi.org/project/ete3/3.1.1/" rel="nofollow">https://pypi.org/project/ete3/3.1.1/</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41475/proteoclade-a-taxonomic-toolkit-for-multi-species-and-metaproteomic-analysis</guid>
	<pubDate>Wed, 18 Mar 2020 14:27:20 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41475/proteoclade-a-taxonomic-toolkit-for-multi-species-and-metaproteomic-analysis</link>
	<title><![CDATA[ProteoClade: A taxonomic toolkit for multi-species and metaproteomic analysis]]></title>
	<description><![CDATA[<p>ProteoClade is a Python library for&nbsp;<span>taxonomic-based annotation and quantification of bottom-up proteomics data</span>. It is designed to be user-friendly, and has been optimized for speed and storage requirements.</p>
<p>ProteoClade helps you analyze two general categories of experiments:</p>
<ol>
<li>
<p><span><em>Targeted Database</em>&nbsp;Searches:</span>&nbsp;Experiments in which a limited number of species are defined ahead of time, such as those involving Patient-Derived Xenografts (PDXs) or host-pathogen interactions. Reference protein sequence databases are used for targeted searches (ex: using Mascot, MaxQuant).</p>
</li>
<li>
<p><span><em>De Novo</em>&nbsp;Searches:</span>&nbsp;Experiments in which the organisms are unspecified ahead of time or involve samples of high taxonomic complexity. Mass spectra are analyzed in the absence of a reference database (ex: using PEAKS, PepNovo).</p>
</li>
</ol>
<p>ProteoClade scales from two organisms to every organism in UniProt. Please&nbsp;<a href="https://proteoclade.readthedocs.io/">refer to the complete documentation at proteoclade.readthedocs.io</a>&nbsp;for installation, a user's guide, and examples.</p>
<p><a href="https://journals.plos.org/ploscompbiol/article?id=10.1371/journal.pcbi.1007741">https://journals.plos.org/ploscompbiol/article?id=10.1371/journal.pcbi.1007741</a></p><p>Address of the bookmark: <a href="https://github.com/HeldLab/ProteoClade" rel="nofollow">https://github.com/HeldLab/ProteoClade</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/45276/the-hidden-pages-of-our-dna</guid>
	<pubDate>Sat, 05 Sep 2026 01:04:22 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/45276/the-hidden-pages-of-our-dna</link>
	<title><![CDATA[The Hidden Pages of Our DNA]]></title>
	<description><![CDATA[<p>Imagine opening the instruction manual for life.</p><p>It is enormous, billions of letters long. Some of those letters are easy to understand because they contain instructions for building proteins, the tiny machines that keep our cells alive.</p><p>But what if some of the most important instructions aren't in those obvious chapters?</p><p>Scientists have long suspected that the mysterious stretches of DNA between protein-coding genes may contain some of life's most interesting secrets. These regions can act like switches, telling genes when, where, and how strongly to turn on. Among them are conserved non-coding elements, or CNEs DNA sequences that have remained remarkably similar across different species.</p><p>Think of a CNE as a sentence that nature has copied into several editions of the same book.</p><p>A mouse has it.</p><p>A bird has it.</p><p>A human has it.</p><p>And despite millions of years of evolution, much of the sentence remains almost unchanged.</p><p>That conservation is a clue: this piece of DNA probably matters.</p><p>But there was a problem. Finding these hidden sentences across enormous genomes is difficult. Researchers needed to compare many genomes, identify conserved regions, and then determine which of those regions might have evolved unusually quickly in particular branches of the evolutionary tree.</p><p>Enter CNEwrap.&nbsp;https://github.com/YanCCscu/CNEwrap</p><p>The researchers developed CNEwrap as a streamlined toolkit capable of handling large-scale genome comparisons, conserved-element detection, and evolutionary analysis. Inside it is a new algorithm called EvoAcc, designed to identify CNEs that show accelerated evolution in specific species or lineages.</p><p>Why does that matter?</p><p>Because evolution isn't just about what stays the same.</p><p>Sometimes, the most interesting story is hidden in what changed.</p><p>Imagine that nearly every species carries the same regulatory sentence, but one lineage suddenly has several unusual edits. Perhaps those changes helped shape a new body structure, a different adaptation, or another distinctive trait.</p><p>EvoAcc is designed to help researchers find these evolutionary clues. In the study's tests, it performed particularly well in scenarios involving two or three accelerated lineages and showed improved sensitivity to insertion and deletion mutations compared with several existing approaches.</p><p>The researchers also tested CNEwrap using functional genomic regions from mammals and found that EvoAcc could recover human-specific accelerated regions while identifying some signals that other methods missed.</p><p>So the story of CNEwrap is really a story about looking beyond the obvious.</p><p>For decades, scientists have often focused on the DNA that directly encodes proteins. But the genome is more like a vast library: the protein-coding genes are the main text, while non-coding regions may contain punctuation, instructions, switches, annotations, and editing notes that tell the cell how to read the book.</p><p>CNEwrap gives researchers a new way to search that hidden material.</p><p>And perhaps somewhere inside those billions of DNA letters is an evolutionary story we haven't read yet.</p><p>The exciting part is that we now have better tools to find it.</p><p>Read more about it&nbsp;https://academic.oup.com/nar/article/54/14/gkag709/8738333?</p>]]></description>
	<dc:creator>LEGE</dc:creator>
</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/40611/deepvariant-an-analysis-pipeline-that-uses-a-deep-neural-network-to-call-genetic-variants-from-next-generation-dna-sequencing-data</guid>
	<pubDate>Sat, 25 Jan 2020 13:28:09 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40611/deepvariant-an-analysis-pipeline-that-uses-a-deep-neural-network-to-call-genetic-variants-from-next-generation-dna-sequencing-data</link>
	<title><![CDATA[DeepVariant : an analysis pipeline that uses a deep neural network to call genetic variants from next-generation DNA sequencing data.]]></title>
	<description><![CDATA[<p><span>DeepVariant is an analysis pipeline that uses a deep neural network to call genetic variants from next-generation DNA sequencing data.</span></p>
<p><span><span>DeepVariant is an analysis pipeline that uses a deep neural network to call genetic variants from next-generation DNA sequencing data. DeepVariant relies on&nbsp;</span><a href="https://github.com/google/nucleus">Nucleus</a><span>, a library of Python and C++ code for reading and writing data in common genomics file formats (like SAM and VCF) designed for painless integration with the&nbsp;</span><a href="https://www.tensorflow.org/">TensorFlow</a><span>&nbsp;machine learning framework.</span></span></p>
<p><span><a href="https://ai.googleblog.com/2017/12/deepvariant-highly-accurate-genomes.html">https://ai.googleblog.com/2017/12/deepvariant-highly-accurate-genomes.html</a></span></p>
<p><span><a href="https://www.biorxiv.org/content/10.1101/092890v6">https://www.biorxiv.org/content/10.1101/092890v6</a></span></p>
<p><span><img src="https://4.bp.blogspot.com/-2KlXZO60sWE/WiGc8qlZfxI/AAAAAAAACOs/s1pNiKI8jsAvJLr1E_po5udDO8eObm_awCLcBGAs/s640/image3.png" width="640" height="427" alt="image" style="border: 0px;"></span></p><p>Address of the bookmark: <a href="https://github.com/google/deepvariant" rel="nofollow">https://github.com/google/deepvariant</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40705/malva-genotyping-by-mapping-free-allele-detection-of-known-variants</guid>
	<pubDate>Tue, 28 Jan 2020 03:39:22 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40705/malva-genotyping-by-mapping-free-allele-detection-of-known-variants</link>
	<title><![CDATA[MALVA: Genotyping by Mapping-free ALlele Detection of Known VAriants]]></title>
	<description><![CDATA[<p id="p0010">MALVA is able to genotype multi-allelic SNPs and indels without mapping reads</p>
<p id="p0015">MALVA calls correctly more indels than the most widely adopted genotyping pipelines</p>
<p id="p0020">Mapping-free approaches are as accurate as alignment-based ones, while being faster</p>
<p>More at&nbsp;<a href="https://www.sciencedirect.com/science/article/pii/S2589004219302366">https://www.sciencedirect.com/science/article/pii/S2589004219302366</a></p>
<p><a href="https://www.sciencedirect.com/science/article/pii/S2589004219302366">https://www.sciencedirect.com/science/article/pii/S2589004219302366</a></p><p>Address of the bookmark: <a href="https://github.com/AlgoLab/malva" rel="nofollow">https://github.com/AlgoLab/malva</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>