<?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/44589?offset=10</link>
	<atom:link href="https://bioinformaticsonline.com/related/44589?offset=10" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35384/mgcv-the-microbial-genomic-context-viewer-for-comparative-genome-analysis</guid>
	<pubDate>Mon, 29 Jan 2018 04:55:46 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35384/mgcv-the-microbial-genomic-context-viewer-for-comparative-genome-analysis</link>
	<title><![CDATA[MGcV: the microbial genomic context viewer for comparative genome analysis]]></title>
	<description><![CDATA[<p><span>MGcV is an interactive web-based visalization tool tailored to facilitate small scale genome analysis. To start using MGcV:</span></p>
<ol>
<li>Supply your genes/genomic segments/phylogenetic tree of interest in the input-box by
<ul>
<li>selecting the type of identifier and pasting identifiers (one per line)</li>
<li><em><strong>or</strong></em>&nbsp;by using the&nbsp;<a>gene ID search tool</a></li>
<li><em><strong>or</strong></em>&nbsp;with the&nbsp;<a>BLAST search tool</a></li>
</ul>
</li>
<li>Click "Visualize context".</li>
</ol>
<p><span>Consult the&nbsp;</span><a href="http://mgcv.cmbi.ru.nl/help.html" target="_blank">documentation</a><span>&nbsp;to learn more about MGcV.</span></p><p>Address of the bookmark: <a href="http://mgcv.cmbi.ru.nl/" rel="nofollow">http://mgcv.cmbi.ru.nl/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36907/higlass-a-tool-for-exploring-genomic-contact-matrices-and-tracks</guid>
	<pubDate>Mon, 11 Jun 2018 09:44:49 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36907/higlass-a-tool-for-exploring-genomic-contact-matrices-and-tracks</link>
	<title><![CDATA[HiGlass: a tool for exploring genomic contact matrices and tracks.]]></title>
	<description><![CDATA[HiGlass is a tool for exploring genomic contact matrices and tracks. Please take a look at the examples and documentation for a description of the ways that it can be configured to explore and compare contact matrices. To load private data, HiGlass can be run locally within a Docker container. The HiC data in the examples below is from Rao et al. (2014)

http://higlass.io/<p>Address of the bookmark: <a href="http://higlass.io/" rel="nofollow">http://higlass.io/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38053/swgis-v20-a-seqword-genomic-island-sniffer</guid>
	<pubDate>Thu, 01 Nov 2018 12:35:52 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38053/swgis-v20-a-seqword-genomic-island-sniffer</link>
	<title><![CDATA[swgis v2.0 : a seqword genomic island sniffer]]></title>
	<description><![CDATA[<p><strong>swgis v2.0</strong>&nbsp;is the modified version of the seqword genomic island sniffer. this version is specifically optimized for predicting genomic islands in eukaryotic genomes. swgis v2.0 was tested on several eukaryotic species of different lineages. all identified genomic islands were deposited in the&nbsp;<a href="http://eugi.bi.up.ac.za/" title="Go to EuGI database">eugi database</a>.</p>
<p><a href="http://eugi.bi.up.ac.za/download_swgis/swgisv2.0.zip" title="Download SWGIS v2.0">download swgis v2.0</a></p><p>Address of the bookmark: <a href="http://eugi.bi.up.ac.za/eugi_download_swgis.php" rel="nofollow">http://eugi.bi.up.ac.za/eugi_download_swgis.php</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/38682/bourque-lab</guid>
  <pubDate>Mon, 14 Jan 2019 15:39:25 -0600</pubDate>
  <link></link>
  <title><![CDATA[Bourque Lab]]></title>
  <description><![CDATA[
<p>The goal of the lab is to understand mammalian genomes using comparative genomic and epigenomic analyses. Areas of interest include: the evolution of regulatory sequences, the role of transposable elements in gene regulation and the impact of genome rearrangements in evolution and cancer.</p>

<p>As a computational genomicists our work involves examining billions of DNA base pairs and interpreting how variation impacts basic biology and disease. We develop computational methods and resources for the functional annotation of genomes with a special emphasis on sequencing-based assays (e.g. ChIP-seq, RNA-Seq, exome- and whole-genome sequencing, single-cell analysis).</p>

<p>http://www.computationalgenomics.ca</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41405/sequence-tube-maps-displays-multiple-genomic-sequences-in-the-form-of-a-tube-map</guid>
	<pubDate>Wed, 11 Mar 2020 01:12:06 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41405/sequence-tube-maps-displays-multiple-genomic-sequences-in-the-form-of-a-tube-map</link>
	<title><![CDATA[Sequence Tube Maps: displays multiple genomic sequences in the form of a tube map]]></title>
	<description><![CDATA[<p>A JavaScript module for the visualization of genomic sequence graphs. It automatically generates a "tube map"-like visualization of sequence graphs which have been created with <a href="https://github.com/vgteam/vg">vg</a>. (<a href="https://github.com/vgteam/vg">https://github.com/vgteam/vg</a>)</p>
<h3>Link to working demo: <a href="https://vgteam.github.io/sequenceTubeMap/">https://vgteam.github.io/sequenceTubeMap/</a></h3>
<p><img src="https://raw.githubusercontent.com/vgteam/sequenceTubeMap/master/images/header.png" alt="image" style="border: 0px; border: 0px;"></p><p>Address of the bookmark: <a href="https://github.com/vgteam/sequenceTubeMap" rel="nofollow">https://github.com/vgteam/sequenceTubeMap</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44630/genofig-a-user-friendly-application-for-the-visualization-and-comparison-of-genomic-regions</guid>
	<pubDate>Mon, 05 Aug 2024 23:06:58 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44630/genofig-a-user-friendly-application-for-the-visualization-and-comparison-of-genomic-regions</link>
	<title><![CDATA[GenoFig: a user-friendly application for the visualization and comparison of genomic regions]]></title>
	<description><![CDATA[<p>Tool for graphical vizualisation of annotated genetic regions, and homologous regions comparison. It is an independent recoding of Easyfig 2 initially developped by at the S. Beatson Lab [<a href="https://mjsull.github.io/Easyfig/" target="_blank">https://mjsull.github.io/Easyfig/</a>]</p>
<p dir="auto">Download the GenoFig source code using the 'Download' button on top of this page. Cloning is currently not available for people not member of the INRAE French Institution. After decompression, open a terminal in the folder containing the decompressed files and run:</p>
<div>
<pre id="code-47"><code><span>conda env create -f extras/requirements.yml</span>
<span>extras/SETUP.sh</span></code></pre>
</div><p>Address of the bookmark: <a href="https://forgemia.inra.fr/public-pgba/genofig" rel="nofollow">https://forgemia.inra.fr/public-pgba/genofig</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/28119/kraken-ultrafast-metagenomic-sequence-classification-using-exact-alignments</guid>
	<pubDate>Mon, 27 Jun 2016 11:01:44 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/28119/kraken-ultrafast-metagenomic-sequence-classification-using-exact-alignments</link>
	<title><![CDATA[Kraken: ultrafast metagenomic sequence classification using exact alignments]]></title>
	<description><![CDATA[<p>Kraken is an ultrafast and highly accurate program for assigning taxonomic labels to metagenomic DNA sequences. Previous programs designed for this task have been relatively slow and computationally expensive, forcing researchers to use faster abundance estimation programs, which only classify small subsets of metagenomic data. Using exact alignment of <em>k</em>-mers, Kraken achieves classification accuracy comparable to the fastest BLAST program. In its fastest mode, Kraken classifies 100 base pair reads at a rate of over 4.1 million reads per minute, 909 times faster than Megablast and 11 times faster than the abundance estimation program MetaPhlAn. Kraken is available at <a href="http://ccb.jhu.edu/software/kraken/" target="pmc_ext">http://ccb.jhu.edu/software/kraken/</a>.</p>
<p>Krona</p>
<p>https://sourceforge.net/p/krona/home/krona/</p><p>Address of the bookmark: <a href="http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4053813/" rel="nofollow">http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4053813/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34420/rita-rapid-identification-of-high-confidence-taxonomic-assignments-for-metagenomic-data</guid>
	<pubDate>Mon, 27 Nov 2017 08:25:33 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34420/rita-rapid-identification-of-high-confidence-taxonomic-assignments-for-metagenomic-data</link>
	<title><![CDATA[RITA: Rapid identification of high-confidence taxonomic assignments for metagenomic data]]></title>
	<description><![CDATA[<p>RITA is a standalone software package and Web server for taxonomic assignment of metagenomic sequence reads. By combining homology predictions from BLAST or UBLAST with compositional classifications from a Naive Bayes classifier, RITA is able to achieve very high accuracy on short reads. Unlike other hybrid approaches which combine these predictions for all sequences to be classified, RITA uses a pipeline to first identify cases where both types of classifier are in agreement, which constitute the highest-confidence set. Sequences not classified in this manner are subjected to a series of downstream classification steps.</p>
<p>This work has been accepted for publication:</p>
<p>MacDonald NJ, Parks DH, and Beiko RG. Rapid identification of taxonomic assignments. Accepted to&nbsp;<em>Nucleic Acids Research</em>&nbsp;April 4, 2012.</p>
<p>If you have any questions or bug reports, please let us know at &lt;beiko@cs.dal.ca&gt;.</p><p>Address of the bookmark: <a href="http://kiwi.cs.dal.ca/Software/RITA" rel="nofollow">http://kiwi.cs.dal.ca/Software/RITA</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/2422/bioinformatics-codes-search</guid>
	<pubDate>Thu, 15 Aug 2013 11:08:52 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/2422/bioinformatics-codes-search</link>
	<title><![CDATA[Bioinformatics Codes Search]]></title>
	<description><![CDATA[<p>I bet, this website will be your best friend in near future. This helps us to explore the existing open source codes and learn from it.</p>
<p>You can find some useful open source bioinformatics codes for your analysis work. You can use the left bar options to filtere out or narrow down your search result. This webpage can be an useful resource for a beginners bioinformatician as it contain several bioinformatics basics script that are commonly used by biological programmers and biologist.</p>
<p>Stand on the slumped, dandruff-covered shoulders of millions of computer nerds. _/\_</p>
<p>Enjoy the code and research work.</p>
<p>http://code.ohloh.net/search?s=bioinformatics</p><p>Address of the bookmark: <a href="http://code.ohloh.net/search?s=bioinformatics" rel="nofollow">http://code.ohloh.net/search?s=bioinformatics</a></p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/27459/tools-for-searching-repeats-and-palindromic-sequences</guid>
	<pubDate>Sat, 21 May 2016 22:32:25 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/27459/tools-for-searching-repeats-and-palindromic-sequences</link>
	<title><![CDATA[Tools for Searching Repeats And Palindromic Sequences]]></title>
	<description><![CDATA[<p>What are genomic interspersed repeats?</p><p>In the mid 1960's scientists discovered that many genomes contain stretches of highly repetitive DNA sequences ( see Reassociation Kinetics Experiments, and C-Value Paradox ). These sequences were later characterized and placed into five categories:</p><p><strong>Simple Repeats</strong> - Duplications of simple sets of DNA bases (typically 1-5bp) such as A, CA, CGG etc.<br /><strong>Tandem Repeats</strong> - Typically found at the centromeres and telomeres of chromosomes these are duplications of more complex 100-200 base sequences.<br /><strong>Segmental Duplications</strong> - Large blocks of 10-300 kilobases which are that have been copied to another region of the genome.<br /><strong>Interspersed Repeats</strong><br />Processed Pseudogenes, Retrotranscripts, SINES - Non-functional copies of RNA genes which have been reintegrated into the genome with the assitance of a reverse transcriptase.<br />DNA Transposons<br />Retrovirus Retrotransposons<br />Non-Retrovirus Retrotransposons ( LINES )</p><p>Currently up to 50% of the human genome is repetitive in nature and as improvements are made in detection methods this number is expected to increase.</p><p>On the other hand; In genetics, the term palindrome refers to a sequence of nucleotides along a DNA (deoxyribonucleic acid) or RNA (ribonucleic acid) strand that contains the same series of nitrogenous bases regardless from which direction the strand is analyzed. Akin to a language palindrome&mdash;wherein a word or phrase is spelled the same left-to-right as right-to-left (e.g., the word RADAR or the phrase "able was I ere I saw elba")&mdash;with genetic palindromes it does not matter whether the nucleic acid strand is read starting from the 3' (three prime) end or the 5' (five prime) end of the strand.</p><p>Recent research on palindromes centers on understanding palindrome formation during gene amplification. Other studies have attempted to relate palindrome formation to molecular mechanisms involved in double stranded breaks and in the formation of inverted repeats. Assisted by high speed computers, other groups of scientists link palindrome formation to the conservation of genetic information.</p><p>Related to the direction of transcription by RNA polymerase, DNA strands have upstream and downstream terminus defined by differing chemical groups at each end. The ends of each strand of DNA or RNA are termed the 5' (phosphate bound to the 5' position carbon) and 3' (phosphate bound to the 3' carbon) ends to indicate a polarity within the molecule. Using the letters A, T, C, G, to represent the nitrogenous bases adenine, thymine, cytosine, and guanine found in DNA, and the letters A, U, C, G to represent the nitrogenous bases adenine, uracil, cytosine, guanine found in RNA (Note that uracil in RNA replaces the thymine found in DNA), geneticists usually represent DNA by a series of base codes (e.g., 5' AATCGGATTGCA 3'). The base codes are usually arranged from the 5' end to the 3' end.</p><p>Because of specific base pairing in DNA (i.e., adenine (A) always bonds with (thymine (T) and cytosine (C) always bonds with guanine (G)) the complimentary stand to the sequence 5' AATCGGATTGCA 3' would be 3' TTAGCCTAACGT 5'.</p><p>With palindromes the sequences on the complimentary strands read the same in either direction. For example, a sequence of 5' GAATTC3' on one strand would be complimented by a 3' CTTAAG 5' strand. In either case, when either strand is read from the 5' prime end the sequence is GAATTC. Another example of a palindrome would be the sequence 5' CGAAGC 3' that, when reversed, still reads CGAAGC.</p><p>Palindromes are important sequences within nucleic acids. Often they are the site of binding for specific enzymes (e.g., restriction endobucleases) designed to cut the DNA strands at specific locations (i.e., at palindromes).</p><p>Palindromes may arise from brakeage and chromosomal inversions that form inverted repeats that compliment each other. When a palindrome results from an inversion, it is often referred to as an inverted repeat. For example, the sequence 5' CGAAGC 3', if inverted (reversed 180&deg;), still reads CGAAGC.</p><p>The <a href="http://emboss.open-bio.org/">European Molecular Biology Open Software Suite (EMBOSS)</a> includes some basic tools for finding tandem repeats and inverted repeats (see <a href="http://emboss.open-bio.org/html/use/apbs06.html#GroupsAppsTableNucleicrepeatsR6">B.6.22. Applications in group Nucleic:repeats</a>). There are many on-line services providing the EMBOSS tools, for example:</p><ul>
<li>Wageningen Bioinformatics Webportal <a href="http://emboss.bioinformatics.nl/">EMBOSS explorer</a></li>
<li><a href="http://mobyle.pasteur.fr/">Mobyle@Pasteur</a></li>
<li><a href="http://wsembnet.vital-it.ch/">Soaplab2 Web Services at Vital-IT</a></li>
</ul><p>For more sophisticated repeat finding you will want to look at tools using <a href="http://www.girinst.org/repbase/">Repbase</a> for example:</p><ul>
<li>CENSOR
<ul>
<li><a href="http://www.girinst.org/censor/">CENSOR@GIRI</a></li>
<li><a href="http://www.ebi.ac.uk/Tools/so/censor/">CENSOR@EMBL-EBI</a></li>
</ul>
</li>
<li><a href="http://www.repeatmasker.org/">RepeatMasker</a></li>
<li><a href="http://mummer.sourceforge.net/">MUMmer</a>&nbsp;(scan_for_match)</li>
<li><a href="http://emboss.bioinformatics.nl/cgi-bin/emboss/palindrome">Emboss Palindrome</a></li>
</ul><p>Other nucleotide repeat finding methods found by a couple of web searches:</p><ul>
<li><a href="http://tandem.bu.edu/trf/trf.html">Tandem Repeats Finder</a></li>
<li><a href="http://selab.janelia.org/recon.html">RECON</a></li>
<li><a href="http://www.yandell-lab.org/software/repeatrunner.html">RepeatRunner</a></li>
<li><a href="http://bibiserv.techfak.uni-bielefeld.de/reputer/">REPuter</a></li>
<li><a href="http://210.212.215.200/IMEX/index.html">Imperfect Microsatellite Extractor (IMEx)</a></li>
<li><a href="http://www.imtech.res.in/raghava/srf/">Spectral Repeat Finder (SRF)</a></li>
<li><a href="http://zlab.bu.edu/repfind/form.html">REPFIND</a></li>
<li><a href="http://crispr.u-psud.fr/Server/CRISPRfinder.php">CRISPRfinder</a></li>
<li><a href="http://grail.lsd.ornl.gov/grailexp/">GrailEXP</a></li>
<li><a href="http://alggen.lsi.upc.edu/recerca/search/frame-search.html">CONREPP</a></li>
<li><a href="http://www.biophp.org/minitools/find_palindromes/demo.php%20"><span>find_palindromes</span></a></li>
<li><a href="http://insilico.ehu.eus/palindromes/"><span>Palindrome</span></a></li>
<li><a href="http://emboss.bioinformatics.nl/cgi-bin/emboss/palindrome">EMBOSS Palindrome</a></li>
<li><a href="http://bioinfo.cs.technion.ac.il/projects/Engel-Freund/new.html">Palindrome Search</a></li>
</ul>]]></description>
	<dc:creator>Radha Agarkar</dc:creator>
</item>

</channel>
</rss>