<?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/45316?offset=40</link>
	<atom:link href="https://bioinformaticsonline.com/related/45316?offset=40" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31024/dagchainer-computing-chains-of-syntenic-genes-in-complete-genomes</guid>
	<pubDate>Fri, 17 Feb 2017 16:13:35 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31024/dagchainer-computing-chains-of-syntenic-genes-in-complete-genomes</link>
	<title><![CDATA[DAGchainer: Computing Chains of Syntenic Genes in Complete Genomes]]></title>
	<description><![CDATA[<p>The DAGchainer software computes chains of syntenic genes found within complete genome sequences. As input, DAGchainer accepts a list of gene pairs with sequence homology along with their genome coordinates. Using a scoring function which accounts for the distance between neighboring genes on each DNA molecule and the BLAST E-value score between homologs, maximally scoring chains of ordered gene pairs are computed and reported. This algorithm can be used to mine large evolutionary conserved regions of genomes between two organisms. Alternatively, by examining colinear sets of homologous genes found within a single genome, segmental genome duplications can be revealed.</p>
<p>This software distribution includes both the DAGchainer utility and a Java-based graphical interface that allows the inputs and outputs to be navigated and interrogated dynamically.</p><p>Address of the bookmark: <a href="http://dagchainer.sourceforge.net/" rel="nofollow">http://dagchainer.sourceforge.net/</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31089/conpade-genome-assembly-ploidy-estimation-from-next-generation-sequencing-data</guid>
	<pubDate>Fri, 24 Feb 2017 04:55:41 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31089/conpade-genome-assembly-ploidy-estimation-from-next-generation-sequencing-data</link>
	<title><![CDATA[ConPADE: Genome Assembly Ploidy Estimation from Next-Generation Sequencing Data]]></title>
	<description><![CDATA[<p><span>ConPADE (Contig Ploidy and Allele Dosage Estimation), a probabilistic method that estimates the ploidy of any given contig/scaffold based on its allele proportions. In the process, they report findings regarding errors in sequencing. The method can be used for whole genome shotgun (WGS) sequencing data. They also show applicability of the method for variant calling and allele dosage estimation. Results for simulated and real datasets are discussed and provide evidence that ConPADE performs well as long as enough sequencing coverage is available, or the true contig ploidy is low.&nbsp;</span></p>
<p><span>https://github.com/microsoftgenomics</span></p><p>Address of the bookmark: <a href="https://github.com/microsoftgenomics" rel="nofollow">https://github.com/microsoftgenomics</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31139/pbsuite-software-for-long-read-sequencing-data-from-pacbio</guid>
	<pubDate>Mon, 27 Feb 2017 09:54:47 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31139/pbsuite-software-for-long-read-sequencing-data-from-pacbio</link>
	<title><![CDATA[PBSuite: Software for Long-Read Sequencing Data from PacBio]]></title>
	<description><![CDATA[<p><span>PBJelly - the genome upgrading tool.&nbsp;</span><br><span>PBHoney - the structural variation discovery tool&nbsp;</span><br><br><span>Both are contained within the PBSuite code found in downloads.</span><br><br><span>----- PBJelly -----</span><br><span>Read The Paper&nbsp;</span><br><a href="http://www.plosone.org/article/info%3Adoi%2F10.1371%2Fjournal.pone.0047768" target="_blank">http://www.plosone.org/article/info%3Adoi%2F10.1371%2Fjournal.pone.0047768</a><br><br><span>PBJelly is a highly automated pipeline that aligns long sequencing reads (such as PacBio RS reads or long 454 reads in fasta format) to high-confidence draft assembles. PBJelly fills or reduces as many captured gaps as possible to produce upgraded draft genomes.&nbsp;</span><br><br><span>----- PBHoney -----</span><br><span>Read The Paper</span><br><a href="http://www.biomedcentral.com/1471-2105/15/180/abstract" target="_blank">http://www.biomedcentral.com/1471-2105/15/180/abstract</a><br><br><span>PBHoney is an implementation of two variant-identification approaches designed to exploit the high mappability of long reads (i.e., greater than 10,000 bp). PBHoney considers both intra-read discordance and soft-clipped tails of long reads to identify structural variants.</span></p><p>Address of the bookmark: <a href="https://sourceforge.net/projects/pb-jelly/" rel="nofollow">https://sourceforge.net/projects/pb-jelly/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/file/view/4882/detect-the-sequence-pattern-and-its-location-in-fasta-file-with-match-and-mismatches-information</guid>
	<pubDate>Thu, 26 Sep 2013 15:02:53 -0500</pubDate>
	<link>https://bioinformaticsonline.com/file/view/4882/detect-the-sequence-pattern-and-its-location-in-fasta-file-with-match-and-mismatches-information</link>
	<title><![CDATA[Detect the sequence pattern and its location in fasta file with match and mismatches information.]]></title>
	<description><![CDATA[<p>This script is one of my old script to detect some centromeric pattern in chromosomes. User can also control the number of mismatches allowed through command line ..</p><p>To run:</p><p>perl centro.pl</p>]]></description>
	<dc:creator>Jit</dc:creator>
	<enclosure url="https://bioinformaticsonline.com/file/download/4882" length="3596" type="text/x-perl" />
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31295/mycc-accurate-binning-of-metagenomic-contigs-via-automated-clustering-sequences-using-information-of-genomic-signatures-and-marker-genes</guid>
	<pubDate>Fri, 03 Mar 2017 08:34:23 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31295/mycc-accurate-binning-of-metagenomic-contigs-via-automated-clustering-sequences-using-information-of-genomic-signatures-and-marker-genes</link>
	<title><![CDATA[MyCC: Accurate binning of metagenomic contigs via automated clustering sequences using information of genomic signatures and marker genes]]></title>
	<description><![CDATA[<p><span>MyCC, an automated binning tool that combines genomic signatures, marker genes and optional contig coverages within one or multiple samples, in order to visualize the metagenomes and to identify the reconstructed genomic fragments.</span></p>
<p><span>More at&nbsp;http://www.nature.com/articles/srep24175</span></p><p>Address of the bookmark: <a href="https://sourceforge.net/projects/sb2nhri/files/MyCC/" rel="nofollow">https://sourceforge.net/projects/sb2nhri/files/MyCC/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43362/machine-learning-for-genomics</guid>
	<pubDate>Thu, 09 Sep 2021 11:26:32 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43362/machine-learning-for-genomics</link>
	<title><![CDATA[Machine Learning for Genomics]]></title>
	<description><![CDATA[<h3>Module 1: Statistics for genomics (2-8 August 2021)</h3>
<ul>
<li>A simple intro to statistical distributions</li>
<li>hypothesis testing</li>
<li>linear models.</li>
</ul>
<p>reading:&nbsp;<a href="http://compgenomr.github.io/book/stats.html">http://compgenomr.github.io/book/stats.html</a></p>
<p>slides:&nbsp;<a href="https://github.com/BIMSBbioinfo/compgen2021/tree/main/week1/compgen2021_stats.pdf">https://github.com/BIMSBbioinfo/compgen2021/tree/main/week1/compgen2021_stats.pdf</a></p>
<p>exercises+code:&nbsp;<a href="https://github.com/BIMSBbioinfo/compgen2021/tree/main/week1/">https://github.com/BIMSBbioinfo/compgen2021/tree/main/week1/</a></p>
<h3><a href="https://github.com/BIMSBbioinfo/compgen2021#module-2-unsupervised-learning-for-genomics-9-15-august-2021"></a>Module 2: Unsupervised learning for genomics (9-15 August 2021)</h3>
<ul>
<li>Understanding basic intuition behind machine learning approaches.</li>
<li>Using unsupervised learning to cluster and visualise data points</li>
<li>Dimension reduction techniques for visualisation and as input to clustering methods</li>
</ul>
<p>reading:&nbsp;<a href="http://compgenomr.github.io/book/unsupervisedLearning.html">http://compgenomr.github.io/book/unsupervisedLearning.html</a></p>
<p>slides:&nbsp;<a href="https://github.com/BIMSBbioinfo/compgen2021/tree/main/week2/compgen2021_unsupervisedLearning.pdf">https://github.com/BIMSBbioinfo/compgen2021/tree/main/week2/compgen2021_unsupervisedLearning.pdf</a></p>
<p>exercises+code:&nbsp;<a href="https://github.com/BIMSBbioinfo/compgen2021/tree/main/week2/">https://github.com/BIMSBbioinfo/compgen2021/tree/main/week2/</a></p>
<h3><a href="https://github.com/BIMSBbioinfo/compgen2021#module-3-supervised-learning-for-genomics-16-22-august-2021"></a>Module 3: Supervised learning for genomics (16-22 August 2021)</h3>
<ul>
<li>Understanding and using supervised learning methods for predictive purposes</li>
<li>How to measure prediction performance</li>
<li>Understand and use cross-validation and related concepts</li>
</ul>
<p>reading:&nbsp;<a href="http://compgenomr.github.io/book/supervisedLearning.html">http://compgenomr.github.io/book/supervisedLearning.html</a></p>
<p>slides:&nbsp;<a href="https://github.com/BIMSBbioinfo/compgen2021/tree/main/week3/compgen2021_supervisedLearning.pdf">https://github.com/BIMSBbioinfo/compgen2021/tree/main/week3/compgen2021_supervisedLearning.pdf</a></p>
<p>exercises+code:&nbsp;<a href="https://github.com/BIMSBbioinfo/compgen2021/tree/main/week3/">https://github.com/BIMSBbioinfo/compgen2021/tree/main/week3/</a></p>
<p>https://github.com/BIMSBbioinfo/compgen2021</p><p>Address of the bookmark: <a href="https://github.com/BIMSBbioinfo/compgen2021" rel="nofollow">https://github.com/BIMSBbioinfo/compgen2021</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31345/prokka-tool-for-the-rapid-annotation-of-prokaryotic-genomes</guid>
	<pubDate>Mon, 06 Mar 2017 03:49:57 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31345/prokka-tool-for-the-rapid-annotation-of-prokaryotic-genomes</link>
	<title><![CDATA[Prokka: tool for the rapid annotation of prokaryotic genomes]]></title>
	<description><![CDATA[<p>Prokka is a software tool for the rapid annotation of prokaryotic genomes. A typical 4 Mbp genome can be fully annotated in less than 10 minutes on a quad-core computer, and scales well to 32 core SMP systems. It produces GFF3, GBK and SQN files that are ready for editing in Sequin and ultimately submitted to Genbank/DDJB/ENA.</p>
<p>&nbsp;</p><p>Address of the bookmark: <a href="http://www.vicbioinformatics.com/software.prokka.shtml" rel="nofollow">http://www.vicbioinformatics.com/software.prokka.shtml</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/45351/ai-uncovers-hidden-secrets-in-bacterial-dna-opening-new-frontiers-in-genomic-research</guid>
	<pubDate>Fri, 25 Sep 2026 22:38:42 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/45351/ai-uncovers-hidden-secrets-in-bacterial-dna-opening-new-frontiers-in-genomic-research</link>
	<title><![CDATA[AI Uncovers Hidden Secrets in Bacterial DNA, Opening New Frontiers in Genomic Research]]></title>
	<description><![CDATA[<div style="margin-top: 0.5em; margin-bottom: 0.5em;">Scientists are now using artificial intelligence in order to examine sections of bacterial DNA that have not been looked at before. This method is showing potential RNA interactions and previously unknown genetic systems which could alter our understanding of microbes. A new study presents Minerva, a genome language model, demonstrating that AI can assist researchers in identifying biological patterns that traditional techniques might fail to detect.</div><div style="margin-top: 0.5em; margin-bottom: 0.5em;">The study, which was made available as a preprint on bioRxiv on 23 September 2026, focuses on the non-coding sections of DNA that are still largely unknown. Although these areas do not produce proteins, they can contain important signals and instructions which have an effect on cell function. The research presents a novel approach to investigating how bacteria handle and control their genetic information.</div><div style="margin-top: 0.5em; margin-bottom: 0.5em;"><span style="font-weight: bold;">AI maps previously unexplored genomic regions</span></div><div style="margin-top: 0.5em; margin-bottom: 0.5em;">The team developed Minerva in order to identify possible interactions between different regions in microbial genomes; rather than depending on similarities with known sequences, Minerva predicts these relationships directly from the DNA by using patterns learned by a genome language model.</div><div style="margin-top: 0.5em; margin-bottom: 0.5em;">On 150 bacterial genomes, Minerva identified a large number of interactions that were not included in the existing annotations. The researchers stated that 84.3 per cent of the predicted intergenic base-pairing interactions were not present in the current annotations, which demonstrates that AI can be of help in generating new ideas in biology.</div><div style="margin-top: 0.5em; margin-bottom: 0.5em;"><span style="font-weight: bold;">Unusual RNA structures and viral genetic systems identified</span></div><div style="margin-top: 0.5em; margin-bottom: 0.5em;">The study also examined a bacterial RNA family known as TwoAYGGAY in Pseudomonas; the model anticipated longer RNA structures and identified associations with repeated DNA sequences, thus providing new insights into how these non-coding elements are organised and how they have evolved.</div><div style="margin-top: 0.5em; margin-bottom: 0.5em;">In a separate section of the study, the researchers examined reverse transcriptase systems associated with bacteriophages, which are viruses that infect bacteria. They identified RNA arrays that maintain their structure but have different sequences and were linked to Unknown Group 27 reverse transcriptases. The findings indicate that these RNAs could function as templates for the production of complementary DNA that is capable of forming hairpin shapes.</div><div style="margin-top: 0.5em; margin-bottom: 0.5em;">The researchers also observed that Minerva was able to detect patterns associated with protein-coding areas, even though it had not been trained to do so. This indicates that genome language models may pick up on biological signals that go beyond what they were intended to identify.</div><div style="margin-top: 0.5em; margin-bottom: 0.5em;"><span style="font-weight: bold;">Implications for future genomic research</span></div><div style="margin-top: 0.5em; margin-bottom: 0.5em;">The fact that artificial intelligence is becoming increasingly important in the field of microbial genomics is shown by the fact that models such as Minerva are able to predict interactions and identify patterns in areas which have not been extensively studied, thus helping researchers to decide what to study next and enabling them to gain a better understanding of biological systems that are still not well understood.</div><div style="margin-top: 0.5em; margin-bottom: 0.5em;">Yet the predictions do not reveal the exact function of each element identified. In order to verify which of the predicted interactions actually take place in living cells and the way in which they affect the microbes, experiments will be necessary. Although the study has undergone peer review, it does nonetheless offer a promising illustration of how machine learning can complement traditional genomics and assist scientists in moving from the identification of known genes to the exploration of the complex relationships that shape microbial life.</div><div style="margin-top: 0.5em; margin-bottom: 0.5em;">More at https://www.biorxiv.org/content/10.64898/2026.09.22.753630v2.full.pdf</div><div style="color: #000000; font-size: medium;">&nbsp;</div>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31375/cocacola-binning-metagenomic-contigs-using-sequence-composition-read-coverage-co-alignment-and-paired-end-read-linkage</guid>
	<pubDate>Tue, 07 Mar 2017 08:50:57 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31375/cocacola-binning-metagenomic-contigs-using-sequence-composition-read-coverage-co-alignment-and-paired-end-read-linkage</link>
	<title><![CDATA[COCACOLA (binning metagenomic contigs using sequence COmposition, read CoverAge, CO-alignment, and paired-end read LinkAge)]]></title>
	<description><![CDATA[<p>COCACOLA is a general framework that combines different types of information: sequence COmposition, CoverAge across multiple samples, CO-alignment to reference genomes and paired-end reads LinkAge to automatically bin contigs into OTUs. Furthermore, COCACOLA seamlessly embraces customized prior knowledge to facilitate binning accuracy.</p>
<p>News: Python version of COCACOLA is available now!</p><p>Address of the bookmark: <a href="https://github.com/younglululu/COCACOLA" rel="nofollow">https://github.com/younglululu/COCACOLA</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/view/459</guid>
	<pubDate>Thu, 11 Jul 2013 14:39:19 -0500</pubDate>
	<link>https://bioinformaticsonline.com/view/459</link>
	<title><![CDATA[Python vs Perl]]></title>
	<description><![CDATA[<p>Why bioinformatician still using Perl when Python is easy to code, good in ReXp and faster than perl?</p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>

</channel>
</rss>