<?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/45306?offset=400</link>
	<atom:link href="https://bioinformaticsonline.com/related/45306?offset=400" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/45240/pg2-making-pangenome-graphs-easier-to-understand</guid>
	<pubDate>Tue, 18 Aug 2026 04:38:23 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/45240/pg2-making-pangenome-graphs-easier-to-understand</link>
	<title><![CDATA[PG2: Making Pangenome Graphs Easier to Understand]]></title>
	<description><![CDATA[<p>Genomics is moving beyond the traditional approach of studying DNA using a single reference genome. Today, researchers are increasingly using pangenomes, which represent genetic information from multiple genomes and capture a much broader range of genetic diversity.</p><p>However, pangenome graphs can be highly complex, making them difficult to visualize and interpret. A recent study published in BMC Bioinformatics introduces PG2 (PanGenoGrapher), an open-source, web-based tool designed to address this challenge.&nbsp;The source code and user guide are openly available on GitHub at https://github.com/iVis-at-Bilkent/pangenographer. A publicly accessible sample deployment is hosted at http://pg2.cs.bilkent.edu.tr. In addition, a demonstration video illustrating the primary use cases of PG2 is available at https://www.youtube.com/watch?v=yCd7-aGY6CQ.</p><p>PG2 combines advanced graph-layout algorithms with an interactive visualization platform. It allows researchers to explore genomic paths, identify variations, and examine relationships between different parts of a pangenome graph more easily.</p><p>This is important because visualization can play a major role in bioinformatics. When complex genomic information is presented clearly, researchers can more easily identify patterns, understand genetic variation, and generate new biological insights.</p><p>The development of PG2 represents a step toward making pangenome analysis more accessible and intuitive. As genomic datasets continue to grow and graph-based representations become more common, tools like PG2 can help researchers navigate this increasing complexity.</p><p>Ultimately, PG2 demonstrates how combining genomics, graph algorithms, and interactive visualization can make sophisticated biological data easier to understand and analyze.</p><p>Reference: Solun, G. K., Dogrusoz, U., Bing&ouml;l, Z., &amp; Alkan, C. (2026). PG2: algorithms and a web-based tool for effective layout and visual analysis of pangenome graphs. BMC Bioinformatics. DOI: 10.1186/s12859-026-06555-4.</p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/45289/the-atlas-of-nine-billion-possibilities</guid>
	<pubDate>Wed, 09 Sep 2026 02:07:58 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/45289/the-atlas-of-nine-billion-possibilities</link>
	<title><![CDATA[The Atlas of Nine Billion Possibilities]]></title>
	<description><![CDATA[<p>Imagine a book that holds all the instructions for building a human, made up of billions of letters. What if you changed just one letter? Maybe nothing would happen. Or that tiny change could affect how a gene works, quietly shaping a cell&rsquo;s biology or even helping cause disease.</p><p>Scientists face a big challenge with the human genome. They can read its letters, but understanding their roles is much harder. Only about 2 percent of the genome codes for proteins. The rest acts like a huge control panel, deciding when and where genes turn on. With about 9 billion possible single-letter changes, testing them all in a lab just isn&rsquo;t possible.</p><p>So, Google DeepMind asked a new question: what if we could predict what those changes might do?</p><p>This question led to the AlphaGenome Atlas (https://deepmind.google.com/science/alphagenome/atlas?), a detailed map of nearly every possible single-letter change in the human genome. Instead of checking each change one by one, researchers can use the Atlas to spot the ones most likely to matter. The AlphaGenome Variant Impact (AVI) score works like a trail marker, pointing scientists toward the changes worth a closer look.</p><p>This is where the Atlas gets especially useful. Much of the genome lies outside the protein-coding regions, where DNA acts as a switch or controller for genes. AlphaGenome lets researchers explore these areas and see how small changes could affect gene activity.</p><p>An atlas isn't the destination; it's a guide.</p><p>The AlphaGenome Atlas doesn&rsquo;t replace experiments or solve every mystery. Instead, it helps scientists decide where to begin. From billions of possibilities, it turns the vast genetic landscape into something researchers can start to explore.</p><p>There are nine billion possibilities, a vast map, and maybe among them therWith nine billion possibilities and a huge map to explore, there may be clues hidden here to some of medicine&rsquo;s toughest mysteries.</p><p>More at&nbsp;https://storage.googleapis.com/deepmind-media/DeepMind.com/Blog/alphagenome-atlas-a-predictive-map-of-every-possible-dna-letter-change-in-the-human-genome/alphagenome-atlas.pdf</p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32851/anges-reconstructing-ancestral-genomes-maps</guid>
	<pubDate>Thu, 18 May 2017 05:27:08 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32851/anges-reconstructing-ancestral-genomes-maps</link>
	<title><![CDATA[ANGES: reconstructing ANcestral GEnomeS maps]]></title>
	<description><![CDATA[<p>This page contains the software ANGES 1.01, that aims at reconstucting ancestral genome maps from homologous markers in extant related genomes.</p>
<h3>Download</h3>
<ul>
<li><a href="http://paleogenomics.irmacs.sfu.ca/ANGES/anges_1.01.tar.gz">Program, version 1.01</a>&nbsp;(July 10, 2012, documentation updated in August 2014)</li>
<li><a href="http://paleogenomics.irmacs.sfu.ca/ANGES/anges_1.01_examples_with_results.tar.gz">Examples with results (featured ancestors: boreoeutherian, amniote, yeasts, Burkholderia, monocots)</a>; please refer to the documentation of the distribution above.</li>
</ul><p>Address of the bookmark: <a href="http://paleogenomics.irmacs.sfu.ca/ANGES/" rel="nofollow">http://paleogenomics.irmacs.sfu.ca/ANGES/</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/36711/ancestral-sequence-reconstruction-steps</guid>
	<pubDate>Fri, 18 May 2018 08:28:26 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/36711/ancestral-sequence-reconstruction-steps</link>
	<title><![CDATA[Ancestral sequence reconstruction steps !]]></title>
	<description><![CDATA[<div><strong>Ancestral sequence reconstruction</strong>&nbsp;(<strong>ASR</strong>) &ndash; also known as&nbsp;<strong>ancestral gene</strong>/<strong>sequence reconstruction</strong>/<strong>resurrection</strong>&nbsp;&ndash; is a technique used in the study of&nbsp;molecular evolution. The method consists of the synthesis of an ancestral&nbsp;gene&nbsp;and expression of the corresponding ancestral&nbsp;protein.&nbsp;<a href="https://en.wikipedia.org/wiki/Ancestral_sequence_reconstruction#cite_note-thornton-1"></a>The idea of protein 'resurrection' was suggested in 1963 by Pauling and Zuckerkandl.<a href="https://en.wikipedia.org/wiki/Ancestral_sequence_reconstruction#cite_note-2"></a>&nbsp;Some early efforts were made in the eighties-nineties, led by the laboratory of&nbsp;Steven A. Benner, showing the potential of this technique &ndash; one that only started to be fulfilled in the post-genomic era.<a href="https://en.wikipedia.org/wiki/Ancestral_sequence_reconstruction#cite_note-3"></a>&nbsp;Thanks to the improvement of algorithms and of better sequencing and synthesis techniques, the method was developed further in the early 2000s to allow the resurrection of a greater variety of and much more ancient genes.<a href="https://en.wikipedia.org/wiki/Ancestral_sequence_reconstruction#cite_note-4"></a>&nbsp;Over the last decade, ancestral protein resurrection has developed as a strategy to reveal the mechanisms and dynamics of protein evolution.&nbsp;</div><div>&nbsp;</div><div>BEAST is the best way to predict the ancestral structure. but, I suggest following steps?</div><div>&nbsp;</div><div>1- Alignments "Mafft -&nbsp;<a href="https://www.researchgate.net/deref/http%3A%2F%2Fmafft.cbrc.jp%2Falignment%2Fsoftware%2Fsource.html" target="_blank">http://mafft.cbrc.jp/alignment/software/source.html</a>"</div><div>mafft --maxiterate 1000 --reorder --thread 24 --genafpair Dataset.fasta &gt; Dataset_Alig.fasta</div><div>&nbsp;</div><div>2- Your dataset has a good phylogenetic signal, is possible to perform with Tree-Puzzle "<a href="https://www.researchgate.net/deref/http%3A%2F%2Fwww.tree-puzzle.de" target="_blank">http://www.tree-puzzle.de</a>";</div><div>&nbsp;</div><div id="yui_3_14_1_1_1526649596608_1443">3 - This dataset which the saturation index, I perform with "<a href="https://www.researchgate.net/deref/http%3A%2F%2Fdambe.bio.uottawa.ca%2Fdambe.asp" target="_blank">http://dambe.bio.uottawa.ca/dambe.asp</a>";</div><div>&nbsp;</div><div>4- Has evidence of possible recombination in your dataset, the evaluate if this presence or absence, because this may to influence the grouping of clades, I perform with</div><div>---recombination</div><div>&nbsp;</div><div>4.1- Phi-test, implemented in SplitTree4"<a href="https://www.researchgate.net/deref/http%3A%2F%2Fwww.splitstree.org" target="_blank">http://www.splitstree.org</a>", (.nex file)</div><div>&nbsp;</div><div>4.2- GARD deployed in webserver in the DataMonkey "<a href="https://www.researchgate.net/deref/http%3A%2F%2Fwww.datamonkey.org%2F" target="_blank">http://www.datamonkey.org/</a>" - turning to the amino acid seaview -&gt; view proteins -&gt; save as ...) Ideally do a tree-based groups.</div><div>&nbsp;</div><div>4.3- RDP4 for download and installation on Windows in "<a href="https://www.researchgate.net/deref/http%3A%2F%2Fweb.cbio.uct.ac.za%2F~darren%2Frdp.html" target="_blank">http://web.cbio.uct.ac.za/~darren/rdp.html</a>"</div><div>&nbsp;</div><div>4.4- Hyphy (Mac, Windows, Linux) in "<a href="https://www.researchgate.net/deref/http%3A%2F%2Fhyphy.org%2Fw%2Findex.php%2FDownload" target="_blank">http://hyphy.org/w/index.php/Download</a>"</div><div>&nbsp;</div><div>4.5- Path-o-Gen (temporal structure of a tree input file -&gt; arquivo.tre)</div><div>These steps above, I call of pre-processing to inferences phylogenetic...</div><div>&nbsp;</div><div>5- Perform phylogenetic tree, used Bayesian Inference with Molecular Clock, but is necessary Clock Testing:</div><div>&nbsp;</div><div>- This step is performed with program Beast (Beauti, Beast and TreeAnnotator), and Tracer_v1.5 more FigTree to inspection.</div><div>&nbsp;</div><div>- Tutorials:&nbsp;<a href="https://www.researchgate.net/deref/http%3A%2F%2Fbeast.bio.ed.ac.uk%2Ftutorials" target="_blank">http://beast.bio.ed.ac.uk/tutorials</a></div><div>- Downloads:&nbsp;<a href="https://www.researchgate.net/deref/http%3A%2F%2Fbeast.bio.ed.ac.uk%2Fdownloads" target="_blank">http://beast.bio.ed.ac.uk/downloads</a></div>]]></description>
	<dc:creator>Surabhi Chaudhary</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/videolist/watch/5380/04-informatics-approach-to-cancer-interview-with-dr-joel-saltz</guid>
	<pubDate>Mon, 07 Oct 2013 14:35:43 -0500</pubDate>
	<link>https://bioinformaticsonline.com/videolist/watch/5380/04-informatics-approach-to-cancer-interview-with-dr-joel-saltz</link>
	<title><![CDATA[04- Informatics Approach to Cancer - Interview with Dr. Joel Saltz]]></title>
	<description><![CDATA[<iframe width="" height="" src="https://www.youtube-nocookie.com/embed/8Kf5EP4LY7k" frameborder="0" allowfullscreen></iframe>For additional information visit http://www.cancerquest.org/joel-saltz-interview.

Dr. Joel Saltz is a Professor in the Departments of Pathology, Biostatistics and Bioinformatics, and Mathematics and Computer Science at
Emory University. Dr. Saltz's research on bioinformatics spans several disciplines.  One project involves applying computer analysis to medical imaging to yield better results for patients.  As an example, a computer program may able to help doctors detect small cancers in a CT scan or mammogram. 

In this interview segment, Dr. Saltz  discusses the informatics approach to cancer.

To learn more about cancer and watch additional interviews, please visit the CancerQuest website at http://www.cancerquest.org.]]></description>
	
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/7568/oldest-hominin-dna-sequenced</guid>
	<pubDate>Fri, 27 Dec 2013 19:58:31 -0600</pubDate>
	<link>https://bioinformaticsonline.com/news/view/7568/oldest-hominin-dna-sequenced</link>
	<title><![CDATA[Oldest Hominin DNA Sequenced]]></title>
	<description><![CDATA[<p>Matthias Meyer and his team from the Max Planck Institute for Evolutionary Anthropology in Leipzig, Germany, have developed new techniques for retrieving and sequencing highly degraded ancient DNA. They then joined forces with Juan-Luis Arsuaga and applied the new techniques to a cave bear from the Sima de los Huesos site. After this success, the researchers sampled two grams of bone powder from a hominin thigh bone from the cave. They extracted its DNA and sequenced the genome of the mitochondria or mtDNA, a small part of the genome that is passed down along the maternal line and occurs in many copies per cell. The researchers then compared this ancient mitochondrial DNA with Neandertals, Denisovans, present-day humans, and apes.<br /><br />From the missing mutations in the old DNA sequences the researchers calculated that the Sima hominin lived about 400,000 years ago. They also found that it shared a common ancestor with the Denisovans, an extinct archaic group from Asia related to the Neandertals, about 700,000 years ago. "The fact that the mtDNA of the Sima de los Huesos hominin shares a common ancestor with Denisovan rather than Neandertal mtDNAs is unexpected since its skeletal remains carry Neandertal-derived features," says Matthias Meyer. Considering their age and Neandertal-like features, the Sima hominins were likely related to the population ancestral to both Neandertals and Denisovans. Another possibility is that gene flow from yet another group of hominins brought the Denisova-like mtDNA into the Sima hominins or their ancestors.<br /><br /></p><p>Reference</p><p>http://www.sciencedaily.com/releases/2013/12/131204132018.htm</p>]]></description>
	<dc:creator>Surajeet</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/12868/landry-lab</guid>
  <pubDate>Thu, 17 Jul 2014 14:33:57 -0500</pubDate>
  <link></link>
  <title><![CDATA[Landry Lab]]></title>
  <description><![CDATA[
<p>EVOLUTIONARY AND INTEGRATIVE CELL BIOLOGY</p>

<p>Our research is at the crossroad between cell biology, ecological genomics, systems biology, molecular evolution and population genetics. We study the architecture and evolution of protein and signalling networks.</p>

<p>More at http://landrylab.ibis.ulaval.ca/</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/13522/yannick-wurm-lab</guid>
  <pubDate>Thu, 07 Aug 2014 18:02:37 -0500</pubDate>
  <link></link>
  <title><![CDATA[Yannick Wurm Lab]]></title>
  <description><![CDATA[
<p>Evolutionary genomics of social insects. Extensive theoretical work has explained how and why complex societies evolve. However, only little is known about the genes and molecular mechanisms responsible for social phenotypes. We have been identifying genes and mechanisms involved in the evolution of insect societies using modern genomics tools (Illumina, RNAseq, RADseq...). For example we recently:</p>

<p>1. sequenced and analyzed the genome of the invasive red fire ant Solenopsis invicta (PNAS 2011)</p>

<p>2. discovered that a fundamental social trait in this species (how many queens are accepted in the colony) is determined by variants of a social chromosome (Nature 2013).</p>

<p>3. described the gene expression changes that occur in a virgin queen when she is given the opportunity of replacing her mother (Mol Ecol 2010).</p>

<p>Homepage: http://yannick.poulet.org/</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/27250/lawley-lab</guid>
  <pubDate>Mon, 09 May 2016 03:29:51 -0500</pubDate>
  <link></link>
  <title><![CDATA[Lawley Lab]]></title>
  <description><![CDATA[
<p>Lawley Lab are covered with a complex microbial community, known as our microbiota, which plays important roles in our physiology, immunity, metabolism and sustenance. Within the human gastrointestinal tract alone there are over 1,000 bacterial species, which amounts to approximately 10 times more cells than we harbor in our entire body and 200 times more genes than are found within our genome. Lawley Lab are really a 'supraorganism' consisting of our 'human' and 'microbial' selves.</p>

<p>More at http://www.sanger.ac.uk/science/groups/lawley-lab</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29683/method-in-comparative-genomics</guid>
	<pubDate>Wed, 09 Nov 2016 16:29:24 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29683/method-in-comparative-genomics</link>
	<title><![CDATA[Method in Comparative genomics !!]]></title>
	<description><![CDATA[<p>We present methods for the automatic determination of genome correspondence. The algorithms enabled the automatic identification of orthologs for more than 90% of genes and intergenic regions across the four species despite the large number of duplicated genes in the yeast genome. The remaining ambiguities in the gene correspondence revealed recent gene family expansions in regions of rapid genomic change.</p>
<p>We present methods for the identification of protein-coding genes based on their patterns of nucleotide conservation across related species. We observed the pressure to conserve the reading frame of functional proteins and developed a test for gene identification with high sensitivity and specificity. We used this test to revisit the genome of S. cerevisiae, reducing the overall gene count by 500 genes (10% of previously annotated genes) and refining the gene structure of hundreds of genes. We present novel methods for the systematic de novo identification of regulatory motifs. The methods do not rely on previous knowledge of gene function and in that way differ from the current literature on computational motif discovery. Based on the genome-wide conservation patterns of known motifs, we developed three conservation criteria that we used to discover novel motifs. We used an enumeration approach to select strongly conserved motif cores, which we extended and collapsed into a small number of candidate regulatory motifs. These include most previously known regulatory motifs as well as several noteworthy novel motifs. The majority of discovered motifs are enriched in functionally related genes, allowing us to infer a candidate function for novel motifs.</p>
<p>Our results demonstrate the power of comparative genomics to further our understanding of any species. Our methods are validated by the extensive experimental knowledge in yeast, and will be invaluable in the study of complex genomes like that of human.</p><p>Address of the bookmark: <a href="http://web.mit.edu/manoli/www/publications/Kellis_JCB_04.pdf" rel="nofollow">http://web.mit.edu/manoli/www/publications/Kellis_JCB_04.pdf</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>