<?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/32719?offset=200</link>
	<atom:link href="https://bioinformaticsonline.com/related/32719?offset=200" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32048/json</guid>
	<pubDate>Tue, 04 Apr 2017 08:02:39 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32048/json</link>
	<title><![CDATA[JSON]]></title>
	<description><![CDATA[<p><strong>JSON</strong>&nbsp;(JavaScript Object Notation) is a lightweight data-interchange format. It is easy for humans to read and write. It is easy for machines to parse and generate. It is based on a subset of the&nbsp;<a href="http://javascript.crockford.com/">JavaScript Programming Language</a>,&nbsp;<a href="http://www.ecma-international.org/publications/files/ecma-st/ECMA-262.pdf">Standard ECMA-262 3rd Edition - December 1999</a>. JSON is a text format that is completely language independent but uses conventions that are familiar to programmers of the C-family of languages, including C, C++, C#, Java, JavaScript, Perl, Python, and many others. These properties make JSON an ideal data-interchange language.</p>
<p>JSON is built on two structures:</p>
<ul>
<li>A collection of name/value pairs. In various languages, this is realized as an&nbsp;<em>object</em>, record, struct, dictionary, hash table, keyed list, or associative array.</li>
<li>An ordered list of values. In most languages, this is realized as an&nbsp;<em>array</em>, vector, list, or sequence.</li>
</ul>
<p>These are universal data structures. Virtually all modern programming languages support them in one form or another. It makes sense that a data format that is interchangeable with programming languages also be based on these structures.</p><p>Address of the bookmark: <a href="http://json.org/" rel="nofollow">http://json.org/</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32465/tetra-nucleotide-analysis</guid>
	<pubDate>Thu, 04 May 2017 05:07:41 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32465/tetra-nucleotide-analysis</link>
	<title><![CDATA[Tetra-Nucleotide Analysis]]></title>
	<description><![CDATA[<p>A tetra-nucleotide is a fragment of DNA sequence with 4 bases (e.g. AGTC or TTGG). Pride&nbsp;<em>et al.</em>&nbsp;(2003) showed that the frequency of tetra-nucleotides in bacterial genomes contain useful, albeit weak, phylogenetic signals. Even though tetra-nucleotide analysis (TNA) utilizes the information of whole genome, it is evident that it cannot replace other alignment-based phylogenetic methods such as&nbsp;<a href="https://chunlab.wordpress.com/orthoani/">OrthoANI</a>&nbsp;or&nbsp;16S rRNA phylogeny. However, TNA can be useful for&nbsp;phylogenetic characterization when whole genome or 16S rRNA gene information is not available. For example, a partial genomic fragment obtained from a metagenome can be identified by TNA (Teeling&nbsp;<em>et al.</em>, 2004). TNA is also fast enough that it can be&nbsp;used&nbsp;as a search engine against a large genome database.</p><p>Address of the bookmark: <a href="https://chunlab.wordpress.com/tetra-nucleotide-analysis/" rel="nofollow">https://chunlab.wordpress.com/tetra-nucleotide-analysis/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/28269/4dgenome</guid>
	<pubDate>Mon, 04 Jul 2016 00:44:55 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/28269/4dgenome</link>
	<title><![CDATA[4DGenome]]></title>
	<description><![CDATA[<p><span>Records in 4DGenome are compiled through comprehensive literature curation of experimentally-derived and computationally-predicted interactions. The current release contains 4,433,071 experimentally-derived and 3,605,176 computationally-predicted interactions in 5 organisms. Experimental data cover both high throughput datasets and individiual focused studies.&nbsp;</span><br><br><span>All interaction data are freely available in a standardized file format. Records can be queried by genomic regions, gene names, organism, and detection technology.&nbsp;</span></p><p>Address of the bookmark: <a href="http://4dgenome.research.chop.edu/" rel="nofollow">http://4dgenome.research.chop.edu/</a></p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40613/genome-in-a-bottle-giab-consortium</guid>
	<pubDate>Sat, 25 Jan 2020 13:50:52 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40613/genome-in-a-bottle-giab-consortium</link>
	<title><![CDATA[Genome in a Bottle (GIAB) Consortium]]></title>
	<description><![CDATA[<p><span>The</span><a href="http://www.genomeinabottle.org/"> Genome in a Bottle (GIAB) Consortium</a><span> is a public-private-academic consortium hosted by </span><a href="http://www.nist.gov/" target="_blank">NIST</a><span> to develop the technical infrastructure (reference standards, reference methods, and reference data) to enable translation of whole human genome sequencing to clinical practice. </span></p>
<p><span><a href="https://www.nist.gov/news-events/news/2016/09/nist-releases-new-family-standardized-genomes">https://www.nist.gov/news-events/news/2016/09/nist-releases-new-family-standardized-genomes</a></span></p><p>Address of the bookmark: <a href="https://jimb.stanford.edu/giab/" rel="nofollow">https://jimb.stanford.edu/giab/</a></p>]]></description>
	<dc:creator>Jit</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/34569/ksnp30-snp-detection-and-phylogenetic-analysis-of-genomes-without-genome-alignment-or-reference-genome</guid>
	<pubDate>Fri, 08 Dec 2017 16:48:40 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34569/ksnp30-snp-detection-and-phylogenetic-analysis-of-genomes-without-genome-alignment-or-reference-genome</link>
	<title><![CDATA[kSNP3.0: SNP detection and phylogenetic analysis of genomes without genome alignment or reference genome]]></title>
	<description><![CDATA[<p><span>Sept. 20, 2017 Version 3.1 released. Major upgrade. Version 3.1 fixes the problems with SNP annotation that arose when NCBI discontinued use of GI numbers. Please read carefully the Preface (page 3) and the File of annotated genomes section (pages 9-10) in the version 3.1 User Guide. Thanks to Tom Slezak for revsing the get_genbank_file3 script and to Tod Stuber (USDA) for testing version 3.1 even though he doesn't need the annotation feature. All users are encouraged to upgrade to version 3.1.&nbsp;<br></span></p><p>Address of the bookmark: <a href="https://sourceforge.net/projects/ksnp/files/" rel="nofollow">https://sourceforge.net/projects/ksnp/files/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36730/bprna-large-scale-automated-annotation-and-analysis-of-rna-secondary-structure</guid>
	<pubDate>Wed, 23 May 2018 03:24:33 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36730/bprna-large-scale-automated-annotation-and-analysis-of-rna-secondary-structure</link>
	<title><![CDATA[bpRNA: large-scale automated annotation and analysis of RNA secondary structure]]></title>
	<description><![CDATA[<p>bpRNA, a novel annotation tool capable of parsing RNA structures, including complex pseudoknot-containing RNAs, to yield an objective, precise, compact, unambiguous, easily-interpretable description of all loops, stems, and pseudoknots, along with the positions, sequence, and flanking base pairs of each such structural feature.</p>
<p>The bpRNA code is written in perl and requires the Graph perl module. Several additional scripts for analysis are included. The source code is available at http://github.com/hendrixlab/bpRNA.</p><p>Address of the bookmark: <a href="http://github.com/hendrixlab/bpRNA" rel="nofollow">http://github.com/hendrixlab/bpRNA</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29272/decipher</guid>
	<pubDate>Fri, 30 Sep 2016 09:33:12 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29272/decipher</link>
	<title><![CDATA[DECIPHER]]></title>
	<description><![CDATA[<p>DECIPHER is a software toolset that can be used to maintain, analyze, and decipher large amounts of DNA sequence data. To install DECIPHER, see the <a href="http://DECIPHER.cee.wisc.edu/Download.html">Downloads</a> page.<br><br> To begin using DECIPHER read the "Getting Started DECIPHERing" tutorial. Refer to the PDF documents below for instructions on how to use DECIPHER for various tasks.</p><p>Address of the bookmark: <a href="http://decipher.cee.wisc.edu/Documentation.html" rel="nofollow">http://decipher.cee.wisc.edu/Documentation.html</a></p>]]></description>
	<dc:creator>Anjana</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29410/entrez-direct-e-utilities-on-the-unix-command-line</guid>
	<pubDate>Wed, 19 Oct 2016 08:06:24 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29410/entrez-direct-e-utilities-on-the-unix-command-line</link>
	<title><![CDATA[Entrez Direct: E-utilities on the UNIX Command Line]]></title>
	<description><![CDATA[<p>Entrez Direct (EDirect) is an advanced method for accessing the NCBI's suite of interconnected databases (publication, sequence, structure, gene, variation, expression, etc.) from a UNIX terminal window. Functions take search terms from command-line arguments. Individual operations are combined to build multi-step queries. Record retrieval and formatting normally complete the process.</p>
<p>EDirect also provides an argument-driven function that simplifies the extraction of data from document summaries or other results that are returned in structured XML format. This can eliminate the need for writing custom software to answer ad hoc questions. Queries can move seamlessly between EDirect commands and UNIX utilities or scripts to perform actions that cannot be accomplished entirely within Entrez.</p><p>Address of the bookmark: <a href="https://www.ncbi.nlm.nih.gov/books/NBK179288/" rel="nofollow">https://www.ncbi.nlm.nih.gov/books/NBK179288/</a></p>]]></description>
	<dc:creator>Anjana</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/33221/genome-annotation-transfer-utility-gatu</guid>
	<pubDate>Mon, 29 May 2017 05:54:53 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/33221/genome-annotation-transfer-utility-gatu</link>
	<title><![CDATA[Genome Annotation Transfer Utility (GATU)]]></title>
	<description><![CDATA[<p>Genome Annotation Transfer Utility (GATU) was designed to facilitate quick, efficient annotation of similar genomes using genomes that have already been annotated. For example, whenever a new strain of SARS coronavirus is sequenced, it is possible, using GATU, to automatically annotate the new strain using a previously-annotated strain of SARS CoV. This saves researchers from tedious manual annotation of these sequences.</p>
<p>The program utilizes tBLASTn and BLASTn algorithms to map genes from the reference genome (the annotated strain) to the new sequence (the unannotated strain). The goal is to annotate the majority of the new genome&rsquo;s genes in a single step. ORFs present in the target genome and absent from the reference genome are also identified; these ORFs can be further analyzed using BLAST, VGO and BBB. Afterwards, they can either be accepted for/rejected from annotation. GATU can handle multiple-exon genes as well as mature peptides. Although it was designed for use with viral genomes, GATU can also be used to help annotate larger genomes (ie. bacterial genomes).</p>
<p>The output is saved in GenBank, XML, or EMBL file format.</p><p>Address of the bookmark: <a href="https://virology.uvic.ca/help/tool-help/help-books/genome-annotation-transfer-utility-gatu-documentation/" rel="nofollow">https://virology.uvic.ca/help/tool-help/help-books/genome-annotation-transfer-utility-gatu-documentation/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>