<?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/22807?offset=1450</link>
	<atom:link href="https://bioinformaticsonline.com/related/22807?offset=1450" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/44770/nvidia-and-arc-institute-unveil-evo-2-a-breakthrough-ai-for-dna-design</guid>
	<pubDate>Fri, 21 Feb 2025 10:39:47 -0600</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/44770/nvidia-and-arc-institute-unveil-evo-2-a-breakthrough-ai-for-dna-design</link>
	<title><![CDATA[NVIDIA and Arc Institute Unveil Evo 2: A Breakthrough AI for DNA Design]]></title>
	<description><![CDATA[<p>NVIDIA and the Arc Institute have introduced <strong style="font-size: 12.8px;">Evo 2</strong>, a groundbreaking AI model designed to <strong style="font-size: 12.8px;">understand, predict, and generate DNA sequences</strong>. This marks a major advancement in computational biology, offering scientists an unprecedented tool to decode the genetic blueprint of life and even design entirely new biological systems.</p><h3><strong>The Power of Evo 2: AI Meets DNA</strong></h3><p>Evo 2 is <strong>the largest AI model for biology ever created</strong>, trained on an astonishing <strong>9.3 trillion DNA "letters"</strong> (nucleotides) carefully selected from genomes spanning the entire tree of life. This massive dataset ensures that Evo 2 can recognize patterns and relationships in genetic sequences at an unparalleled scale.</p><p>For the first time, scientists can <strong>design DNA with AI</strong>, moving beyond simple sequence analysis to active DNA generation. Evo 2 enables researchers to <strong>predict, modify, and even create entire genetic sequences</strong>, opening new possibilities in medicine, agriculture, and synthetic biology.</p><h3><strong>Decoding the Dark Genome</strong></h3><p>One of the biggest challenges in genetics is understanding the <strong>non-coding regions</strong> of DNA&mdash;vast stretches of the genome that do not code for proteins but play crucial roles in regulating gene expression. These regions control when and how genes are activated, influencing everything from development to disease.</p><p>Evo 2 is designed to <strong>decode these non-coding elements</strong>, helping researchers uncover their functions and use this knowledge to develop gene-based therapies, synthetic life forms, and precision agriculture solutions.</p><h3><strong>From Reading DNA to Writing It</strong></h3><p>To put Evo 2&rsquo;s impact into perspective:</p><ul>
<li><strong>Previous AI models could "read" DNA</strong> like a book, analyzing genetic sequences and identifying patterns.</li>
<li><strong>Evo 2 can "write" entirely new DNA</strong>, designing functional genes, chromosomes, and even full genomes from scratch.</li>
</ul><p>This means scientists can now <strong>engineer biological systems with AI</strong>, designing new proteins, metabolic pathways, and genetic circuits to address real-world challenges.</p><h3><strong>A Step Toward Generative Biology</strong></h3><p>The Arc Institute describes Evo 2 as a major step toward <strong>"generative biology"</strong>&mdash;a revolutionary approach where AI is used to create <strong>novel biological structures</strong> rather than just analyzing existing ones. This could lead to breakthroughs such as:</p><ul>
<li><strong>New medicines</strong>: AI-generated enzymes and proteins tailored for targeted therapies.</li>
<li><strong>Disease-resistant crops</strong>: Genetically optimized plants for higher yield and climate resilience.</li>
<li><strong>Synthetic organisms</strong>: Custom-designed microbes for bioremediation, biofuel production, and industrial applications.</li>
</ul><h3><strong>An Open-Source Revolution</strong></h3><p>Unlike many proprietary AI models, <strong>Evo 2 is open source</strong>, making its capabilities accessible to researchers worldwide. This democratization of AI-driven biology means that scientists from different disciplines can <strong>collaborate, experiment, and innovate</strong>, accelerating discoveries in genetic engineering and synthetic biology.</p><p>With Evo 2, the boundaries of what&rsquo;s possible in <strong>DNA design, genetic engineering, and biological innovation</strong> are being redrawn. The future of life sciences is no longer just about understanding life&rsquo;s code&mdash;it&rsquo;s about writing it.</p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/videolist/watch/16686/sequence-viewer-download-transcripts-exons-and-proteins</guid>
	<pubDate>Mon, 15 Sep 2014 17:30:36 -0500</pubDate>
	<link>https://bioinformaticsonline.com/videolist/watch/16686/sequence-viewer-download-transcripts-exons-and-proteins</link>
	<title><![CDATA[Sequence Viewer: Download Transcripts, Exons and Proteins]]></title>
	<description><![CDATA[<iframe width="" height="" src="https://www.youtube-nocookie.com/embed/ZWnLyYKozaI" frameborder="0" allowfullscreen></iframe>How to download FASTA sequence for certain gene features while in the NCBI's Sequence Viewer.

Sequence Viewer homepage:
www.ncbi.nlm.nih.gov/projects/sviewer/

Sequence Viewer playlist:
https://www.youtube.com/playlist?list=PL76D7EE6A6A8AC1C3]]></description>
	
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/22393/narcis-fernandez-fuentes-lab</guid>
  <pubDate>Mon, 25 May 2015 07:30:00 -0500</pubDate>
  <link></link>
  <title><![CDATA[Narcis Fernandez-Fuentes Lab]]></title>
  <description><![CDATA[
<p>Welcome to our web-site compiling all the research-related activities of the group. Our research interests relate to a number of areas within Bioinformatics. We have a long-standing interest in protein structure prediction and structure-to-function relationships. We work in the study of biomolecular interactions, modeling of protein complexes, the study and characterization of protein-protein interactions, peptide design, modeling of genetic variation, structure-based protein design and different aspects of Plant Bioinformatics. Take a look at the our databases and servers and the list of publications for more information.</p>

<p>More at http://www.bioinsilico.org/</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34565/fogsaa-fast-optimal-global-sequence-alignment-algorithm</guid>
	<pubDate>Fri, 08 Dec 2017 14:41:08 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34565/fogsaa-fast-optimal-global-sequence-alignment-algorithm</link>
	<title><![CDATA[FOGSAA: Fast Optimal Global Sequence Alignment Algorithm]]></title>
	<description><![CDATA[<p>Sequence alignment algorithms are widely used to infer similarirty and the point of differences between pair of sequences. FOGSAA is a fast Global alignment algorithm. It is basically a branch and bound approach which starts branch expansion in a greedy way taking the symbols from the given pair of sequences (protein or nucleotide) and results in an optimal alignment faster than conventional dymanic programming techniques. It is also better than the heuristic methods with respect to alignment quality.</p><p>Address of the bookmark: <a href="http://www.isical.ac.in/~bioinfo_miu/FOGSAA.htm" rel="nofollow">http://www.isical.ac.in/~bioinfo_miu/FOGSAA.htm</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41689/medaka-sequence-correction-provided-by-ont-research</guid>
	<pubDate>Mon, 18 May 2020 16:28:00 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41689/medaka-sequence-correction-provided-by-ont-research</link>
	<title><![CDATA[medaka: Sequence correction provided by ONT Research]]></title>
	<description><![CDATA[<p><code>medaka</code><span>&nbsp;is a tool to create a consensus sequence from nanopore sequencing data. This task is performed using neural networks applied from a pileup of individual sequencing reads against a draft assembly. It outperforms graph-based methods operating on basecalled data, and can be competitive with state-of-the-art signal-based methods, whilst being much faster.</span></p><p>Address of the bookmark: <a href="https://github.com/nanoporetech/medaka" rel="nofollow">https://github.com/nanoporetech/medaka</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/44370/ncbiblast-2141-now-available</guid>
	<pubDate>Wed, 30 Aug 2023 02:36:13 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/44370/ncbiblast-2141-now-available</link>
	<title><![CDATA[NCBIBLAST+ 2.14.1 now available]]></title>
	<description><![CDATA[<p><a href="https://www.linkedin.com/feed/hashtag/?keywords=ncbiblast&amp;highlightedUpdateUrns=urn%3Ali%3Aactivity%3A7101231946264924160">#NCBIBLAST</a><span>+ 2.14.1 now available with improved documentation, faster and more reliable database downloads, and some bug fixes.&nbsp;</span></p><p>Check out the changes they made.</p><p>They added the&nbsp;<code><span>cleanup-blastdb-volumes.py</span></code>&nbsp;script to remove unused BLAST database volumes. Read the documentation&nbsp;<a href="https://www.ncbi.nlm.nih.gov/books/NBK592857/">here</a>.</p><p>They also switched the protocol from&nbsp;<code><span>ftp</span></code>&nbsp;to&nbsp;<code><span>https</span></code>&nbsp;to access BLAST databases for increased performance and reliability when downloading data from the NCBI with the&nbsp;<code><span>update_blastdb.pl</span></code>&nbsp;script.</p><p>And fixed a few bugs related to downloading data from the NCBI, and&nbsp;<code><span>mt_mode</span></code>&nbsp;crashing&nbsp;<code><span>blastn</span></code>&nbsp;and&nbsp;<code><span>blastx</span></code>.</p><p>Check out the&nbsp;<a href="https://www.ncbi.nlm.nih.gov/books/NBK131777/">release notes</a>.</p><p>Download&nbsp;<a href="https://ftp.ncbi.nlm.nih.gov/blast/executables/blast+/2.14.1/">BLAST+ 2.14.1</a></p><p>Questions or comments? Please write the&nbsp;<a href="https://support.nlm.nih.gov/support/create-case/">BLAST help desk</a>.</p><p><span><span>More info and download:</span>&nbsp;https://blast.ncbi.nlm.nih.gov/doc/blast-news/2023-BLAST-News.html</span></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34391/taxoblast-taxoblast-is-a-pipeline-to-identify-contamination-in-genomic-sequence</guid>
	<pubDate>Thu, 23 Nov 2017 08:37:15 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34391/taxoblast-taxoblast-is-a-pipeline-to-identify-contamination-in-genomic-sequence</link>
	<title><![CDATA[Taxoblast : Taxoblast is a pipeline to identify contamination in genomic sequence]]></title>
	<description><![CDATA[<p><span>Modern genome sequencing strategies are highly sensitive to contamination making the detection of foreign DNA sequences an important part of analysis pipelines. Here we use Taxoblast, a simple pipeline with a graphical user interface, for the post-assembly detection of contaminating sequences in the published genome of the kelp&nbsp;</span><em>Saccharina japonica</em><span>. Analyses were based on multiple blastn searches with short sequence fragments. They revealed a number of probable bacterial contaminations as well as hybrid scaffolds that contain both bacterial and algal sequences. This or similar types of analysis, in combination with manual curation, may thus constitute a useful complement to standard bioinformatics analyses prior to submission of genomic data to public repositories. Our analysis pipeline is open-source and freely available at&nbsp;</span><a href="http://sdittami.altervista.org/taxoblast" title="">http://sdittami.altervista.org/taxoblast</a><span>&nbsp;and via SourceForge (</span><a href="https://sourceforge.net/projects/taxoblast" title="">https://sourceforge.net/projects/taxoblast</a><span>).</span></p><p>Address of the bookmark: <a href="https://sourceforge.net/projects/taxoblast/files/" rel="nofollow">https://sourceforge.net/projects/taxoblast/files/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36974/many-to-many-pairwise-alignments-of-two-sequence-sets</guid>
	<pubDate>Tue, 19 Jun 2018 08:34:15 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36974/many-to-many-pairwise-alignments-of-two-sequence-sets</link>
	<title><![CDATA[Many-to-many pairwise alignments of two sequence sets]]></title>
	<description><![CDATA[needleall reads a set of input sequences and compares them all to one or more sequences, writing their optimal global sequence alignments to file. It uses the Needleman-Wunsch alignment algorithm to find the optimum alignment (including gaps) of two sequences along their entire length. The algorithm uses a dynamic programming method to ensure the alignment is optimum, by exploring all possible alignments and choosing the best. A scoring matrix is read that contains values for every possible residue or nucleotide match. Needleall finds the alignment with the maximum possible score where the score of an alignment is equal to the sum of the matches taken from the scoring matrix, minus penalties arising from opening and extending gaps in the aligned sequences. The substitution matrix and gap opening and extension penalties are user-specified.<p>Address of the bookmark: <a href="http://emboss.sourceforge.net/apps/release/6.6/emboss/apps/needleall.html" rel="nofollow">http://emboss.sourceforge.net/apps/release/6.6/emboss/apps/needleall.html</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37962/wtdbg2-a-de-novo-sequence-assembler-for-long-noisy-reads-produced-by-pacbio-or-oxford-nanopore</guid>
	<pubDate>Fri, 19 Oct 2018 08:48:43 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37962/wtdbg2-a-de-novo-sequence-assembler-for-long-noisy-reads-produced-by-pacbio-or-oxford-nanopore</link>
	<title><![CDATA[Wtdbg2: a de novo sequence assembler for long noisy reads produced by PacBio or Oxford Nanopore]]></title>
	<description><![CDATA[<p><span>Wtdbg2 is a&nbsp;</span><em>de novo</em><span>&nbsp;sequence assembler for long noisy reads produced by PacBio or Oxford Nanopore Technologies (ONT). It assembles raw reads without error correction and then builds the consensus from intermediate assembly output. Wtdbg2 is able to assemble the human and even the 32Gb&nbsp;</span><a href="https://www.nature.com/articles/nature25458">Axolotl</a><span>&nbsp;genome at a speed tens of times faster than&nbsp;</span><a href="https://github.com/marbl/canu">CANU</a><span>&nbsp;and&nbsp;</span><a href="https://github.com/PacificBiosciences/FALCON">FALCON</a><span>while producing contigs of comparable base accuracy.</span></p><p>Address of the bookmark: <a href="https://github.com/ruanjue/wtdbg2" rel="nofollow">https://github.com/ruanjue/wtdbg2</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39689/msaprobs-parallel-and-accurate-multiple-sequence-alignment</guid>
	<pubDate>Tue, 09 Jul 2019 23:58:44 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39689/msaprobs-parallel-and-accurate-multiple-sequence-alignment</link>
	<title><![CDATA[MSAProbs - Parallel and accurate multiple sequence alignment]]></title>
	<description><![CDATA[<p><strong>MSAProbs</strong><span>&nbsp;is a well-established state-of-the-art multiple sequence alignment algorithm for protein sequences. The design of MSAProbs is based on a combination of pair hidden Markov models and partition functions to calculate posterior probabilities. Assessed using the popular benchmarks: BAliBASE, PREFAB, SABmark and OXBENCH, MSAProbs achieves statistically significant accuracy improvements over the existing top performing aligners, including ClustalW, MAFFT, MUSCLE, ProbCons and Probalign. In addition, MSAProbs is optimized for shared-memory CPUs by employing a multi-threaded design, and further parallelized for distributed-memory systems using MPI to overcome high memory overhead barrier and achieve good parallel and data-size scalability.</span></p><p>Address of the bookmark: <a href="http://msaprobs.sourceforge.net/homepage.htm#latest" rel="nofollow">http://msaprobs.sourceforge.net/homepage.htm#latest</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>

</channel>
</rss>