<?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/38212?offset=140</link>
	<atom:link href="https://bioinformaticsonline.com/related/38212?offset=140" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41825/hnadock-a-nucleic-acid-docking-server-for-modeling-rnadna%E2%80%93rnadna-3d-complex-structures</guid>
	<pubDate>Thu, 04 Jun 2020 23:19:07 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41825/hnadock-a-nucleic-acid-docking-server-for-modeling-rnadna%E2%80%93rnadna-3d-complex-structures</link>
	<title><![CDATA[HNADOCK: a nucleic acid docking server for modeling RNA/DNA–RNA/DNA 3D complex structures]]></title>
	<description><![CDATA[<p><span>The HNADOCK server is to predict the binding complex structure between two nucleic acid molecules through a hierarchical docking algorihtm of an FFT-based global search strategy and an intrinsic scoring function for nucleic acid interactions. Users are required to provide the three-dimensional (3D) structures of the two molecules to be docked.&nbsp;</span></p><p>Address of the bookmark: <a href="http://huanglab.phys.hust.edu.cn/hnadock/" rel="nofollow">http://huanglab.phys.hust.edu.cn/hnadock/</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29583/graph-genome-suite</guid>
	<pubDate>Fri, 28 Oct 2016 07:59:54 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29583/graph-genome-suite</link>
	<title><![CDATA[Graph Genome Suite]]></title>
	<description><![CDATA[<p><span>Seven Bridges is the biomedical data analysis company accelerating breakthroughs in genomics research for cancer, drug development and precision medicine. We build self-improving systems to analyze millions of genomes, including the&nbsp;</span><strong>Graph Genome Suite</strong><span>&nbsp;&mdash; the most advanced population genomics tools in the world.</span></p><p>Address of the bookmark: <a href="https://www.sbgenomics.com/graph/" rel="nofollow">https://www.sbgenomics.com/graph/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35896/phylographer-graph-visualization-tool</guid>
	<pubDate>Wed, 07 Mar 2018 18:11:25 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35896/phylographer-graph-visualization-tool</link>
	<title><![CDATA[PhyloGrapher - Graph Visualization Tool]]></title>
	<description><![CDATA[<p><strong>PhyloGrapher</strong><span>&nbsp;is a program designed to visualize and study evolutionary relationships within families of homologous genes or proteins (elements).&nbsp;</span><strong>PhyloGrapher</strong><span>&nbsp;is a drawing tool that generates custom graphs for a given set of elements. In general, it is possible to use&nbsp;</span><strong>PhyloGrapher</strong><span>&nbsp;to visualize any type of relations between elements.&nbsp;</span></p>
<p><span>https://www.youtube.com/watch?v=WgufqYMHCvM</span></p><p>Address of the bookmark: <a href="http://www.atgc.org/PhyloGrapher/PhyloGrapher_Welcome.html" rel="nofollow">http://www.atgc.org/PhyloGrapher/PhyloGrapher_Welcome.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44445/ppanggolin-depicting-microbial-species-diversity-via-a-partitioned-pangenome-graph-of-linked-neighbors</guid>
	<pubDate>Thu, 01 Feb 2024 00:24:32 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44445/ppanggolin-depicting-microbial-species-diversity-via-a-partitioned-pangenome-graph-of-linked-neighbors</link>
	<title><![CDATA[PPanGGOLiN: Depicting microbial species diversity via a Partitioned PanGenome Graph Of Linked Neighbors]]></title>
	<description><![CDATA[<p dir="auto"><span>PPanGGOLiN</span>&nbsp;(<a href="https://doi.org/10.1371/journal.pcbi.1007732">Gautreau et al. 2020</a>) is a software suite used to create and manipulate prokaryotic pangenomes from a set of either genomic DNA sequences or provided genome annotations. It is designed to scale up to tens of thousands of genomes. It has the specificity to partition the pangenome using a statistical approach rather than using fixed thresholds which gives it the ability to work with low-quality data such as&nbsp;<em>Metagenomic Assembled Genomes (MAGs)</em>&nbsp;or&nbsp;<em>Single-cell Amplified Genomes (SAGs)</em>&nbsp;thus taking advantage of large scale environmental studies and letting users study the pangenome of uncultivable species.</p>
<p dir="auto">A complete documentation is available&nbsp;<a href="https://ppanggolin.readthedocs.io/">here</a>.</p>
<p dir="auto" style="text-align: center;"><a href="https://github.com/labgem/PPanGGOLiN/blob/master/docs/_static/logo.png" target="_blank"><img src="https://github.com/labgem/PPanGGOLiN/raw/master/docs/_static/logo.png" alt="logo" style="border: 0px;"></a></p><p>Address of the bookmark: <a href="https://github.com/labgem/PPanGGOLiN" rel="nofollow">https://github.com/labgem/PPanGGOLiN</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44497/graphpath-a-graph-attention-model-for-molecular-stratification-with-interpretability-based-on-the-pathway-pathway-interaction-network</guid>
	<pubDate>Wed, 27 Mar 2024 20:51:21 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44497/graphpath-a-graph-attention-model-for-molecular-stratification-with-interpretability-based-on-the-pathway-pathway-interaction-network</link>
	<title><![CDATA[GraphPath: A graph attention model for molecular stratification with interpretability based on the pathway-pathway interaction network]]></title>
	<description><![CDATA[<p><span>Achieving accurate and interpretable clinical predictions requires paramount attention to thoroughly characterizing patients at both the molecular and biological pathway levels. In this paper, we present GraphPath, a biological knowledge-driven graph neural network with multi-head self-attention mechanism that implements the pathway-pathway interaction network. We train GraphPath to classify the cancer status of patients with prostate cancer based on their multi-omics profiling.</span></p>
<p><span><img src="https://github.com/amazingma/GraphPath/raw/main/Figures/GraphPath.png" alt="image" style="border: 0px;"></span></p><p>Address of the bookmark: <a href="https://github.com/amazingma/GraphPath" rel="nofollow">https://github.com/amazingma/GraphPath</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/44751/large-language-models-in-bioinformatics-transforming-data-analysis-and-interpretation</guid>
	<pubDate>Thu, 02 Jan 2025 11:26:29 -0600</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/44751/large-language-models-in-bioinformatics-transforming-data-analysis-and-interpretation</link>
	<title><![CDATA[Large Language Models in Bioinformatics: Transforming Data Analysis and Interpretation]]></title>
	<description><![CDATA[<p>The integration of artificial intelligence (AI) into bioinformatics has ushered in a new era of computational biology. Among the most transformative advancements are large language models (LLMs), such as GPT and BERT, which leverage deep learning to process and interpret vast amounts of text data. These models are reshaping bioinformatics by enhancing data analysis, hypothesis generation, and literature mining.</p><h3>Understanding Large Language Models</h3><p>LLMs are AI systems trained on extensive datasets of natural language. Their ability to model context, identify patterns, and generate coherent language has proven invaluable across domains, including bioinformatics. By fine-tuning these models on biological datasets, researchers can unlock insights into molecular biology, systems biology, and beyond.</p><h3>Key Applications of LLMs in Bioinformatics</h3><h4>1. <strong>Annotating Biological Data</strong></h4><p>Annotating genomic and proteomic data is fundamental yet labor-intensive. LLMs streamline this process by extracting functional annotations from literature and databases, predicting gene and protein functions, and providing automated insights.</p><h4>2. <strong>Mining Scientific Literature</strong></h4><p>The exponential growth of publications presents a challenge for researchers to stay updated. LLMs can process large volumes of text to extract key findings, summarize papers, and identify trends, thereby facilitating efficient literature reviews.</p><h4>3. <strong>Predicting Gene and Protein Functions</strong></h4><p>By leveraging sequence data and annotations, LLMs can predict the functions of uncharacterized genes and proteins. This capability is particularly useful for studying non-model organisms and orphan genes.</p><h4>4. <strong>Drug Discovery and Repurposing</strong></h4><p>LLMs enable pattern recognition across chemical, genomic, and clinical datasets, identifying novel drug candidates and repurposing existing drugs for new therapeutic targets. They can simulate interactions between drugs and biological molecules, accelerating the discovery pipeline.</p><h4>5. <strong>Generating Hypotheses for Research</strong></h4><p>LLMs analyze complex datasets to propose testable hypotheses. For example, they can predict protein-protein interactions, identify regulatory motifs, or model evolutionary processes in genomes.</p><h3>Advantages of LLMs in Bioinformatics</h3><ul>
<li>
<p><strong>Scalability:</strong> LLMs process massive datasets rapidly, reducing the time required for data analysis.</p>
</li>
<li>
<p><strong>Versatility:</strong> These models adapt to diverse bioinformatics tasks, from genomic annotation to network analysis.</p>
</li>
<li>
<p><strong>Contextual Insights:</strong> By synthesizing information across disparate datasets, LLMs provide integrative insights into biological systems.</p>
</li>
</ul><h3>Challenges in Applying LLMs</h3><p>Despite their promise, LLMs face limitations:</p><ul>
<li>
<p><strong>Data Quality and Bias:</strong> Inaccurate or biased datasets can affect model predictions, necessitating rigorous data curation.</p>
</li>
<li>
<p><strong>Interpretability:</strong> Understanding the decision-making process of LLMs remains a critical challenge, especially in high-stakes fields like genomics and medicine.</p>
</li>
<li>
<p><strong>Resource Intensity:</strong> Training and deploying LLMs require substantial computational power, which can limit accessibility.</p>
</li>
<li>
<p><strong>Ethical Concerns:</strong> Handling sensitive genomic data raises privacy and security issues, emphasizing the need for ethical guidelines.</p>
</li>
</ul><h3>Future Prospects</h3><p>The continued development of LLMs tailored for bioinformatics promises exciting advancements. Specialized models trained on omics data, open-access platforms, and interdisciplinary collaborations will expand the utility of LLMs. Moreover, integrating LLMs with other AI technologies, such as graph neural networks and reinforcement learning, can unlock deeper biological insights.</p><h3>Conclusion</h3><p>Large language models are revolutionizing bioinformatics by addressing longstanding challenges in data annotation, literature mining, and function prediction. Their ability to analyze complex biological datasets efficiently positions them as indispensable tools for modern research. As bioinformatics embraces AI, the synergy between LLMs and biological sciences holds the potential to unravel the complexities of life with unprecedented precision and scale.</p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38169/amstat-display-statistics-of-large-sequence-files-from-next-generation-sequencing-projects</guid>
	<pubDate>Fri, 09 Nov 2018 13:34:56 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38169/amstat-display-statistics-of-large-sequence-files-from-next-generation-sequencing-projects</link>
	<title><![CDATA[AMStat: display statistics of large sequence files from next generation sequencing projects]]></title>
	<description><![CDATA[<p><span>SAMStat is an efficient C program to quickly display statistics of large sequence files from next generation sequencing projects. When applied to&nbsp;</span><a href="http://samstat.sourceforge.net/#about">SAM/BAM</a><span>&nbsp;files all statistics are reported for unmapped, poorly and accurately mapped reads separately. This allows for identification of a variety of problems, such as remaining linker and adaptor sequences, causing poor mapping. Apart from this SAMStat can be used to verify individual processing steps in large analysis pipelines.</span></p><p>Address of the bookmark: <a href="http://samstat.sourceforge.net/" rel="nofollow">http://samstat.sourceforge.net/</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/4184/zombies-like-bacteria</guid>
	<pubDate>Tue, 03 Sep 2013 08:44:15 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/4184/zombies-like-bacteria</link>
	<title><![CDATA[Zombies like bacteria!!!]]></title>
	<description><![CDATA[<p>Do you believe in Zombies stories &hellip; Hmm confused? Don&rsquo;t worry there is a news for you. Scientists from the Integrated Ocean Drilling Program have announced the findings &nbsp;of the long-lived bacteria, reproducing only once every 10,000 years, which have been found in rocks 2.5km (1.5 miles) below the ocean floor that are as much as 100 million years old.</p><p><span>" the microbes exist in very low concentrations, of around 1,000 microbes in every tea spoon full of rock, compared with billions or trillions of bacteria that would typically be found in the same amount of soil at Earth's surface."</span></p><p><span>Reference:</span></p><p><span><a href="http://www.bbc.co.uk/news/science-environment-23855436">http://www.bbc.co.uk/news/science-environment-23855436</a></span></p><p>&nbsp;</p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/28303/fancy-oneliner-for-bioinformatics</guid>
	<pubDate>Thu, 07 Jul 2016 12:05:50 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/28303/fancy-oneliner-for-bioinformatics</link>
	<title><![CDATA[Fancy Oneliner for Bioinformatics !!]]></title>
	<description><![CDATA[<p><span>This webpage lists some of the one-liners that we frequently use in metagenomic analyses. You can click on the following links to browse through different topics. You can copy/paste the commands as they are in your terminal screen, provided you follow the same naming conventions and folder structures as we have. We are sharing these codes with the intention that if they are useful and help you in your analyses, then we will be appropriately credited as considerable effort has been put into devising them.</span></p><p>Address of the bookmark: <a href="http://userweb.eng.gla.ac.uk/umer.ijaz/bioinformatics/oneliners.html" rel="nofollow">http://userweb.eng.gla.ac.uk/umer.ijaz/bioinformatics/oneliners.html</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43048/coverm-read-coverage-calculator-for-metagenomics</guid>
	<pubDate>Thu, 29 Apr 2021 23:39:14 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43048/coverm-read-coverage-calculator-for-metagenomics</link>
	<title><![CDATA[CoverM: Read coverage calculator for metagenomics]]></title>
	<description><![CDATA[<p>CoverM aims to be a configurable, easy to use and fast DNA read coverage and relative abundance calculator focused on metagenomics applications.</p>
<p>CoverM calculates coverage of genomes/MAGs&nbsp;<code>coverm genome</code>&nbsp;(<a href="https://wwood.github.io/CoverM/coverm-genome.html">help</a>) or individual contigs&nbsp;<code>coverm contig</code>&nbsp;(<a href="https://wwood.github.io/CoverM/coverm-contig.html">help</a>). Calculating coverage by read mapping, its input can either be BAM files sorted by reference, or raw reads and reference genomes in various formats.</p><p>Address of the bookmark: <a href="https://github.com/wwood/CoverM" rel="nofollow">https://github.com/wwood/CoverM</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>

</channel>
</rss>