<?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/39250?offset=100</link>
	<atom:link href="https://bioinformaticsonline.com/related/39250?offset=100" 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/blog/view/45251/aurora-a-new-detective-for-bacterial-genomes</guid>
	<pubDate>Fri, 21 Aug 2026 11:31:00 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/45251/aurora-a-new-detective-for-bacterial-genomes</link>
	<title><![CDATA[Aurora: A New Detective for Bacterial Genomes]]></title>
	<description><![CDATA[<p>Imagine trying to solve a mystery with thousands of clues&mdash;but some of the clues are labelled incorrectly.</p><p>That is the challenge researchers face when studying how bacteria adapt to different environments. A bacterial gene may appear to be linked to a particular habitat, when the real reason is simply that closely related bacteria happen to live there.</p><p>In their 2025 Genome Biology paper, Bujdo&scaron;, Walter, and O&rsquo;Toole introduce aurora, a machine-learning tool designed to tackle this problem.</p><p>Aurora identifies potentially mislabeled or unusual bacterial strains before performing genome-wide association studies (GWAS). By cleaning up the dataset and accounting for bacterial evolutionary relationships, it can help researchers find genetic features that are more genuinely connected to habitat adaptation.</p><p>The researchers tested aurora using simulated and real bacterial datasets and found that it could recover important genetic associations even when datasets contained misleading labels.</p><p>The bigger lesson is simple: better biological discoveries often begin with better data.</p><p>Aurora gives researchers a new way to separate real genetic clues from misleading ones&mdash;and could help us better understand how bacteria adapt, survive, and evolve in the environments they call home.</p><p>Based on Bujdo&scaron; et al., &ldquo;aurora: a machine learning GWAS tool for analyzing microbial habitat adaptation,&rdquo; Genome Biology (2025).[Read the original paper](https://link.springer.com/article/10.1186/s13059-025-03524-7?)</p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/45296/luo-lab-symbiosis-genomics-evolution</guid>
  <pubDate>Wed, 09 Sep 2026 03:30:30 -0500</pubDate>
  <link></link>
  <title><![CDATA[Luo Lab | Symbiosis Genomics &amp; Evolution]]></title>
  <description><![CDATA[
<p>We study the evolutionary genomics of marine invertebrates to understand their origins and diversity. Our lab combines high-throughput sequencing and single-cell transcriptomics to explore a wide range of non-model systems. We are particularly interested in how evolutionary novelty arises, with a focus on animal development and photosymbiosis.</p>

<p>Research Directions</p>

<p>Stony corals: evolution of novelty and photosymbiosis</p>

<p>Symbiotic acoels: cell type evolution and photosymbiosis</p>

<p>Animal genomes: structural evolution and gene regulation</p>

<p>https://sgel.biodiv.tw/home</p>
]]></description>
</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/35418/karyoploter-plot-whole-genomes-with-arbitrary-data</guid>
	<pubDate>Fri, 02 Feb 2018 03:24:28 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35418/karyoploter-plot-whole-genomes-with-arbitrary-data</link>
	<title><![CDATA[karyoploteR: plot whole genomes with arbitrary data]]></title>
	<description><![CDATA[<p><span><a href="http://bioconductor.org/packages/karyoploteR">karyoploteR</a></span><span>&nbsp;is an R package to create karyoplots, that is, representations of whole genomes with arbitrary data plotted on them. It is inspired by the R base graphics system and does not depend on other graphics packages. The aim of karyoploteR is to offer the user an easy way to plot data along the genome to get broad genome-wide view to facilitate the identification of genome wide relations and distributions.</span></p><p>Address of the bookmark: <a href="https://bernatgel.github.io/karyoploter_tutorial/" rel="nofollow">https://bernatgel.github.io/karyoploter_tutorial/</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42313/crbhits-from-conditional-reciprocal-best-hits-to-codon-alignments-and-kaks-in-r</guid>
	<pubDate>Wed, 11 Nov 2020 23:06:03 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42313/crbhits-from-conditional-reciprocal-best-hits-to-codon-alignments-and-kaks-in-r</link>
	<title><![CDATA[CRBHits: From Conditional Reciprocal Best Hits to Codon Alignments and Ka/Ks in R]]></title>
	<description><![CDATA[<p>CRBHits is a coding sequence (CDS) analysis pipeline in R (R Core Team, 2019). It reimplements the Conditional Reciprocal Best Hit (CRBH) algorithm crb-blast and covers all necessary steps from sequence similarity searches, codon alignments to Ka/Ks calculations and synteny. The new R package targets ecology, population and evolutionary biologists working in the field of comparative genomics.</p><p>Address of the bookmark: <a href="https://gitlab.gwdg.de/mpievolbio-it/crbhits" rel="nofollow">https://gitlab.gwdg.de/mpievolbio-it/crbhits</a></p>]]></description>
	<dc:creator>Shruti Paniwala</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36758/pbalign-maps-pacbio-reads-to-reference-sequences-and-saves-alignments-to-a-bam-file</guid>
	<pubDate>Thu, 24 May 2018 10:06:52 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36758/pbalign-maps-pacbio-reads-to-reference-sequences-and-saves-alignments-to-a-bam-file</link>
	<title><![CDATA[pbalign: maps PacBio reads to reference sequences and saves alignments to a BAM file]]></title>
	<description><![CDATA[pbalign aligns PacBio reads to reference sequences, filters aligned reads according to user-specific filtering criteria, and converts the output to either the SAM format or PacBio Compare HDF5 (e.g., .cmp.h5) format. The output Compare HDF5 file will be compatible with Quiver if --forQuiver option is specified.<p>Address of the bookmark: <a href="https://github.com/PacificBiosciences/pbalign" rel="nofollow">https://github.com/PacificBiosciences/pbalign</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38389/blast-options-setting-and-defaults</guid>
	<pubDate>Mon, 10 Dec 2018 08:29:37 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38389/blast-options-setting-and-defaults</link>
	<title><![CDATA[BLAST options, setting and defaults]]></title>
	<description><![CDATA[<p>BLAST stands for Basic Local Alignment Search Tool and was developed by Altschul et al. (1990) and significantly improved by&nbsp;<a href="http://www3.oup.co.uk/nar/Volume_25/Issue_17/freepdf/">Altschul et al. (1997).</a>&nbsp;It is a very fast search algorithm that is used to separately search protein or DNA databases. BLAST is best used for sequence similarity searching, rather than for motif searching. For searches using a query sequence of fewer than twenty residues,&nbsp;<a href="https://www.arabidopsis.org/servlets/tools/patmatch/">PatMatch</a>&nbsp;is the best choice. Another sequence alignment tool that may yield different results from BLAST, and may be useful for motif searching, is&nbsp;<a href="https://www.arabidopsis.org/cgi-bin/fasta/TAIRfasta.pl">FASTA</a>. To search nonplant datasets, try&nbsp;<a href="http://seqsim.ncgr.org/newBlast.html">NCGR BLAST</a>&nbsp;or&nbsp;<a href="http://www.ncbi.nlm.nih.gov/blast/blast.cgi?Jform=0">NCBI BLAST</a>.</p>
<p>A fairly complete on-line guide to BLAST searching can be found at the&nbsp;<a href="http://www.ncbi.nlm.nih.gov/BLAST/blast_help.html">NCBI BLAST Help Manual</a>. For a theoretical overview of BLAST, see the&nbsp;<a href="http://www.ncbi.nlm.nih.gov/BLAST/tutorial/Altschul-1.html">NCBI BLAST Course</a>. Additional information can be found in the&nbsp;<a href="https://www.arabidopsis.org/blast/aboutblast2.htm">BLAST 2.0 Release Notes</a></p>
<table border="1">
<tbody>
<tr><th>&nbsp;</th><th><a href="https://www.arabidopsis.org/Blast/BLAST_help.jsp#methods">BLASTN</a></th><th><a href="https://www.arabidopsis.org/Blast/BLAST_help.jsp#methods">BLASTP</a></th><th><a href="https://www.arabidopsis.org/Blast/BLAST_help.jsp#methods">BLASTX</a></th><th><a href="https://www.arabidopsis.org/Blast/BLAST_help.jsp#methods">TBLASTN</a></th><th><a href="https://www.arabidopsis.org/Blast/BLAST_help.jsp#methods">TBLASTX</a></th><th><a href="https://www.arabidopsis.org/Blast/BLAST_help.jsp#methods">PSIBLAST</a></th></tr>
<tr>
<td><a name="open" id="open"></a><a href="https://www.arabidopsis.org/Blast/BLAST_help.jsp#open"><strong>Gap opening penalty</strong></a>:<br>cost to open a gap [integer]</td>
<td align="center">default = 5</td>
<td align="center">default = 11<br>limited&nbsp;values&nbsp;are supported</td>
<td align="center">default = 11<br>limited&nbsp;values&nbsp;are supported</td>
<td align="center">default = 11<br>limited&nbsp;values&nbsp;are supported</td>
<td align="center">default = 11<br>limited&nbsp;values&nbsp;are supported</td>
<td align="center">default = 5</td>
</tr>
<tr>
<td><a name="extend" id="extend"></a><a href="https://www.arabidopsis.org/Blast/BLAST_help.jsp#extend"><strong>Gap extension penalty</strong></a>:<br>cost to extend a gap [integer]</td>
<td align="center">default = 2</td>
<td align="center">default = 1<br>a 0 in this field means to use the default</td>
<td align="center">default = 1<br>a 0 in this field means to use the default</td>
<td align="center">default = 1<br>a 0 in this field means to use the default</td>
<td align="center">default = 1<br>a 0 in this field means to use the default</td>
<td align="center">default = 2</td>
</tr>
<tr>
<td><a name="match" id="match"></a><a href="https://www.arabidopsis.org/Blast/BLAST_help.jsp#match"><strong>Nucleic match</strong></a>:<br>reward for a match in the BLAST portion of run [integer]</td>
<td align="center">default = 1</td>
<td align="center">n/a</td>
<td align="center">n/a</td>
<td align="center">n/a</td>
<td align="center">n/a</td>
<td align="center">default = 1</td>
</tr>
<tr>
<td><a name="mismatch" id="mismatch"></a><a href="https://www.arabidopsis.org/Blast/BLAST_help.jsp#mismatch"><strong>Nucleic mismatch</strong></a>:<br>penalty for a mismatch in the blast portion of run [integer]</td>
<td align="center">default = -3</td>
<td align="center">n/a</td>
<td align="center">n/a</td>
<td align="center">n/a</td>
<td align="center">n/a</td>
<td align="center">default = -3</td>
</tr>
<tr>
<td><strong><a name="expect" id="expect"></a><a href="https://www.arabidopsis.org/Blast/BLAST_help.jsp#expect">Expectation value</a></strong>:<br>(E) [real]</td>
<td align="center">default = 10.0</td>
<td align="center">default = 10.0</td>
<td align="center">default = 10.0</td>
<td align="center">default = 10.0</td>
<td align="center">default = 10.0</td>
<td align="center">default = 10.0</td>
</tr>
<tr>
<td><a name="word" id="word"></a><a href="https://www.arabidopsis.org/Blast/BLAST_help.jsp#word"><strong>Word size</strong></a>:<br>the size of the initial word that must be matched between the database and the query sequence</td>
<td align="center">default = 11</td>
<td align="center">default = 3</td>
<td align="center">default = 3</td>
<td align="center">default = 3</td>
<td align="center">default = 3</td>
<td align="center">default = 11</td>
</tr>
<tr>
<td><a name="descriptions" id="descriptions"></a><a href="https://www.arabidopsis.org/Blast/BLAST_help.jsp#descriptions"><strong>Max scores</strong></a>:<br>Number of one-line descriptions (V) [Integer]</td>
<td align="center">default = 25</td>
<td align="center">default = 25</td>
<td align="center">default = 25</td>
<td align="center">default = 25</td>
<td align="center">default = 25</td>
<td align="center">default = 25</td>
</tr>
<tr>
<td><strong><a name="alignments" id="alignments"></a><a href="https://www.arabidopsis.org/Blast/BLAST_help.jsp#alignments">Max alignments</a></strong>:<br>number of alignments to show (B) [integer]</td>
<td align="center">default = 15</td>
<td align="center">default = 15</td>
<td align="center">default = 15</td>
<td align="center">default = 15</td>
<td align="center">default = 15</td>
<td align="center">default = 15</td>
</tr>
<tr>
<td><strong>Query filter</strong>:<br>filter applied to the query sequence</td>
<td align="center">default = DUST</td>
<td align="center">default = SEG</td>
<td align="center">default = SEG</td>
<td align="center">default = SEG</td>
<td align="center">default = SEG</td>
<td align="center">default = DUST</td>
</tr>
<tr>
<td><strong><a name="gencodes" id="gencodes"></a><a href="https://www.arabidopsis.org/Blast/BLAST_help.jsp#gencodes">Query genetic code</a></strong>:<br>genetic code to be used in BLASTX translation of the query</td>
<td align="center">n/a</td>
<td align="center">n/a</td>
<td align="center">default = universal</td>
<td align="center">default = universal</td>
<td align="center">default = universal</td>
<td align="center">n/a</td>
</tr>
<tr>
<td><strong><a name="matrix" id="matrix"></a><a href="http://twod.med.harvard.edu/seqanal/matrices.html">Matrix</a></strong>:<br>substitution matrix to be used for amino acid comparisons</td>
<td align="center">no default</td>
<td align="center">default = blosum62</td>
<td align="center">default = blosum62</td>
<td align="center">default = blosum62</td>
<td align="center">default = blosum62</td>
<td align="center">no default</td>
</tr>
</tbody>
</table>
<p>Supported and Suggested&nbsp;Values&nbsp;for Gap Open and Extension in BLASTP, BLASTX, TBLASTN, and TBLASTX</p>
<table border="1">
<tbody>
<tr><th>Gaps Open</th><th>Gap Extension</th></tr>
<tr>
<td align="center">10</td>
<td align="center">1</td>
</tr>
<tr>
<td align="center">10</td>
<td align="center">2</td>
</tr>
<tr>
<td align="center">11</td>
<td align="center">1</td>
</tr>
<tr>
<td align="center">8</td>
<td align="center">2</td>
</tr>
<tr>
<td align="center">9</td>
<td align="center">2</td>
</tr>
</tbody>
</table><p>Address of the bookmark: <a href="https://www.arabidopsis.org/Blast/BLASToptions.jsp" rel="nofollow">https://www.arabidopsis.org/Blast/BLASToptions.jsp</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44904/termal-a-fast-and-interactive-terminal-based-viewer-for-multiple-sequence-alignments</guid>
	<pubDate>Mon, 22 Sep 2025 23:51:02 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44904/termal-a-fast-and-interactive-terminal-based-viewer-for-multiple-sequence-alignments</link>
	<title><![CDATA[Termal: a fast and interactive terminal-based viewer for multiple sequence alignments]]></title>
	<description><![CDATA[<p>termal, a fast, interactive, terminal-based viewer for multiple sequence alignments (MSAs), designed for use on remote systems such as high-performance computing (HPC) clusters.</p>
<p>https://academic.oup.com/bioinformaticsadvances/advance-article/doi/10.1093/bioadv/vbaf208/8257678?login=true</p><p>Address of the bookmark: <a href="https://github.com/sib-swiss/termal" rel="nofollow">https://github.com/sib-swiss/termal</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/33960/mgra-breakpoint-graphs-and-ancestral-genome-reconstructions</guid>
	<pubDate>Tue, 25 Jul 2017 08:48:25 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/33960/mgra-breakpoint-graphs-and-ancestral-genome-reconstructions</link>
	<title><![CDATA[MGRA: Breakpoint graphs and ancestral genome reconstructions]]></title>
	<description><![CDATA[<p>MGRA (Multiple Genome Rearrangements and Ancestors) is a tool for reconstruction of ancestor genomes and evolutionary history of extant genomes.</p>
<p>It takes as an input a set of genomes represented as sequences of genes (or synteny blocks) and produces such sequences for ancestral genomes at the internal nodes of the phylogenetic tree.</p>
<p>The phylogenetic tree may be also specified completely or partially, in the latter case MGRA can reconstruct conserved ancestral regions (CARs) of the ancestral genome of interest.</p>
<p>Since version 2 MGRA supports gene insertion and deletions in addition to genome rearrangements and allows the input genomes to have different gene content.</p>
<p>It also can reconstruct most plausible phylogenetic tree based on the rearrangement characters.</p><p>Address of the bookmark: <a href="http://mgra.cblab.org/" rel="nofollow">http://mgra.cblab.org/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>