<?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: All site bookmarks]]></title>
	<link>https://bioinformaticsonline.com/bookmarks/all?offset=890</link>
	<atom:link href="https://bioinformaticsonline.com/bookmarks/all?offset=890" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34088/sequence-evolution-function-computational-approaches-in-comparative-genomics</guid>
	<pubDate>Sun, 06 Aug 2017 06:58:12 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34088/sequence-evolution-function-computational-approaches-in-comparative-genomics</link>
	<title><![CDATA[Sequence - Evolution - Function; Computational Approaches in Comparative Genomics]]></title>
	<description><![CDATA[<p><em>Sequence - Evolution - Function</em><span>&nbsp;is an introduction to the computational approaches that play a critical role in the emerging new branch of biology known as functional genomics. The book provides the reader with an understanding of the principles and approaches of functional genomics and of the potential and limitations of computational and experimental approaches to genome analysis.</span></p><p>Address of the bookmark: <a href="https://www.ncbi.nlm.nih.gov/books/NBK20260/" rel="nofollow">https://www.ncbi.nlm.nih.gov/books/NBK20260/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34049/libsvm-a-library-for-support-vector-machines</guid>
	<pubDate>Wed, 02 Aug 2017 06:49:05 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34049/libsvm-a-library-for-support-vector-machines</link>
	<title><![CDATA[LIBSVM -- A Library for Support Vector Machines]]></title>
	<description><![CDATA[<p><strong>LIBSVM&nbsp;</strong>is an integrated software for support vector classification, (C-SVC,&nbsp;<a href="https://www.csie.ntu.edu.tw/~cjlin/libsvm/#nuandone">nu-SVC</a>), regression (epsilon-SVR,&nbsp;<a href="https://www.csie.ntu.edu.tw/~cjlin/libsvm/#nuandone">nu-SVR</a>) and distribution estimation (<a href="https://www.csie.ntu.edu.tw/~cjlin/libsvm/#nuandone">one-class SVM</a>). It supports multi-class classification.</p>
<p>Since version 2.8, it implements an SMO-type algorithm proposed in this paper:<br>R.-E. Fan, P.-H. Chen, and C.-J. Lin.&nbsp;<a href="https://www.csie.ntu.edu.tw/~cjlin/papers/quadworkset.pdf">Working set selection using second order information for training SVM</a>. Journal of Machine Learning Research 6, 1889-1918, 2005. You can also find a pseudo code there. (<a href="https://www.csie.ntu.edu.tw/~cjlin/libsvm/faq.html#f203">how to cite LIBSVM</a>)</p>
<p><span style="color: #ff0000;">Our goal is to help users from other fields to easily use SVM as a tool.&nbsp;</span><strong>LIBSVM&nbsp;</strong>provides a simple interface where users can easily link it with their own programs. Main features of&nbsp;<strong>LIBSVM</strong>&nbsp;include</p>
<ul>
<li>Different SVM formulations</li>
<li>Efficient multi-class classification</li>
<li>Cross validation for model selection</li>
<li>Probability estimates</li>
<li>Various kernels (including precomputed kernel matrix)</li>
<li>Weighted SVM for unbalanced data</li>
<li>Both C++ and&nbsp;<a href="https://www.csie.ntu.edu.tw/~cjlin/libsvm/#java">Java</a>&nbsp;sources</li>
<li><a href="https://www.csie.ntu.edu.tw/~cjlin/libsvm/#GUI">GUI</a>&nbsp;demonstrating SVM classification and regression</li>
<li><a href="https://www.csie.ntu.edu.tw/~cjlin/libsvm/#python">Python</a>,&nbsp;<a href="https://www.csie.ntu.edu.tw/~cjlin/libsvm/#R">R</a>,&nbsp;<a href="https://www.csie.ntu.edu.tw/~cjlin/libsvm/#matlab">MATLAB</a>,&nbsp;<a href="https://www.csie.ntu.edu.tw/~cjlin/libsvm/#perl">Perl</a>,&nbsp;<a href="https://www.csie.ntu.edu.tw/~cjlin/libsvm/#ruby">Ruby</a>,&nbsp;<a href="https://www.csie.ntu.edu.tw/~cjlin/libsvm/#weka">Weka</a>,&nbsp;<a href="https://www.csie.ntu.edu.tw/~cjlin/libsvm/#lisp">Common LISP</a>,&nbsp;<a href="https://www.csie.ntu.edu.tw/~cjlin/libsvm/#clisp">CLISP</a>,&nbsp;<a href="https://www.csie.ntu.edu.tw/~cjlin/libsvm/#haskell">Haskell</a>,&nbsp;<a href="https://www.csie.ntu.edu.tw/~cjlin/libsvm/#ocaml">OCaml</a>,&nbsp;<a href="https://www.csie.ntu.edu.tw/~cjlin/libsvm/#labview">LabVIEW</a>, and&nbsp;<a href="https://www.csie.ntu.edu.tw/~cjlin/libsvm/#PHP">PHP</a>&nbsp;interfaces.&nbsp;<a href="https://www.csie.ntu.edu.tw/~cjlin/libsvm/#csharp">C# .NET</a>&nbsp;code and&nbsp;<a href="https://www.csie.ntu.edu.tw/~cjlin/libsvm/#cuda">CUDA</a>&nbsp;extension is available.&nbsp;<br>It's also included in some data mining environments:&nbsp;<a href="http://rapid-i.com/">RapidMiner</a>,&nbsp;<a href="http://pcp.sourceforge.net/">PCP</a>, and&nbsp;<a href="http://lionoso.org/">LIONsolver</a>.</li>
<li>Automatic model selection which can generate contour of cross validation accuracy.</li>
<li></li>
</ul>
<p>https://www.csie.ntu.edu.tw/~cjlin/libsvm/</p><p>Address of the bookmark: <a href="https://www.csie.ntu.edu.tw/~cjlin/libsvm/" rel="nofollow">https://www.csie.ntu.edu.tw/~cjlin/libsvm/</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34041/r-tuorial</guid>
	<pubDate>Mon, 31 Jul 2017 08:41:40 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34041/r-tuorial</link>
	<title><![CDATA[R tuorial]]></title>
	<description><![CDATA[<p>R learning resources</p>
<p>https://flowingdata.com/</p><p>Address of the bookmark: <a href="https://flowingdata.com/" rel="nofollow">https://flowingdata.com/</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34038/quota-synteny-alignment</guid>
	<pubDate>Mon, 31 Jul 2017 04:11:57 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34038/quota-synteny-alignment</link>
	<title><![CDATA[Quota synteny alignment]]></title>
	<description><![CDATA[<p><span>Typically in comparative genomics, we can identify anchors, chain them into syntenic blocks and interpret these blocks as derived from a common descent. However, when comparing two genomes undergone ancient genome duplications (plant genomes in particular), we have large number of blocks that are not orthologous, but are paralogous. This has forced us sometimes to use&nbsp;</span><em>ad-hoc</em><span>&nbsp;rules to screen these blocks. So the question is:&nbsp;</span><span>given the expected depth (quota) along both x- and y-axis, select a subset of the anchors with maximized total score</span><span>.</span></p><p>Address of the bookmark: <a href="https://github.com/tanghaibao/quota-alignment" rel="nofollow">https://github.com/tanghaibao/quota-alignment</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/33983/web-apollo-a-web-based-genomic-annotation-editing-platform</guid>
	<pubDate>Fri, 28 Jul 2017 04:48:17 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/33983/web-apollo-a-web-based-genomic-annotation-editing-platform</link>
	<title><![CDATA[Web Apollo: a web-based genomic annotation editing platform]]></title>
	<description><![CDATA[<p><span>Web Apollo is the first instantaneous, collaborative genomic annotation editor available on the web. One of the natural consequences following from current advances in sequencing technology is that there are more and more researchers sequencing new genomes. These researchers require tools to describe the functional features of their newly sequenced genomes. With Web Apollo researchers can use any of the common browsers (for example, Chrome or Firefox) to jointly analyze and precisely describe the features of a genome in real time, whether they are in the same room or working from opposite sides of the world.</span></p><p>Address of the bookmark: <a href="http://genomearchitect.github.io/" rel="nofollow">http://genomearchitect.github.io/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/33976/goldgenomes-online-database</guid>
	<pubDate>Wed, 26 Jul 2017 07:49:29 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/33976/goldgenomes-online-database</link>
	<title><![CDATA[GOLD:Genomes Online Database]]></title>
	<description><![CDATA[<p><span>GOLD</span><span>:Genomes Online Database, is a World Wide Web resource for comprehensive access to information regarding genome and metagenome sequencing projects, and their associated metadata, around the world.</span></p>
<p>https://gold.jgi.doe.gov/</p><p>Address of the bookmark: <a href="https://gold.jgi.doe.gov/" rel="nofollow">https://gold.jgi.doe.gov/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/33960/mgra-breakpoint-graphs-and-ancestral-genome-reconstructions</guid>
	<pubDate>Tue, 25 Jul 2017 08:48:25 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/33960/mgra-breakpoint-graphs-and-ancestral-genome-reconstructions</link>
	<title><![CDATA[MGRA: Breakpoint graphs and ancestral genome reconstructions]]></title>
	<description><![CDATA[<p>MGRA (Multiple Genome Rearrangements and Ancestors) is a tool for reconstruction of ancestor genomes and evolutionary history of extant genomes.</p>
<p>It takes as an input a set of genomes represented as sequences of genes (or synteny blocks) and produces such sequences for ancestral genomes at the internal nodes of the phylogenetic tree.</p>
<p>The phylogenetic tree may be also specified completely or partially, in the latter case MGRA can reconstruct conserved ancestral regions (CARs) of the ancestral genome of interest.</p>
<p>Since version 2 MGRA supports gene insertion and deletions in addition to genome rearrangements and allows the input genomes to have different gene content.</p>
<p>It also can reconstruct most plausible phylogenetic tree based on the rearrangement characters.</p><p>Address of the bookmark: <a href="http://mgra.cblab.org/" rel="nofollow">http://mgra.cblab.org/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/33955/crocoblast-optimized-parallel-implementation-of-local-sequence-alignment-algorithms</guid>
	<pubDate>Tue, 25 Jul 2017 05:03:10 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/33955/crocoblast-optimized-parallel-implementation-of-local-sequence-alignment-algorithms</link>
	<title><![CDATA[CrocoBLAST: Optimized parallel implementation of local sequence alignment algorithms]]></title>
	<description><![CDATA[<p><span>Local sequence alignment is a cornerstone of bioinformatics, allowing to compare the amino-acid sequences of different proteins, or the nucleotide sequences of different pieces of DNA. The Basic Local Alignment Search Tool (BLAST) has revolutionized the field of bioinformatics, and is currently implemented in all free and commercial bioinformatics packages. However, with the advent of Next Generation Sequencing (NGS) and the development of new sequencing techniques, the utility of traditional BLAST implementations is limited. CrocoBLAST combines the accuracy and general applicability of BLAST with computational efficiency, accessibility, and user experience, so that NGS data can be analyzed efficiently even when only modest computational resources are available.</span></p>
<p>https://webchem.ncbr.muni.cz/Platform/App/CrocoBLAST</p><p>Address of the bookmark: <a href="https://webchem.ncbr.muni.cz/Platform/App/CrocoBLAST" rel="nofollow">https://webchem.ncbr.muni.cz/Platform/App/CrocoBLAST</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/33942/mulan-multiple-sequence-local-alignment-and-conservation-visualization-tool</guid>
	<pubDate>Thu, 20 Jul 2017 08:02:32 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/33942/mulan-multiple-sequence-local-alignment-and-conservation-visualization-tool</link>
	<title><![CDATA[Mulan: MUltiple sequence Local AligNment and conservation visualization tool]]></title>
	<description><![CDATA[<p><span>Mulan performs multiple (2 or more) sequence alignments with an efficient and rapid "full local" alignment strategy that ensures a recapitulation of evolutionary sequence rearrangements (such as inversions and reshuffling) in any of the species. It combines&nbsp;</span><a href="http://www.bx.psu.edu/miller_lab/" target="_new"><em>refine</em>&nbsp;and&nbsp;<em>tba</em></a><span>&nbsp;tools to align either "draft" or "finished" quality sequences. Mulan provides a dynamic graphical interface to align and visualize conservation profiles for evolutionarily distant and closely related species.</span><br><span></span></p>
<p><span>Input formats, automated data upload from the&nbsp;</span><a href="http://genome.ucsc.edu/" target="_new">UCSC Genome Browser</a><span>, gene annotation, annotation of repetitive elements, and progress report were previously described in the&nbsp;</span><a href="https://zpicture.dcode.org/zpInstructions.html" target="_zp">zPicture instructions</a><span>&nbsp;and we refer the users to these materials for more details. This introduction is mainly focused on some novel features unique to the Mulan.</span><span><br></span></p><p>Address of the bookmark: <a href="https://mulan.dcode.org/mulanInstructions.php" rel="nofollow">https://mulan.dcode.org/mulanInstructions.php</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/33924/figtree</guid>
	<pubDate>Wed, 19 Jul 2017 08:06:45 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/33924/figtree</link>
	<title><![CDATA[FigTree]]></title>
	<description><![CDATA[<p><span>FigTree is designed as a graphical viewer of phylogenetic trees and as a program for producing publication-ready figures. As with most of my programs, it was written for my own needs so may not be as polished and feature-complete as a commercial program. In particular it is designed to display summarized and annotated trees produced by BEAST.</span></p><p>Address of the bookmark: <a href="http://tree.bio.ed.ac.uk/software/figtree/" rel="nofollow">http://tree.bio.ed.ac.uk/software/figtree/</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>

</channel>
</rss>