<?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/31375?offset=90</link>
	<atom:link href="https://bioinformaticsonline.com/related/31375?offset=90" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/28891/lumpy</guid>
	<pubDate>Thu, 25 Aug 2016 08:05:02 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/28891/lumpy</link>
	<title><![CDATA[LUMPY]]></title>
	<description><![CDATA[<p>A probabilistic framework for structural variant discovery.</p>
<p>Ryan M Layer, Colby Chiang, Aaron R Quinlan, and Ira M Hall. 2014. "LUMPY: a Probabilistic Framework for Structural Variant Discovery." Genome Biology 15 (6): R84.&nbsp;<a href="http://dx.doi.org/10.1186/gb-2014-15-6-r84">doi:10.1186/gb-2014-15-6-r84</a>.</p>
<p>More at&nbsp;https://github.com/arq5x/lumpy-sv</p><p>Address of the bookmark: <a href="https://github.com/arq5x/lumpy-sv" rel="nofollow">https://github.com/arq5x/lumpy-sv</a></p>]]></description>
	<dc:creator>Shruti Paniwala</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/28922/ka-ks-and-kaks-calculations</guid>
	<pubDate>Mon, 29 Aug 2016 11:44:11 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/28922/ka-ks-and-kaks-calculations</link>
	<title><![CDATA[Ka, Ks and Ka/Ks calculations]]></title>
	<description><![CDATA[<p>gKaKs is a codon-based genome-level Ka/Ks computation pipeline developed and based on programs from four widely used packages: BLAT, BLASTALL (including bl2seq, formatdb and fastacmd), PAML (including codeml and yn00) and KaKs_Calculator (including 10 substitution rate estimation methods). gKaKs can automatically detect and eliminate frameshift mutations and premature stop codons to compute the substitution rates (Ka, Ks and Ka/Ks) between a well-annotated genome and a non-annotated genome or even a poorly assembled scaffold dataset. It is especially useful for newly sequenced genomes that have not been well annotated.&nbsp;</p>
<p>Look for KaKs calculation:</p>
<p>https://github.com/fumba/kaks-calculator</p>
<p>http://longlab.uchicago.edu/?q=gKaKs</p>
<p>http://www.ncbi.nlm.nih.gov/pubmed/23314322</p><p>Address of the bookmark: <a href="http://longlab.uchicago.edu/?q=gKaKs" rel="nofollow">http://longlab.uchicago.edu/?q=gKaKs</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/file/view/29108/assembly-tutorial-ppt</guid>
	<pubDate>Wed, 07 Sep 2016 03:12:53 -0500</pubDate>
	<link>https://bioinformaticsonline.com/file/view/29108/assembly-tutorial-ppt</link>
	<title><![CDATA[Assembly tutorial PPT]]></title>
	<description><![CDATA[<p>Saved Cornell University assembly workshop PPT.</p><p>Reference:&nbsp;</p><p>http://cbsu.tc.cornell.edu/lab/doc/assembly_workshop_20150420_lecture1.pdf</p>]]></description>
	<dc:creator>Jit</dc:creator>
	<enclosure url="https://bioinformaticsonline.com/file/download/29108" length="1617402" type="application/pdf" />
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29142/opera-optimal-paired-end-read-assembler</guid>
	<pubDate>Fri, 09 Sep 2016 05:28:58 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29142/opera-optimal-paired-end-read-assembler</link>
	<title><![CDATA[OPERA : Optimal Paired-End Read Assembler]]></title>
	<description><![CDATA[<p>OPERA (Optimal Paired-End Read Assembler) is a sequence assembly program (<a href="http://en.wikipedia.org/wiki/Sequence_assembly">http://en.wikipedia.org/wiki/Sequence_assembly</a>). It uses information from paired-end/mate-pair/long reads to order and orient the intermediate contigs/scaffolds assembled in a genome assembly project, in a process known as Scaffolding. OPERA is based on an exact algorithm that is guaranteed to minimize the discordance of scaffolds with the information provided by the paired-end/mate-pair/long reads (for further details see Gao et al, 2011).</p>
<p>Note that since the original publication, we have made significant changes to OPERA (v1.0 onwards) including refinements to its basic algorithm (to reduce local errors, improve efficiency etc.) and incorporated features that are important for scaffolding large genomes (multi-library support, better repeat-handling etc.), in addition to other scalability and usability improvements (bam and gzip support, smaller memory footprint). We therefore encourage you to download and use our latest version: OPERA-LG. In our benchmarks, it has significantly improved corrected N50 and reduced the number of scaffolding errors. Furthermore, our latest release contains the wrapper script OPERA-long-read that enables scaffolding with long-reads from third-generation sequencing technologies (PacBio or Oxford Nanopore). The manuscript describing the new features and algorithms is available at&nbsp;<a href="https://genomebiology.biomedcentral.com/articles/10.1186/s13059-016-0951-y">Genome Biology</a>. We look forward to getting your feedback to improve it further.</p><p>Address of the bookmark: <a href="https://sourceforge.net/p/operasf/wiki/The%20OPERA%20wiki/" rel="nofollow">https://sourceforge.net/p/operasf/wiki/The%20OPERA%20wiki/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29485/ribbon</guid>
	<pubDate>Fri, 21 Oct 2016 04:54:30 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29485/ribbon</link>
	<title><![CDATA[Ribbon !!]]></title>
	<description><![CDATA[<p><span>Visualization has played an extremely important role in the current genomic revolution to inspect and understand variants, expression patterns, evolutionary changes, and a number of other relationships. However, most of the information in read-to-reference or genome-genome alignments is lost for structural variations in the one-dimensional views of most genome browsers showing only reference coordinates. Instead, structural variations captured by long reads or assembled contigs often need more context to understand, including alignments and other genomic information from multiple chromosomes. We have addressed this problem by creating Ribbon (genomeribbon.com) an interactive online visualization tool that displays alignments along both reference and query sequences, along with any associated variant calls in the sample. This way Ribbon shows patterns in alignments of many reads across multiple chromosomes, while allowing detailed inspection of individual reads (Supplementary Note 1). For example, here we show a gene fusion in the SK-BR-3 breast cancer cell line linking the genes CYTH1 and EIF3H. While it has been found in the transcriptome previously, genome sequencing did not identify a direct chromosomal fusion between these two genes. After SMRT sequencing, Ribbon shows that there are indeed long reads that span from one gene to the other, going through not one but two variants, for the first time showing the genomic link between these two genes (Figure 1a). More gene fusions of this cancer cell line are investigated in Supplementary Note 2. Figure 1b shows another complex event in this sample made simple in Ribbon: the translocation of a 4.4 kb sequence deleted from chr19 and inserted into chr16 (Figure 1b). Thus, Ribbon enables understanding of complex variants, and it may also help in the detection of sequencing and sample preparation issues, testing of aligners and variant-callers, and rapid curation of structural variant candidates (Supplementary Note 3). In addition to SAM and BAM files with long, short, or paired-end reads, Ribbon can also load coordinate files from whole genome aligners such as MUMmer. Therefore, Ribbon can be used to test assembly algorithms or inspect the similarity between species. Supplementary Note 4 shows a comparison of gorilla and human genomes using Ribbon, highlighting major structural differences. In conclusion, Ribbon is a powerful interactive web tool for viewing complex genomic alignments.</span></p>
<p>Script at&nbsp;https://github.com/MariaNattestad/ribbon</p><p>Address of the bookmark: <a href="http://genomeribbon.com/" rel="nofollow">http://genomeribbon.com/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29586/eforgev12</guid>
	<pubDate>Fri, 28 Oct 2016 09:06:59 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29586/eforgev12</link>
	<title><![CDATA[eFORGE.v1.2]]></title>
	<description><![CDATA[<p><span>The eFORGE tool provides a method to view the tissue specific regulatory component of a set of EWAS DMPs. eFORGE analysis takes a set of DMPs, such as those hits above genome-wide significance threshold in an EWAS study, and analyses whether there is enrichment for overlap of putative functional elements compared to matched background DMPs. It assesses enrichment on a per cell type basis, since functional elements are differentially active in different cell types, and hence can expose tissue-specific signals of enrichment for the given test DMP set. This can reveal the sites of action underlying the EWAS signal, and provide confirmation of the validity of the EWAS where a tissue-specific mechanism is known or expected for the phenotype. Conversely unknown tissue involvements can also be revealed.</span></p><p>Address of the bookmark: <a href="http://eforge.cs.ucl.ac.uk/eFORGE.v1.2/?documentation" rel="nofollow">http://eforge.cs.ucl.ac.uk/eFORGE.v1.2/?documentation</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30153/e-mem-efficient-computation-of-maximal-exact-matches</guid>
	<pubDate>Thu, 15 Dec 2016 09:30:43 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30153/e-mem-efficient-computation-of-maximal-exact-matches</link>
	<title><![CDATA[E-MEM: Efficient computation of Maximal Exact Matches]]></title>
	<description><![CDATA[<p>E-MEM is a C++/OpenMP program designed to efficiently compute MEMs between large genomes. See the README file for instructions on how to use E-MEM.&nbsp;<br><br>E-MEM source code</p>
<p>The source code can be downloaded&nbsp;<a href="http://www.csd.uwo.ca/~ilie/E-MEM/e-mem.zip">here</a>.&nbsp;<br><br>If you use E-MEM, please cite:</p>
<ul>
<li>N. Khiste, L. Ilie, E-MEM: Efficient computation of Maximal Exact Matches for very large genomes,&nbsp;<a href="http://bioinformatics.oxfordjournals.org/content/31/4/509.short">Bioinformatics</a>&nbsp;<strong>31</strong>(4) (2015) 509 -- 514.</li>
</ul>
<p>For any questions, please contact Lucian Ilie:&nbsp;<a href="mailto:ilie@uwo.ca">ilie@uwo.ca</a>&nbsp;</p><p>Address of the bookmark: <a href="http://www.csd.uwo.ca/~ilie/E-MEM/" rel="nofollow">http://www.csd.uwo.ca/~ilie/E-MEM/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30304/mcscan</guid>
	<pubDate>Thu, 22 Dec 2016 03:53:58 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30304/mcscan</link>
	<title><![CDATA[MCscan]]></title>
	<description><![CDATA[<p><span>MCscan is a computer program that can simultaneously scan multiple genomes to identify homologous chromosomal regions and subsequently align these regions using genes as anchors. This is the toolset for generating the synteny correspondences in&nbsp;</span><a href="http://chibba.agtec.uga.edu/duplication">Plant Genome Duplication Database</a><span>. It is intended as an easy-to-use and quick way to identify conserved gene arrays both within the same genome and across different genomes.</span></p>
<p><span>More at&nbsp;http://chibba.agtec.uga.edu/duplication/mcscan/</span></p><p>Address of the bookmark: <a href="http://chibba.agtec.uga.edu/duplication/mcscan/" rel="nofollow">http://chibba.agtec.uga.edu/duplication/mcscan/</a></p>]]></description>
	<dc:creator>Bulbul</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30829/mercator</guid>
	<pubDate>Mon, 06 Feb 2017 04:20:36 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30829/mercator</link>
	<title><![CDATA[Mercator]]></title>
	<description><![CDATA[<p><span>Our basic strategy in building homology maps is to use exons that are orthologous in multiple genomes as map "anchors." Given K genomes, the steps in the map construction are as follows:</span></p>
<ul>
<li>For each genome, obtain a set of exon annotations. These annotations can be a combination of both exon predictions (e.g. Genscan) and annotations that have been experimentally verified (e.g. RefSeq). Ideally, we would like to have these annotations be as sensitive as possible. Specificity is not a concern, as incorrect annotations are not likely not have significant alignments with other gene annotations.</li>
<li>Compare all exons against all exons in other genomes and record significant alignments between exons. Currently, we use&nbsp;<a href="https://www.biostat.wisc.edu/~cdewey/mercator/#refBLAT">BLAT</a>&nbsp;to do this all-vs-all comparison with alignments being performed in protein space.</li>
<li>Construct a graph with each vertex corresponding to a exon and edges between vertices whose corresponding exons have significant alignments.</li>
<li>Identify cliques in this graph. These cliques are potential anchors to be used in the map.</li>
<li>Starting with the largest cliques (those that have exons in all or most of the genomes), join neighboring (adjacent in genomic coordinates, in each genome) cliques to form&nbsp;runs. Smaller cliques that are inconsistent with runs formed by larger cliques are filtered out. After the smallest cliques have been considered, cliques that are not part of a run are discarded.</li>
<li>The extents of each run in each genome are outputted as orthologous segments. The cliques from each run are used to output the exact genomic coordinates of anchors within each orthologous segment. These anchors can be used by genomic alignment programs (such as&nbsp;<a href="https://www.biostat.wisc.edu/~cdewey/mercator/#refMAVID">MAVID</a>) to do a detailed alignment of each orthologous segment.</li>
</ul>
<p>https://www.biostat.wisc.edu/~cdewey/mercator/</p><p>Address of the bookmark: <a href="https://www.biostat.wisc.edu/~cdewey/mercator/" rel="nofollow">https://www.biostat.wisc.edu/~cdewey/mercator/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41991/sequence-ontology-bioinformatics-analysis-soba-tool-to-provide-a-simple-statistical-and-graphical-summary-of-an-annotated-genome</guid>
	<pubDate>Wed, 22 Jul 2020 10:11:13 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41991/sequence-ontology-bioinformatics-analysis-soba-tool-to-provide-a-simple-statistical-and-graphical-summary-of-an-annotated-genome</link>
	<title><![CDATA[Sequence Ontology Bioinformatics Analysis (SOBA) tool to provide a simple statistical and graphical summary of an annotated genome]]></title>
	<description><![CDATA[<p><span>We have developed the Sequence Ontology Bioinformatics Analysis (SOBA) tool to provide a simple statistical and graphical summary of an annotated genome. We envisage its use during annotation jamborees, genome comparison and for use by developers for rapid feedback during annotation software development and testing. SOBA also provides annotation consistency feedback to ensure correct use of terminology within annotations, and guides users to add new terms to the Sequence Ontology when required. SOBA is available at http://www.sequenceontology.org/cgi-bin/soba.cgi.</span></p>
<p><span>More at <a href="https://pubmed.ncbi.nlm.nih.gov/20494974/">https://pubmed.ncbi.nlm.nih.gov/20494974/</a></span></p><p>Address of the bookmark: <a href="http://www.sequenceontology.org/cgi-bin/soba.cgi" rel="nofollow">http://www.sequenceontology.org/cgi-bin/soba.cgi</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>

</channel>
</rss>