<?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/38039?offset=0</link>
	<atom:link href="https://bioinformaticsonline.com/related/38039?offset=0" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43736/odgi-optimized-dynamic-genomegraph-implementation</guid>
	<pubDate>Tue, 01 Feb 2022 23:42:21 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43736/odgi-optimized-dynamic-genomegraph-implementation</link>
	<title><![CDATA[odgi: optimized dynamic genome/graph implementation]]></title>
	<description><![CDATA[<p dir="auto"><code>odgi</code>&nbsp;provides an efficient and succinct dynamic DNA sequence graph model, as well as a host of algorithms that allow the use of such graphs in bioinformatic analyses.</p>
<p dir="auto">Careful encoding of graph entities allows&nbsp;<code>odgi</code>&nbsp;to efficiently compute and transform&nbsp;<a href="https://pangenome.github.io/">pangenomes</a>&nbsp;with minimal overheads.&nbsp;<code>odgi</code>&nbsp;implements a dynamic data structure that leveraged multi-core CPUs and can be updated on the fly.</p>
<p dir="auto">The edges and path steps are recorded as deltas between the current node id and the target node id, where the node id corresponds to the rank in the global array of nodes. Graphs built from biological data sets tend to have local partial order and, when sorted, the deltas be small. This allows them to be compressed with a variable length integer representation, resulting in a small in-memory footprint at the cost of packing and unpacking.</p>
<p dir="auto">The RAM and computational savings are substantial. In partially ordered regions of the graph, most deltas will require only a single byte.</p><p>Address of the bookmark: <a href="https://github.com/pangenome/odgi" rel="nofollow">https://github.com/pangenome/odgi</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/33014/synteny-portal-a-web-based-application-portal-for-synteny-block-analysis</guid>
	<pubDate>Wed, 24 May 2017 10:39:23 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/33014/synteny-portal-a-web-based-application-portal-for-synteny-block-analysis</link>
	<title><![CDATA[Synteny Portal: a web-based application portal for synteny block analysis]]></title>
	<description><![CDATA[<p><span>Synteny Portal, a versatile web-based application portal for constructing, visualizing and browsing synteny blocks. With Synteny Portal, users can easily (i) construct synteny blocks among multiple species by using prebuilt alignments in the UCSC genome browser database, (ii) visualize and download syntenic relationships as high-quality images, (iii) browse synteny blocks with genetic information and (iv) download the details of synteny blocks to be used as input for downstream synteny-based analyses, all in an intuitive and easy-to-use web-based interface. We believe that Synteny Portal will serve as a highly valuable tool that will enable biologists to easily perform comparative genomics studies by compensating limitations of existing tools. Synteny Portal is freely available at&nbsp;</span><a href="http://bioinfo.konkuk.ac.kr/synteny_portal" target="pmc_ext">http://bioinfo.konkuk.ac.kr/synteny_portal</a><span>.</span></p>
<p>http://bioinfo.konkuk.ac.kr/synteny_portal/</p><p>Address of the bookmark: <a href="http://bioinfo.konkuk.ac.kr/synteny_portal/" rel="nofollow">http://bioinfo.konkuk.ac.kr/synteny_portal/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34490/collinearity-scripts-to-parse-and-analyse-mcscanx-collinearity-output</guid>
	<pubDate>Wed, 29 Nov 2017 16:47:54 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34490/collinearity-scripts-to-parse-and-analyse-mcscanx-collinearity-output</link>
	<title><![CDATA[collinearity: scripts to parse and analyse MCScanX collinearity output]]></title>
	<description><![CDATA[<p><span>scripts to parse and analyse MCScanX collinearity output</span></p><p>Address of the bookmark: <a href="https://github.com/reubwn/collinearity" rel="nofollow">https://github.com/reubwn/collinearity</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/34707/string-graph-based-genome-assembly-software-and-tools</guid>
	<pubDate>Tue, 19 Dec 2017 17:17:38 -0600</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/34707/string-graph-based-genome-assembly-software-and-tools</link>
	<title><![CDATA[String graph based genome assembly software and tools !]]></title>
	<description><![CDATA[<p>In&nbsp;<a href="https://en.wikipedia.org/wiki/Graph_theory" title="Graph theory">graph theory</a>, a&nbsp;<strong>string graph</strong>&nbsp;is an&nbsp;<a href="https://en.wikipedia.org/wiki/Intersection_graph" title="Intersection graph">intersection graph</a>&nbsp;of&nbsp;<a href="https://en.wikipedia.org/wiki/Curve" title="Curve">curves</a>&nbsp;in the plane; each curve is called a "string".&nbsp; String graphs were first proposed by E. W. Myers in a&nbsp;<a href="http://bioinformatics.oxfordjournals.org/content/21/suppl_2/ii79.full.pdf+html">2005 publication</a>.&nbsp;In&nbsp;recent&nbsp;<a href="http://genome.cshlp.org/content/early/2012/01/22/gr.126953.111">Genome Research paper</a>&nbsp;describing an innovative approach for assembling large genomes from NGS data caught our attention for several reasons. i) it give different "string graph" prospective of long lasting genome assembly problem ii) the&nbsp;paper is coauthored by Jared Simpson, the developer of&nbsp;<a href="http://www.ncbi.nlm.nih.gov/pmc/articles/PMC2694472/">ABySS assembler</a>&nbsp;and Richard Durbin. iii)&nbsp;Simpson-Durbin algorithm is that it does not rely on de Bruijn graphs, and instead employs a different graph construction approach called &lsquo;string graph&rsquo;.</p><p>Following are the genome assembly tools based on string graph:</p><p>1.SGA (String Graph Assembler)&nbsp;https://github.com/jts/sga</p><p>Assembles large genomes from high coverage short read data. SGA is designed as a modular set of programs, which are used to form an assembly pipeline. SGA implements a set of assembly algorithms based on the FM-index. As the FM-index is a compressed data structure, the algorithms are very memory efficient. The SGA assembly has three distinct phases. The first phase corrects base calling errors in the reads. The second phase assembles contigs from the corrected reads. The third phase uses paired end and/or mate pair data to build scaffolds from the contigs. The output of this software is a PDF report that allows the properties of the genome and data quality to be visually explored. By providing more information to the user at the start of an assembly project, this software will help increase awareness of the factors that make a given assembly easy or difficult, assist in the selection of software and parameters and help to troubleshoot an assembly if it runs into problems.</p><p>2.&nbsp;SAGE: String-overlap Assembly of GEnomes&nbsp;https://github.com/lucian-ilie/SAGE2</p><p>SAGE, for de novo genome assembly. As opposed to most assemblers, which are de Bruijn graph based, SAGE uses the string-overlap graph. SAGE builds upon great existing work on string-overlap graph and maximum likelihood assembly, bringing an important number of new ideas, such as the efficient computation of the transitive reduction of the string overlap graph, the use of (generalized) edge multiplicity statistics for more accurate estimation of read copy counts, and the improved use of mate pairs and min-cost flow for supporting edge merging. The assemblies produced by SAGE for several short and medium-size genomes compared favourably with those of existing leading assemblers.</p><p>3. FSG: Fast String Graph</p><p>The new integrated assembler has been assessed on a standard benchmark, showing that fast string graph (FSG) is significantly faster than SGA while maintaining a moderate use of main memory, and showing practical advantages in running FSG on multiple threads. Moreover, we have studied the effect of coverage rates on the running times.</p><p>4.&nbsp;&nbsp;BASE&nbsp;https://github.com/dhlbh/BASE</p><p>It enhances the classic seed-extension approach by indexing the reads efficiently to generate adaptive seeds that have high probability to appear uniquely in the genome. Such seeds form the basis for BASE to build extension trees and then to use reverse validation to remove the branches based on read coverage and paired-end information, resulting in high-quality consensus sequences of reads sharing the seeds. Such consensus sequences are then extended to contigs.&nbsp;BASE is a practically efficient tool for constructing contig, with significant improvement in quality for long NGS reads. It is relatively easy to extend BASE to include scaffolding.</p><p>5.&nbsp;Fermi&nbsp;https://github.com/lh3/fermi/</p><p>Fermi is a de novo assembler with a particular focus on assembling Illumina&nbsp;short sequence reads from a mammal-sized genome. In addition to the role of a&nbsp;typical assembler, fermi also aims to preserve heterozygotes which are often&nbsp;collapsed by other assemblers. Its ultimate goal is to find a minimal set of&nbsp;unitigs to represent all the information in raw reads.</p><p>If you want to learn about String Graph assembler, please read the following papers -</p><p>i)&nbsp;<a href="http://bioinformatics.oxfordjournals.org/content/21/suppl_2/ii79.full.pdf+html">The Fragment Assembly String Graph - E. W. Myers</a></p><p>This paper describes the String Graph concept.</p><p>ii)&nbsp;<a href="http://bioinformatics.oxfordjournals.org/content/26/12/i367.full#ref-20">Efficient construction of an assembly string graph using the FM-index - Jared T. Simpson and Richard Durbin</a></p><p>This earlier paper from Simpson and Durbin</p><p>iii)&nbsp;<a href="http://genome.cshlp.org/content/early/2012/01/22/gr.126953.111">Efficient de novo assembly of large genomes using compressed data structures - Jared T. Simpson and Richard Durbin</a></p><p>&nbsp;</p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37306/genome-u-plot-a-whole-genome-visualization</guid>
	<pubDate>Fri, 13 Jul 2018 19:50:41 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37306/genome-u-plot-a-whole-genome-visualization</link>
	<title><![CDATA[Genome U-Plot: a whole genome visualization]]></title>
	<description><![CDATA[<p><span>Genome U-Plot for producing clear and intuitive graphs that allows researchers to generate novel insights and hypotheses by visualizing SVs such as deletions, amplifications, and chromoanagenesis events. The main features of the Genome U-Plot are its layered layout, its high spatial resolution and its improved aesthetic qualities.&nbsp;</span></p>
<p><span>https://github.com/gaitat/GenomeUPlot</span></p><p>Address of the bookmark: <a href="https://github.com/gaitat/GenomeUPlot" rel="nofollow">https://github.com/gaitat/GenomeUPlot</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37796/grsr-a-tool-for-deriving-genome-rearrangement-scenarios-from-multiple-unichromosomal-genome-sequences</guid>
	<pubDate>Fri, 28 Sep 2018 09:35:10 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37796/grsr-a-tool-for-deriving-genome-rearrangement-scenarios-from-multiple-unichromosomal-genome-sequences</link>
	<title><![CDATA[GRSR: a tool for deriving genome rearrangement scenarios from multiple unichromosomal genome sequences]]></title>
	<description><![CDATA[<p>GRSR is a Tool for Deriving Genome Rearrangement Scenarios for Multiple Uni-chromosomal Genomes. This tool will do the following steps:</p>
<ul>
<li>Step 1. Run mugsy to get multiple sequence alignment results.</li>
<li>Step 2 &amp; 3. Extraction of the Coordinates of Core Blocks, Construction of Synteny Blocks and Generating Signed Permutations.</li>
<li>Step 4. Generate pairwise genome rearrangement scenarios and find repeats at the breakpoints of each rearrangement events.</li>
<li></li>
<li></li>
</ul>
<p>https://github.com/DanwangJessica/GRSR</p><p>Address of the bookmark: <a href="https://github.com/DanwangJessica/GRSR" rel="nofollow">https://github.com/DanwangJessica/GRSR</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40598/mitoz-a-toolkit-for-animal-mitochondrial-genome-assembly-annotation-and-visualization</guid>
	<pubDate>Fri, 24 Jan 2020 04:09:15 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40598/mitoz-a-toolkit-for-animal-mitochondrial-genome-assembly-annotation-and-visualization</link>
	<title><![CDATA[MitoZ: a toolkit for animal mitochondrial genome assembly, annotation and visualization]]></title>
	<description><![CDATA[<p><span>MitoZ is a Python3-based toolkit which aims to automatically filter pair-end raw data (fastq files), assemble genome, search for mitogenome sequences from the genome assembly result, annotate mitogenome (genbank file as result), and mitogenome visualization. MitoZ is available from&nbsp;</span><code>https://github.com/linzhi2013/MitoZ</code><span>.</span></p>
<p><span><a href="https://academic.oup.com/nar/article/47/11/e63/5377471">https://academic.oup.com/nar/article/47/11/e63/5377471</a></span></p><p>Address of the bookmark: <a href="https://github.com/linzhi2013/MitoZ" rel="nofollow">https://github.com/linzhi2013/MitoZ</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/42936/ancient-whole-genome-duplication-wgd-detection-tools</guid>
	<pubDate>Sun, 07 Mar 2021 00:32:44 -0600</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/42936/ancient-whole-genome-duplication-wgd-detection-tools</link>
	<title><![CDATA[Ancient whole genome duplication (WGD) detection tools !]]></title>
	<description><![CDATA[<p>There are two methods for ancient WGD detection, one is collinearity analysis, and the other is based on the Ks distribution map. Among them, Ks is defined as the average number of synonymous substitutions at each synonymous site, and there is also a Ka corresponding to it, which refers to the average number of non-synonymous substitutions at each non-synonymous site.</p><p>At present, some people have posted articles about the analysis process of WGD. I searched for the keyword "wgd pipeline" and found the following:</p><p><strong>GenoDup: https:// github.com/MaoYafei/GenoDup-Pipeline</strong><br /><strong>https://peerj.com/articles/6303/</strong><br /><strong>WGDdetector: https:// github.com/yongzhiyang2 012/WGDdetector</strong><br /><strong>https://bmcbioinformatics.biomedcentral.com/articles/10.1186/s12859-019-2670-3</strong><br /><strong>wgd: https:// github.com/arzwa/wgd</strong><br /><strong>https://bmcbioinformatics.biomedcentral.com/articles/10.1186/s12859-016-1142-2#Sec1</strong><br /><strong>https://bmcbiol.biomedcentral.com/articles/10.1186/s12915-017-0399-x</strong><br /><strong>GeNoGAP https://bmcbioinformatics.biomedcentral.com/articles/10.1186/s12859-016-1142-2</strong><br /><strong>https://bmcbiol.biomedcentral.com/articles/10.1186/s12915-017-0399-x</strong><br /><strong>https://github.com/dfguan/purge_dups</strong><br /><strong>https://www.biorxiv.org/content/10.1101/2020.01.24.917997v1</strong></p><p>This article introduces the usage of wgd.</p><p>Wgd cannot be installed directly with bioconda at present, so it is a little troublesome to install, because it depends on a lot of software. wgd depends on the following software</p><p><strong>BLAST</strong><br /><strong>MCL</strong><br /><strong>MUSCLE/MAFFT/PRANK</strong><br /><strong>PAML</strong><br /><strong>PhyML/FastTree</strong><br /><strong>i-ADHoRe</strong></p><p>But the good news is that most of the software it depends on can be installed with bioconda</p><blockquote><p>conda create -n wgd python=3.5 blast mcl muscle mafft prank paml fasttree cmake libpng mpi=1.0=mpich<br />conda activate wgd</p></blockquote><p>Here mpi=1.0=mpich is selected, because i-adhore depends on mpich. If openmpi is installed, an error will appear while loading shared libraries: libmpi_cxx.so.40: cannot open shared object file: No such file or directory</p><p>After that, the installation is much simpler</p><blockquote><p>git clone https://github.com/arzwa/wgd.git<br />cd wgd<br />pip install .<br />pip install git+https://github.com/arzwa/wgd.git<br />For i-ADHoRe, you need to register at http:// bioinformatics.psb.ugent.be /webtools/i-adhore/licensing/Agree to the license to download i-ADHoRe-3.0</p></blockquote><p>Since my miniconda3 installed ~/opt/, the installation path is so~/opt/miniconda3/envs/wgd/</p><blockquote><p>tar -zxvf i-adhore-3.0.01.tar.gz<br />cd i-adhore-3.0.01<br />mkdir -p build &amp;&amp; cd build<br />cmake .. -DCMAKE_INSTALL_PREFIX=~/opt/miniconda3/envs/wgd/<br />make -j 4 <br />make insatall</p></blockquote><p>Take the sugarcane genome Saccharum spontaneum L as an example. The genome is 8-ploid with 32 chromosomes (2n = 4x8 = 32)</p><p><strong>Download the tutorial for CDS and GFF annotation files</strong></p><blockquote><p><strong>mkdir -p wgd_tutorial &amp;&amp; cd wgd_tutorial</strong><br /><strong>wget http://www.life.illinois.edu/ming/downloads/Spontaneum_genome/Sspon.v20190103.cds.fasta.gz</strong><br /><strong>wget http://www.life.illinois.edu/ming/downloads/Spontaneum_genome/Sspon.v20190103.gff3.gz</strong><br /><strong>gunzip *.gz</strong></p></blockquote><p>First conda activate wgdstart our analysis environment, and then start the analysis</p><p>Step 1 : Use to wgd mclidentify homologous genes in the genome</p><blockquote><p>wgd mcl -n 20 --cds --mcl -s Sspon.v20190103.cds.fasta -o Sspon_cds.out</p></blockquote><p>Step 2 : Use to wgd ksdbuild Ks distribution</p><blockquote><p>wgd ksd --n_threads 80 Sspon_cds.out/Sspon.v20190103.cds.fasta.blast.tsv.mcl Sspon.v20190103.cds.fasta</p></blockquote><p>Step 3 : If the quality of the genome is good, then wgd syncollinearity analysis can be used . It can help us find the collinearity block in the genome and the corresponding anchor point</p><blockquote><p>wgd syn --feature gene --gene_attribute ID \<br /> -ks wgd_ksd/Sspon.v20190103.cds.fasta.ks.tsv \<br /> Sspon.v20190103.gff3 Sspon_cds.out/Sspon.v20190103.cds.fasta.blast.tsv.mcl</p></blockquote><p>&nbsp;For more reading - There are 9 sub-modules in WGD</p><ul>
<li><span>kde: KDE fitting to the Ks distribution</span></li>
<li><span>ksd: Ks distribution construction</span></li>
<li><span>mcl: BLASP comparison of All-vs-ALl + MCL classification analysis.</span></li>
<li><span><span>mix: Hybrid modeling of Ks distribution.</span></span></li>
<li><span>pre: preprocess the CDS file</span></li>
<li><span>syn: Call I-ADHoRe 3.0 to use GFF files for collinearity analysis</span></li>
<li><span>viz: draw histogram and density plot</span></li>
<li><span>wf1: Ks standard analysis procedure of the whole genome paranome (paranome), call mcl, ksd and syn</span></li>
<li><span>wf2: Ks standard analysis procedure of one-vs-one homologous gene (ortholog), call wcl and kSD</span></li>
</ul>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44311/jbrowse-2-a-modular-genome-browser-with-views-of-synteny-and-structural-variation</guid>
	<pubDate>Tue, 25 Apr 2023 20:58:52 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44311/jbrowse-2-a-modular-genome-browser-with-views-of-synteny-and-structural-variation</link>
	<title><![CDATA[JBrowse 2: a modular genome browser with views of synteny and structural variation]]></title>
	<description><![CDATA[<ul dir="auto">
<li>igvjs - a create-react-app with igv package from npm installed. the igv.js is instrumented to output "DONE" to the console when finished, and to have an increased fetchSizeLimit (which is otherwise git in CRAM longread tests)</li>
<li>jb2-web - stock instance of jbrowse-web v1.7.5</li>
<li>jb1 - stock instance of jbrowse 1 v1.16.11</li>
<li>jb2 embedded - a create-react-app with @jbrowse/react-linear-genome-view</li>
</ul><p>Address of the bookmark: <a href="https://github.com/GMOD/jb2profile" rel="nofollow">https://github.com/GMOD/jb2profile</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/4574/tools-to-detect-synteny-blocks-regions-among-multiple-genomes</guid>
	<pubDate>Mon, 16 Sep 2013 17:12:02 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/4574/tools-to-detect-synteny-blocks-regions-among-multiple-genomes</link>
	<title><![CDATA[Tools to detect synteny blocks regions among multiple genomes]]></title>
	<description><![CDATA[<p>The synteny block (which etymologically means &ldquo;on the same ribbon&rdquo;) is a collection of contiguous genes located on the same chromosome. These block regions have mostly been preserved by genome rearrangements, and so synteny blocks from two related species (e.g., humans and mice) will be roughly similar but flipped around on the respective genomes. Ovcharenko et. al. define it as &lsquo;any conserved sequence blocks, regardless of whether it encompasses multiple genes, an area containing single genes, or areas devoid of known genes to be considers as synteny block as long as there is conservation at the sequence level. Today, however, biologists usually refer to synteny as the conservation of blocks of order within two sets of chromosomes that are being compared with each other. This concept can also be referred to as shared synteny. The NHBLI/NCBI Glossary define synteny as &ldquo;Two genes which occur on the same chromosome are syntenic; however, syntenic genes may or may not be "linked."</p><p>Now a day, geneticists have developed a language of their own. They are pouring lots of money and energy to read the entire genomic text and understand the gods own code ATGC. It is somewhat fascinating, not only for geneticist but also for non-biologist to know that there are several conserved blocks in genome which remain conserved over hundreds of millions of years. There have been several researches on conserved blocks and non-conserved regions to understand the mechanism and importance of all these regions (http://www.ncbi.nlm.nih.gov/pmc/articles/PMC2675965/). The finding indicates conservation and rearrangements of certain evolutionary important genes play an important role in evolution/adaptive changes (http://www.nature.com/nature/journal/v491/n7424/abs/nature11622.html https://academic.oup.com/gbe/article/8/8/2442/2198198/Novel-Insights-into-Chromosome-Evolution-in-Birds , http://science.sciencemag.org/content/346/6215/1311).</p><p>But the puzzle remains open, how to correctly define the synteny (presence of two or more genes on the same chromosome) and conserved synteny (presence of two or more genes on chromosome of each of the two species) on several genomes.</p><p><img src="http://bioinformaticsonline.com/mod/photo/syntenyImg.jpg" alt="image" width="720" height="179" style="border: 0px; border: 0px;"></p><p>Figure: Image generated with Evolution Highway (EH) tool http://eh-demo.ncsa.illinois.edu/&nbsp;</p><p>Keeping the new approach to define conserved synteny in mind there have been various algorithms developed to identify the conserved homologous synteny blocks (HSB) amongst species. Some of them which were commonly used for synteny detections are:</p><p>SyntenyTracker ( http://www-app.igb.uiuc.edu/labs/lewin/donthu/Synteny_assign/html/),</p><p>SyntenyTracker was shown to be an efficient and accurate automated tool for defining HSBs using datasets that may contain minor errors resulting from limitations in map construction methodologies.</p><p>CoGe (http://genomevolution.org/CoGe/SynFind.pl )</p><p>Satsuma (http://evomics.org/learning/genomics/satsuma/)</p><p>Cinteny (http://cinteny.cchmc.org/) ,</p><p>Cinteny server can be used for finding regions syntenic across multiple genomes and measuring the extent of genome rearrangement using reversal distance as a measure.</p><p>OrthoCluster (http://krono.act.uji.es/noticias/orthocluster-a-new-tool-for-mining-syntenic-blocks)</p><p>A new tool for mining syntenic blocks in comparative genomics</p><p>SynMap (http://genomevolution.org/wiki/index.php/SynMap),</p><p>SyMAP (http://www.symapdb.org/)</p><p>SyMAP (Synteny Mapping and Analysis Program) v4.0 is an automated system for identifying and displaying genome synteny alignments. The genomes may be represented by sequenced chromosomes (pseudomolecules), by draft sequence contigs, or by FPC physical maps (with BAC-end or marker sequence).</p><p>http://genomevolution.org/CoGe/SynMap.pl</p><p>RegionMiner (http://www.genomatix.de/online_help/help_regionminer/orthologous.html)</p><p>SyntenyMiner is being developed as an application to visualize and interrogate comparisons among multiple complete genome sequences. http://syntenyminer.sourceforge.net/</p><p>AutoGRAPH ( http://autograph.genouest.org/),</p><p>AutoGRAPH is an integrated web server for multi-species comparative genomic analysis. It is designed for constructing and visualizing synteny maps between two or three species, determination and display of macrosynteny and microsynteny relationships among species, and for highlighting evolutionary breakpoints.</p><p>SynChro(http://www.lgm.upmc.fr/CHROnicle/SynChro.html)</p><p>SynChro is a tool designed to define conserved synteny blocks. It reconstructs synteny blocks between pairwise comparison of multiple genomes. The reconstructed synteny blocks may overlap each other, be included in one another or duplicated due to micro-rearrangements.</p><p>SyntenyView ( http://www.cbs.dtu.dk/dtucourse/cookbooks/nikob/exercises/gf1_output_5.html),</p><p>Ensembl 'SyntenyView' shows conservation of large-scale gene order between species pairs. A brief summary of the calculation method appears at the bottom of this help page.&nbsp; The left of a 'SyntenyView' page displays a diagram of chromosomes with blocks of conserved synteny. The right of a page shows homology matches between individual genes within syntenic blocks.</p><p>SynBrowse ( http://www.synbrowse.org/),</p><p>SynBrowse (Synteny Browser) is a generic sequence comparison tool for visualizing genome alignments both within and between species. It is intended to help scientists study and analyze synteny, homologous genes and other conserved elements between sequences. This software is useful in studying genome duplication and evolution. It can also aid in identifying uncharacterized genes, putative regulatory elements and novel structural features of study species by comparing to a well annotated reference sequence, thus enabling genome curators to refine and edit annotations of species that have incomplete genome annotations.</p><p>Sibelia (http://arxiv.org/abs/1307.7941).</p><p>A comparative genomic tool: It assists biologists in analysing the genomic variations that correlate with pathogens, or the genomic changes that help microorganisms adapt in different environments. Sibelia will also be helpful for the evolutionary and genome rearrangement studies for multiple strains of microorganisms.</p><p>GSV (http://cas-bioinfo.cas.unt.edu/gsv/homepage.php)</p><p>Genome Synteny Viewer allows users to upload files which contain synteny regions between two or more genomes and interactively visualize the synteny between them. GSV also allows users to upload annotation files to visualize annotated regions in addition to synteny regions.</p><p>MicroSyn (http://www.lgm.upmc.fr/CHROnicle/SynChro.html)</p><p>MicroSyn software as a means of detecting microsynteny in adjacent genomic regions surrounding genes in gene families. MicroSyn searches for conserved, flanking colinear homologous gene pairs between two genomic fragments to determine the relationship between two members in a gene family.</p><p>SynOrth (http://synorth.genereg.net/)</p><p>Synorth [s n &ocirc;rth], named in combination of "synteny" and "ortholog", is designed for the study of evolutionary changes of genomic regulatory blocks (GRBs) in vertebrate genomes, and especially the changes following the whole-genome duplication in teleost fish, by tracing the ortholog genes gain and loss in ancient synteny blocks.</p><p>SyDiG (http://www.ncbi.nlm.nih.gov/pubmed/21441096)</p><p>Uncovering Synteny in Distant Genomes.</p><p>MapSynteny&nbsp; (http://www.automatizacionysistemas.com/download.html)</p><p>MapSynteny is a macro in MS Excel&reg; able to create images to show the relationship between genetic maps and large sequences (scaffolds, chromosomes, BACs, etc.). Based on tab &ndash; delimited BLAST results and some formulas, a suitable image of syntenic relationships or physical mapping can be obtained. http://www.automatizacionysistemas.com/Poster_MapSynteny.pdf</p><p>One of the best synteny tutorial for beginer @&nbsp;http://www.nature.com/scitable/topicpage/synteny-inferring-ancestral-genomes-44022</p><p>Reference:</p><p><a href="http://www.nature.com/scitable/topicpage/synteny-inferring-ancestral-genomes-44022">http://www.nature.com/scitable/topicpage/synteny-inferring-ancestral-genomes-44022</a></p><p><a href="http://www.nature.com/nature/journal/v491/n7424/full/nature11622.html">http://www.nature.com/nature/journal/v491/n7424/full/nature11622.html</a></p><p><a href="http://en.wikipedia.org/wiki/Synteny">http://en.wikipedia.org/wiki/Synteny</a></p><p><a href="http://www.ncbi.nlm.nih.gov/pmc/articles/PMC2675965/">http://www.ncbi.nlm.nih.gov/pmc/articles/PMC2675965/</a></p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>

</channel>
</rss>