<?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/42923?offset=150</link>
	<atom:link href="https://bioinformaticsonline.com/related/42923?offset=150" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40834/nucleus-python-and-c-code-for-reading-and-writing-genomics-data</guid>
	<pubDate>Sun, 02 Feb 2020 08:14:19 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40834/nucleus-python-and-c-code-for-reading-and-writing-genomics-data</link>
	<title><![CDATA[Nucleus: Python and C++ code for reading and writing genomics data.]]></title>
	<description><![CDATA[<p>Nucleus is a library of Python and C++ code designed to make it easy to read, write and analyze data in common genomics file formats like SAM and VCF. In addition, Nucleus enables painless integration with the TensorFlow machine learning framework, as anywhere a genomics file is consumed or produced, a TensorFlow tfrecords file may be used instead.</p><p>Address of the bookmark: <a href="https://github.com/google/nucleus" rel="nofollow">https://github.com/google/nucleus</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/44633/learn-python-with-example</guid>
	<pubDate>Tue, 06 Aug 2024 23:51:51 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/44633/learn-python-with-example</link>
	<title><![CDATA[Learn python with example]]></title>
	<description><![CDATA[<div><div><div><p>There are over 21 unique&nbsp;Python project&nbsp;walkthroughs in this content that range from beginner to advanced. See below for the timestamps for these projects:</p><p><span>00:00:00 | How To Navigate These Projects</span><br /><span>---</span><br /><span>00:01:46 | #1 - Quiz Game (Easy)</span><br /><span>Code:&nbsp;</span><a href="https://morioh.com/redirect?id=65b0752318cf2dc4d28010e1&amp;own=5ff684ea1a53c42123416f96&amp;l=https%3A%2F%2Fgithub.com%2Ftechwithtim%2F5-Python-Projects-For-Beginners%2Fblob%2Fmain%2Fquiz_game.py" target="_blank">https://github.com/techwithtim/5-Python-Projects-For-Beginners/blob/main/quiz_game.py</a><span>&nbsp;</span><br /><span>---</span><br /><span>00:22:00 | #2 - Number Guessing Game (Easy)</span><br /><span>Code:&nbsp;</span><a href="https://morioh.com/redirect?id=65b0752318cf2dc4d28010e1&amp;own=5ff684ea1a53c42123416f96&amp;l=https%3A%2F%2Fgithub.com%2Ftechwithtim%2F5-Python-Projects-For-Beginners%2Fblob%2Fmain%2Fnumber_guesser.py" target="_blank">https://github.com/techwithtim/5-Python-Projects-For-Beginners/blob/main/number_guesser.py</a><span>&nbsp;</span><br /><span>---</span><br /><span>00:39:49 | #3 - Rock, Paper, Scissors (Easy)</span><br /><span>Code:&nbsp;</span><a href="https://morioh.com/redirect?id=65b0752318cf2dc4d28010e1&amp;own=5ff684ea1a53c42123416f96&amp;l=https%3A%2F%2Fgithub.com%2Ftechwithtim%2F5-Python-Projects-For-Beginners%2Fblob%2Fmain%2Frock_paper_scissors.py" target="_blank">https://github.com/techwithtim/5-Python-Projects-For-Beginners/blob/main/rock_paper_scissors.py</a><span>&nbsp;</span><br /><span>---</span><br /><span>00:54:40 | #4 - Choose Your Own Adventure Game (Easy)</span><br /><span>Code:&nbsp;</span><a href="https://morioh.com/redirect?id=65b0752318cf2dc4d28010e1&amp;own=5ff684ea1a53c42123416f96&amp;l=https%3A%2F%2Fgithub.com%2Ftechwithtim%2F5-Python-Projects-For-Beginners%2Fblob%2Fmain%2Fchoose_your_own_adventure.py" target="_blank">https://github.com/techwithtim/5-Python-Projects-For-Beginners/blob/main/choose_your_own_adventure.py</a><span>&nbsp;</span><br /><span>---</span><br /><span>01:06:47 | #5 - Password Manager (Medium)</span><br /><span>Code:&nbsp;</span><a href="https://morioh.com/redirect?id=65b0752318cf2dc4d28010e1&amp;own=5ff684ea1a53c42123416f96&amp;l=https%3A%2F%2Fgithub.com%2Ftechwithtim%2F5-Python-Projects-For-Beginners%2F" target="_blank">https://github.com/techwithtim/5-Python-Projects-For-Beginners/</a><span>&nbsp;</span><br /><span>Fernet Cryptography Documentation:&nbsp;</span><a href="https://morioh.com/redirect?id=65b0752318cf2dc4d28010e1&amp;own=5ff684ea1a53c42123416f96&amp;l=https%3A%2F%2Fcryptography.io%2Fen%2Flatest%2Ffernet%2F" target="_blank">https://cryptography.io/en/latest/fernet/</a><span>&nbsp;</span><br /><span>---</span><br /><span>01:37:37 | #6 - PIG (Medium)</span><br /><span>Code:&nbsp;</span><a href="https://morioh.com/redirect?id=65b0752318cf2dc4d28010e1&amp;own=5ff684ea1a53c42123416f96&amp;l=https%3A%2F%2Fgithub.com%2Ftechwithtim%2F3-Mini-Python-Projects%2Fblob%2Fmain%2Fproject1.py" target="_blank">https://github.com/techwithtim/3-Mini-Python-Projects/blob/main/project1.py</a><span>&nbsp;</span><br /><span>---</span><br /><span>01:59:07 | #7 - Madlibs Generator (Medium)</span><br /><span>Code:&nbsp;</span><a href="https://morioh.com/redirect?id=65b0752318cf2dc4d28010e1&amp;own=5ff684ea1a53c42123416f96&amp;l=https%3A%2F%2Fgithub.com%2Ftechwithtim%2F3-Mini-Python-Projects%2Fblob%2Fmain%2Fproject2.py" target="_blank">https://github.com/techwithtim/3-Mini-Python-Projects/blob/main/project2.py</a><span>&nbsp;</span><br /><span>---</span><br /><span>02:15:04 | #8 - Timed Math Challenge (Medium)</span><br /><span>Code:&nbsp;</span><a href="https://morioh.com/redirect?id=65b0752318cf2dc4d28010e1&amp;own=5ff684ea1a53c42123416f96&amp;l=https%3A%2F%2Fgithub.com%2Ftechwithtim%2F3-Mini-Python-Projects%2Fblob%2Fmain%2Fproject3.py" target="_blank">https://github.com/techwithtim/3-Mini-Python-Projects/blob/main/project3.py</a><span>&nbsp;</span><br /><span>---</span><br /><span>02:28:02 | #9 - Slot Machine (Medium)</span><br /><span>Code:&nbsp;</span><a href="https://morioh.com/redirect?id=65b0752318cf2dc4d28010e1&amp;own=5ff684ea1a53c42123416f96&amp;l=https%3A%2F%2Fgithub.com%2Ftechwithtim%2FPython-Slot-Machine" target="_blank">https://github.com/techwithtim/Python-Slot-Machine</a><span>&nbsp;</span><br /><span>---</span><br /><span>03:20:43 | #10 - Turtle Racing (Medium)</span><br /><span>Code:&nbsp;</span><a href="https://morioh.com/redirect?id=65b0752318cf2dc4d28010e1&amp;own=5ff684ea1a53c42123416f96&amp;l=https%3A%2F%2Fgithub.com%2Ftechwithtim%2FTurtle-Racing-V2" target="_blank">https://github.com/techwithtim/Turtle-Racing-V2</a><span>&nbsp;</span><br /><span>Turtle Docs:&nbsp;</span><a href="https://morioh.com/redirect?id=65b0752318cf2dc4d28010e1&amp;own=5ff684ea1a53c42123416f96&amp;l=https%3A%2F%2Fdocs.python.org%2F3%2Flibrary%2Fturtle.html" target="_blank">https://docs.python.org/3/library/turtle.html</a><span>&nbsp;</span><br /><span>---</span><br /><span>04:13:09 | #11 - WPM Typing Test (Medium)</span><br /><span>Code:&nbsp;</span><a href="https://morioh.com/redirect?id=65b0752318cf2dc4d28010e1&amp;own=5ff684ea1a53c42123416f96&amp;l=https%3A%2F%2Fgithub.com%2Ftechwithtim%2FWPM_Typing_Test" target="_blank">https://github.com/techwithtim/WPM_Typing_Test</a><span>&nbsp;</span><br /><span>Curses Docs:&nbsp;</span><a href="https://morioh.com/redirect?id=65b0752318cf2dc4d28010e1&amp;own=5ff684ea1a53c42123416f96&amp;l=https%3A%2F%2Fdocs.python.org%2F3%2Fhowto%2Fcurses.html" target="_blank">https://docs.python.org/3/howto/curses.html</a><span>&nbsp;</span><br /><span>05:09:43 | #12 - Alarm Clock (Easy)</span><br /><span>Python Project Idea Blog:&nbsp;</span><a href="https://morioh.com/redirect?id=65b0752318cf2dc4d28010e1&amp;own=5ff684ea1a53c42123416f96&amp;l=https%3A%2F%2Fhackr.io%2Fblog%2Fpython-projects" target="_blank">https://hackr.io/blog/python-projects</a><span>&nbsp;</span><br /><span>Sound Effects:&nbsp;</span><a href="https://morioh.com/redirect?id=65b0752318cf2dc4d28010e1&amp;own=5ff684ea1a53c42123416f96&amp;l=https%3A%2F%2Fwww.fesliyanstudios.com%2Froyalty-free-sound-effects-download%2Falarm-203" target="_blank">https://www.fesliyanstudios.com/royalty-free-sound-effects-download/alarm-203</a><span>&nbsp;</span><br /><span>---</span><br /><span>05:22:07 | #13 - Password Generator (Easy)</span><br /><span>Python Project Idea Blog:&nbsp;</span><a href="https://morioh.com/redirect?id=65b0752318cf2dc4d28010e1&amp;own=5ff684ea1a53c42123416f96&amp;l=https%3A%2F%2Fhackr.io%2Fblog%2Fpython-projects" target="_blank">https://hackr.io/blog/python-projects</a><span>&nbsp;</span><br /><span>---</span><br /><span>05:39:16 | #14 - Shortest Path Finder (Advanced)</span><br /><span>Code:&nbsp;</span><a href="https://morioh.com/redirect?id=65b0752318cf2dc4d28010e1&amp;own=5ff684ea1a53c42123416f96&amp;l=https%3A%2F%2Fgithub.com%2Ftechwithtim%2F3-Mini-Python-Projects-For-Intermediates%2Fblob%2Fmain%2Fpath-finder.py" target="_blank">https://github.com/techwithtim/3-Mini-Python-Projects-For-Intermediates/blob/main/path-finder.py</a><span>&nbsp;</span><br /><span>---</span><br /><span>06:14:53 | #15 - NBA Stats &amp; Current Scores (Medium)</span><br /><span>Code:&nbsp;</span><a href="https://morioh.com/redirect?id=65b0752318cf2dc4d28010e1&amp;own=5ff684ea1a53c42123416f96&amp;l=https%3A%2F%2Fgithub.com%2Ftechwithtim%2F3-Mini-Python-Projects-For-Intermediates%2Fblob%2Fmain%2Fnba-scores.py" target="_blank">https://github.com/techwithtim/3-Mini-Python-Projects-For-Intermediates/blob/main/nba-scores.py</a><span>&nbsp;</span><br /><span>---</span><br /><span>06:38:22 | #16 - Currency Converter (Medium)</span><br /><span>Code:&nbsp;</span><a href="https://morioh.com/redirect?id=65b0752318cf2dc4d28010e1&amp;own=5ff684ea1a53c42123416f96&amp;l=https%3A%2F%2Fgithub.com%2Ftechwithtim%2F3-Mini-Python-Projects-For-Intermediates%2Fblob%2Fmain%2Fcurrency-converter.py" target="_blank">https://github.com/techwithtim/3-Mini-Python-Projects-For-Intermediates/blob/main/currency-converter.py</a><span>&nbsp;</span><br /><span>API: https://free.currencyconverterapi.com/</span><br /><span>---</span><br /><span>06:58:51 | #17 - YouTube Video Downloader (Medium)</span><br /><span>Code: &nbsp;</span><a href="https://morioh.com/redirect?id=65b0752318cf2dc4d28010e1&amp;own=5ff684ea1a53c42123416f96&amp;l=https%3A%2F%2Fgithub.com%2Ftechwithtim%2FPython-Beginner-Automation-Projects%2Fblob%2Fmain%2Fyoutube.py" target="_blank">https://github.com/techwithtim/Python-Beginner-Automation-Projects/blob/main/youtube.py</a><span>&nbsp;</span><br /><span>---</span><br /><span>07:09:50 | #18 - Automated File Backup (Medium)</span><br /><span>Code:&nbsp;</span><a href="https://morioh.com/redirect?id=65b0752318cf2dc4d28010e1&amp;own=5ff684ea1a53c42123416f96&amp;l=https%3A%2F%2Fgithub.com%2Ftechwithtim%2FPython-Beginner-Automation-Projects%2Fblob%2Fmain%2Fbackup.py" target="_blank">https://github.com/techwithtim/Python-Beginner-Automation-Projects/blob/main/backup.py</a><span>&nbsp;</span><br /><span>---</span><br /><span>07:21:18 | #19 - Mastermind/4 Color Match (Advanced)</span><br /><span>---</span><br /><span>07:48:20 | #20 - Aim Trainer (Advanced)</span><br /><span>Code:&nbsp;</span><a href="https://morioh.com/redirect?id=65b0752318cf2dc4d28010e1&amp;own=5ff684ea1a53c42123416f96&amp;l=https%3A%2F%2Fgithub.com%2Ftechwithtim%2FPython-Aim-Trainer" target="_blank">https://github.com/techwithtim/Python-Aim-Trainer</a><span>&nbsp;</span><br /><span>---</span><br /><span>08:39:20 | #21 - Advanced Python Scripting (Advanced)</span><br /><span>Code:&nbsp;</span><a href="https://morioh.com/redirect?id=65b0752318cf2dc4d28010e1&amp;own=5ff684ea1a53c42123416f96&amp;l=https%3A%2F%2Fgithub.com%2Ftechwithtim%2FPython-Scripting-Project" target="_blank">https://github.com/techwithtim/Python-Scripting-Project</a><span>&nbsp;</span></p></div></div></div>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39441/snakepipes-a-toolkit-based-on-snakemake-and-python-for-analysis-of-ngs-data</guid>
	<pubDate>Thu, 30 May 2019 04:06:13 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39441/snakepipes-a-toolkit-based-on-snakemake-and-python-for-analysis-of-ngs-data</link>
	<title><![CDATA[snakepipes: A toolkit based on snakemake and python for analysis of NGS data]]></title>
	<description><![CDATA[<p><span><span>snakePipes are flexible and powerful workflows built using&nbsp;</span><a href="https://github.com/maxplanck-ie/snakepipes/blob/master/snakemake.readthedocs.io">snakemake</a><span>&nbsp;that simplify the analysis of NGS data.</span></span></p>
<ul>
<li>DNA-mapping*</li>
<li>ChIP-seq*</li>
<li>RNA-seq*</li>
<li>ATAC-seq*</li>
<li>scRNA-seq</li>
<li>Hi-C</li>
<li>Whole Genome Bisulfite Seq/WGBS</li>
</ul>
<p><span>(*Also available in "allele-specific" mode)</span></p>
<p><span>snakePipes can be installed via conda : </span></p>
<p><span>'conda install -c mpi-ie -c bioconda -c conda-forge snakePipes'. </span></p>
<p><span>Source code (</span><a href="https://github.com/maxplanck-ie/snakepipes" target="">https://github.com/maxplanck-ie/snakepipes</a><span>) and documentation (</span><a href="https://snakepipes.readthedocs.io/en/latest/" target="">https://snakepipes.readthedocs.io/en/latest/</a><span>) are available online.</span></p><p>Address of the bookmark: <a href="https://github.com/maxplanck-ie/snakepipes" rel="nofollow">https://github.com/maxplanck-ie/snakepipes</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44179/python-mini-projects</guid>
	<pubDate>Mon, 16 Jan 2023 02:14:03 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44179/python-mini-projects</link>
	<title><![CDATA[Python Mini Projects !]]></title>
	<description><![CDATA[<p><span>There is a directory for each chapter of the book. Each directory contains a&nbsp;</span><code>test.py</code><span>&nbsp;program you can use with&nbsp;</span><code>pytest</code><span>&nbsp;to check that you have written the program correctly. I have included a short README to describe each exercise. If you have problems writing code (or if you would like to support this project!), the book contains details about the skills you need.</span></p>
<p>https://github.com/kyclark/tiny_python_projects</p><p>Address of the bookmark: <a href="https://github.com/kyclark/tiny_python_projects" rel="nofollow">https://github.com/kyclark/tiny_python_projects</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35294/httdb-horizontally-transferred-transposable-elements-database</guid>
	<pubDate>Tue, 23 Jan 2018 12:07:31 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35294/httdb-horizontally-transferred-transposable-elements-database</link>
	<title><![CDATA[HTTDB - Horizontally transferred transposable elements database]]></title>
	<description><![CDATA[<p><span>Transposons or Transposable elements (TEs) are "mobile genes" capable of mobilization from one genomic location to another through non-homologous recombination. As this movement is mediated by its own proteins and does not contribute to the survival of the host that it inhabits, they are known as selfish genomic parasites. Despite their capacity for transposition inside genomes, they can frequently transpose the species boundaries and consequently migrate from one species to another. Such phenomenon is called Horizontal Transposons Transfer. HTT was first discovered by Daniels et al. (1984) when analysing a&nbsp;</span><em>P</em><span>&nbsp;element that was transferred from&nbsp;</span><em>Drosophila willistoni</em><span>&nbsp;to&nbsp;</span><em>D. melanogaster</em><span>. Since then, many more cases have been documented in the literature. Moreover, in the last years, such discoveries have been boosted by the unprecedented amount of new genomes available. Despite the recognition of HTT as a common phenomenon in recent years, it is still difficult to draw major conclusions about HTT patterns, such as where in the tree of life these cases are more frequently found. This is mainly due to the historical bias and lack of studies in many taxa. To date, there has been no easy way to visualise each TE or host species, and should be further analysed in order to provide a more comprehensive view of such phenomena. Based on these concerns, we developed the HTT database to keep an updated repository of HTT events in all eukaryotes, allowing not only TE specialists to add new events and search the database, but also non-specialists. Moreover, we expanded the database to include Horizontal-Virus Transfer also known as endogenization events which is characterized by the stable integration a viral genomic fragment into the host genome.</span></p>
<p><span>https://www.ncbi.nlm.nih.gov/pubmed/29315358</span></p><p>Address of the bookmark: <a href="http://lpa.saogabriel.unipampa.edu.br:8080/httdatabase/" rel="nofollow">http://lpa.saogabriel.unipampa.edu.br:8080/httdatabase/</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/45276/the-hidden-pages-of-our-dna</guid>
	<pubDate>Sat, 05 Sep 2026 01:04:22 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/45276/the-hidden-pages-of-our-dna</link>
	<title><![CDATA[The Hidden Pages of Our DNA]]></title>
	<description><![CDATA[<p>Imagine opening the instruction manual for life.</p><p>It is enormous, billions of letters long. Some of those letters are easy to understand because they contain instructions for building proteins, the tiny machines that keep our cells alive.</p><p>But what if some of the most important instructions aren't in those obvious chapters?</p><p>Scientists have long suspected that the mysterious stretches of DNA between protein-coding genes may contain some of life's most interesting secrets. These regions can act like switches, telling genes when, where, and how strongly to turn on. Among them are conserved non-coding elements, or CNEs DNA sequences that have remained remarkably similar across different species.</p><p>Think of a CNE as a sentence that nature has copied into several editions of the same book.</p><p>A mouse has it.</p><p>A bird has it.</p><p>A human has it.</p><p>And despite millions of years of evolution, much of the sentence remains almost unchanged.</p><p>That conservation is a clue: this piece of DNA probably matters.</p><p>But there was a problem. Finding these hidden sentences across enormous genomes is difficult. Researchers needed to compare many genomes, identify conserved regions, and then determine which of those regions might have evolved unusually quickly in particular branches of the evolutionary tree.</p><p>Enter CNEwrap.&nbsp;https://github.com/YanCCscu/CNEwrap</p><p>The researchers developed CNEwrap as a streamlined toolkit capable of handling large-scale genome comparisons, conserved-element detection, and evolutionary analysis. Inside it is a new algorithm called EvoAcc, designed to identify CNEs that show accelerated evolution in specific species or lineages.</p><p>Why does that matter?</p><p>Because evolution isn't just about what stays the same.</p><p>Sometimes, the most interesting story is hidden in what changed.</p><p>Imagine that nearly every species carries the same regulatory sentence, but one lineage suddenly has several unusual edits. Perhaps those changes helped shape a new body structure, a different adaptation, or another distinctive trait.</p><p>EvoAcc is designed to help researchers find these evolutionary clues. In the study's tests, it performed particularly well in scenarios involving two or three accelerated lineages and showed improved sensitivity to insertion and deletion mutations compared with several existing approaches.</p><p>The researchers also tested CNEwrap using functional genomic regions from mammals and found that EvoAcc could recover human-specific accelerated regions while identifying some signals that other methods missed.</p><p>So the story of CNEwrap is really a story about looking beyond the obvious.</p><p>For decades, scientists have often focused on the DNA that directly encodes proteins. But the genome is more like a vast library: the protein-coding genes are the main text, while non-coding regions may contain punctuation, instructions, switches, annotations, and editing notes that tell the cell how to read the book.</p><p>CNEwrap gives researchers a new way to search that hidden material.</p><p>And perhaps somewhere inside those billions of DNA letters is an evolutionary story we haven't read yet.</p><p>The exciting part is that we now have better tools to find it.</p><p>Read more about it&nbsp;https://academic.oup.com/nar/article/54/14/gkag709/8738333?</p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38055/ancestral-genomes-a-resource-for-reconstructed-ancestral-genes-and-genomes-across-the-tree-of-life</guid>
	<pubDate>Fri, 02 Nov 2018 08:16:27 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38055/ancestral-genomes-a-resource-for-reconstructed-ancestral-genes-and-genomes-across-the-tree-of-life</link>
	<title><![CDATA[Ancestral Genomes: a resource for reconstructed ancestral genes and genomes across the tree of life]]></title>
	<description><![CDATA[<p><span>&nbsp;Ancestral Genomes (</span><a href="http://ancestralgenomes.org/" target="">http://ancestralgenomes.org</a><span>) is a resource for comprehensive reconstructions of these &lsquo;fossil genomes&rsquo;. Comprehensive sets of protein-coding genes have been reconstructed for 78 genomes of now-extinct species that were the common ancestors of extant species from across the tree of life.&nbsp;</span></p><p>Address of the bookmark: <a href="http://ancestralgenomes.org/" rel="nofollow">http://ancestralgenomes.org/</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42042/cluego-a-cytoscape-plug-in-that-visualizes-the-non-redundant-biological-terms-for-large-clusters-of-genes</guid>
	<pubDate>Thu, 13 Aug 2020 10:24:29 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42042/cluego-a-cytoscape-plug-in-that-visualizes-the-non-redundant-biological-terms-for-large-clusters-of-genes</link>
	<title><![CDATA[ClueGO: a Cytoscape plug-in that visualizes the non-redundant biological terms for large clusters of genes]]></title>
	<description><![CDATA[<p>ClueGO is a Cytoscape plug-in that visualizes the non-redundant biological terms for large clusters of genes in a functionally grouped network and it can be used in combination with GOlorize. The identifiers can be uploaded from a text file or interactively from a network of Cytoscape. The type of identifiers supported can be easely extended by the user. ClueGO performs single cluster analysis and comparison of clusters. From the ontology sources used, the terms are selected by different filter criteria. The related terms which share similar associated genes can be fused to reduce redundancy. The ClueGO network is created with kappa statistics and reflects the relationships between the terms based on the similarity of their associated genes. On the network, the node colour can be switched between functional groups and clusters distribution. ClueGO charts are underlying the specificity and the common aspects of the biological role. The significance of the terms and groups is automatically calculated. ClueGO is easy updatable with the newest files from Gene Ontology and KEGG.</p><p>Address of the bookmark: <a href="http://www.ici.upmc.fr/cluego/" rel="nofollow">http://www.ici.upmc.fr/cluego/</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/26827/kamaleshwar-singh-lab</guid>
  <pubDate>Fri, 25 Mar 2016 10:46:49 -0500</pubDate>
  <link></link>
  <title><![CDATA[Kamaleshwar Singh Lab]]></title>
  <description><![CDATA[
<p>The focus of Dr. Singh’s research and teaching is on the molecular mechanistic basis for environmental carcinogen-induced genetic (DNA damage) and epigenetic changes, and susceptibility to human cancer development</p>

<p>More at http://www.tiehh.ttu.edu/dr.-kamaleshwar-singh.html</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31024/dagchainer-computing-chains-of-syntenic-genes-in-complete-genomes</guid>
	<pubDate>Fri, 17 Feb 2017 16:13:35 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31024/dagchainer-computing-chains-of-syntenic-genes-in-complete-genomes</link>
	<title><![CDATA[DAGchainer: Computing Chains of Syntenic Genes in Complete Genomes]]></title>
	<description><![CDATA[<p>The DAGchainer software computes chains of syntenic genes found within complete genome sequences. As input, DAGchainer accepts a list of gene pairs with sequence homology along with their genome coordinates. Using a scoring function which accounts for the distance between neighboring genes on each DNA molecule and the BLAST E-value score between homologs, maximally scoring chains of ordered gene pairs are computed and reported. This algorithm can be used to mine large evolutionary conserved regions of genomes between two organisms. Alternatively, by examining colinear sets of homologous genes found within a single genome, segmental genome duplications can be revealed.</p>
<p>This software distribution includes both the DAGchainer utility and a Java-based graphical interface that allows the inputs and outputs to be navigated and interrogated dynamically.</p><p>Address of the bookmark: <a href="http://dagchainer.sourceforge.net/" rel="nofollow">http://dagchainer.sourceforge.net/</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>

</channel>
</rss>