<?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=140</link>
	<atom:link href="https://bioinformaticsonline.com/related/38039?offset=140" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44497/graphpath-a-graph-attention-model-for-molecular-stratification-with-interpretability-based-on-the-pathway-pathway-interaction-network</guid>
	<pubDate>Wed, 27 Mar 2024 20:51:21 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44497/graphpath-a-graph-attention-model-for-molecular-stratification-with-interpretability-based-on-the-pathway-pathway-interaction-network</link>
	<title><![CDATA[GraphPath: A graph attention model for molecular stratification with interpretability based on the pathway-pathway interaction network]]></title>
	<description><![CDATA[<p><span>Achieving accurate and interpretable clinical predictions requires paramount attention to thoroughly characterizing patients at both the molecular and biological pathway levels. In this paper, we present GraphPath, a biological knowledge-driven graph neural network with multi-head self-attention mechanism that implements the pathway-pathway interaction network. We train GraphPath to classify the cancer status of patients with prostate cancer based on their multi-omics profiling.</span></p>
<p><span><img src="https://github.com/amazingma/GraphPath/raw/main/Figures/GraphPath.png" alt="image" style="border: 0px;"></span></p><p>Address of the bookmark: <a href="https://github.com/amazingma/GraphPath" rel="nofollow">https://github.com/amazingma/GraphPath</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27333/satsuma-highly-sensitive-whole-genome-synteny-alignments</guid>
	<pubDate>Fri, 13 May 2016 05:25:26 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27333/satsuma-highly-sensitive-whole-genome-synteny-alignments</link>
	<title><![CDATA[SATSUMA : Highly sensitive whole-genome synteny alignments.]]></title>
	<description><![CDATA[<p>Satsuma is a whole-genome synteny alignment program. It takes two genomes, computes alignments, and then keeps only the parts that are orthologous, i.e. following the conserved order and orientation of features, such as protein coding genes, non-coding genes, or neutral sequences. Satsuma does not require any pre-processing, such as repeat masking, since it will automatically detect ambiguous mappings.<br> <br> Satsuma has parallelization built-in and is designed to run on multi-core architectures. The run-time for aligning two bird-size genomes (~1.2 Gb) is around two days on 24 CPUs. <br> <br> You can find the manual <a href="http://satsuma.sourceforge.net/manual.html">here</a>.<br> Download the latest source code from <a href="https://sourceforge.net/projects/satsuma/">here.</a><br> Stable versions can also be downloaded from the <a href="https://www.broadinstitute.org/science/programs/genome-biology/spines">Broad Institute's</a> web site.<br> <br> An incomplete list of questions and answers (yes, these have really been asked by our users! Please feel free to add your own by e-mailing us) is <a href="http://satsuma.sourceforge.net/faq.html">here</a>.<br> <br> If you use Satsuma in your research, please cite:<br> <a href="http://bioinformatics.oxfordjournals.org/content/26/9/1145.long">Grabherr, M. G., Russell, P., Meyer, M., Mauceli, E., Alf&ouml;ldi, J., Di Palma, F., &amp; Lindblad-Toh, K. (2010). Genome-wide synteny through highly sensitive sequence alignment: Satsuma. Bioinformatics, 26(9), 1145-51</a>.</p>
<p><strong>Tutorial at http://evomics.org/learning/genomics/satsuma/</strong></p><p>Address of the bookmark: <a href="http://satsuma.sourceforge.net/" rel="nofollow">http://satsuma.sourceforge.net/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32855/maf2synteny</guid>
	<pubDate>Thu, 18 May 2017 05:31:30 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32855/maf2synteny</link>
	<title><![CDATA[maf2synteny]]></title>
	<description><![CDATA[<p>A tool for converting for recovering synteny blocks from multiple alignment (in MAF fromat)</p>
<p>This tool is a standalone version of Ragout module [<a href="http://fenderglass.github./Ragout">http://fenderglass.github./Ragout</a>]</p><p>Address of the bookmark: <a href="https://github.com/fenderglass/maf2synteny" rel="nofollow">https://github.com/fenderglass/maf2synteny</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41694/mercator-multiple-whole-genome-orthology-map-construction</guid>
	<pubDate>Tue, 19 May 2020 16:46:22 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41694/mercator-multiple-whole-genome-orthology-map-construction</link>
	<title><![CDATA[Mercator: Multiple Whole-Genome Orthology Map Construction]]></title>
	<description><![CDATA[<p><span>Whole-genome homology maps attempt to identify the evolutionary relationships between and within multiple genomes. The term "syntenic" is often used to describe regions of multiple genomes that are believed to have evolved from the same region in an ancestral genome. However, it has been pointed out that this use of the term is incorrect (</span><a href="https://www.biostat.wisc.edu/~cdewey/mercator/#refSynteny">Passarge et al. 1999</a><span>) and thus we will use the terms "homologous", "orthologous", and "paralogous" instead. Ideally, given K genomes, we would like to identify all orthologous genomic regions as well as paralogous regions within each genome and hypothetical ancestral genome. Maps listing these relationships are extremely valuable to researchers performing comparative analyses of genomic sequence. Here we present our initial work in the form a program called&nbsp;</span><em>Mercator</em><span>&nbsp;that constructs orthology maps between multiple whole genomes.</span></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/39881/apollo-a-sequence-annotation-editor</guid>
	<pubDate>Tue, 27 Aug 2019 08:08:47 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39881/apollo-a-sequence-annotation-editor</link>
	<title><![CDATA[Apollo: a sequence annotation editor]]></title>
	<description><![CDATA[<p><span>The well-established inaccuracy of purely computational methods for annotating genome sequences necessitates an interactive tool to allow biological experts to refine these approximations by viewing and independently evaluating the data supporting each annotation. Apollo was developed to meet this need, enabling curators to inspect genome annotations closely and edit them</span></p><p>Address of the bookmark: <a href="https://genomebiology.biomedcentral.com/articles/10.1186/gb-2002-3-12-research0082" rel="nofollow">https://genomebiology.biomedcentral.com/articles/10.1186/gb-2002-3-12-research0082</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42148/chromatiblock-scalable-whole-genome-visualisation-of-structural-changes-in-prokaryotes</guid>
	<pubDate>Sat, 22 Aug 2020 05:17:18 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42148/chromatiblock-scalable-whole-genome-visualisation-of-structural-changes-in-prokaryotes</link>
	<title><![CDATA[chromatiblock: Scalable, whole-genome visualisation of structural changes in prokaryotes]]></title>
	<description><![CDATA[<p>To create a fresh environment for chromatiblock to run in do:</p>
<pre><code>conda create --name chromatiblock
conda activate chromatiblock
conda install chromatiblock --channel conda-forge --channel bioconda
</code></pre>
<p>Then in future to run chromatiblock you can reactivate this environemtn using&nbsp;<code>conda activate chromatiblock</code></p>
<h4><a href="https://github.com/mjsull/chromatiblock#direct-download"></a>Direct download:</h4>
<p>Alternatively you can download and run the script from&nbsp;<a href="https://github.com/mjsull/chromatiblock/releases/download/v0.4.1/chromatiblock">here</a>.</p><p>Address of the bookmark: <a href="https://github.com/mjsull/chromatiblock" rel="nofollow">https://github.com/mjsull/chromatiblock</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/26852/awesome-bioinformatics-pipelines</guid>
	<pubDate>Wed, 30 Mar 2016 21:50:41 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/26852/awesome-bioinformatics-pipelines</link>
	<title><![CDATA[Awesome bioinformatics pipelines !]]></title>
	<description><![CDATA[<p><span>A curated list of awesome pipeline toolkits ...</span></p>
<p><span>https://github.com/pditommaso/awesome-pipeline</span></p><p>Address of the bookmark: <a href="https://github.com/pditommaso/awesome-pipeline" rel="nofollow">https://github.com/pditommaso/awesome-pipeline</a></p>]]></description>
	<dc:creator>Jitendra Prajapati</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38747/seqkit-a-cross-platform-and-ultrafast-toolkit-for-fastaq-file-manipulation</guid>
	<pubDate>Sun, 20 Jan 2019 06:18:32 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38747/seqkit-a-cross-platform-and-ultrafast-toolkit-for-fastaq-file-manipulation</link>
	<title><![CDATA[SeqKit - a cross-platform and ultrafast toolkit for FASTA/Q file manipulation]]></title>
	<description><![CDATA[<p><span>FASTA and FASTQ are basic and ubiquitous formats for storing nucleotide and protein sequences. Common manipulations of FASTA/Q file include converting, searching, filtering, deduplication, splitting, shuffling, and sampling. Existing tools only implement some of these manipulations, and not particularly efficiently, and some are only available for certain operating systems. Furthermore, the complicated installation process of required packages and running environments can render these programs less user friendly.</span></p><p>Address of the bookmark: <a href="https://bioinf.shenwei.me/seqkit/usage/" rel="nofollow">https://bioinf.shenwei.me/seqkit/usage/</a></p>]]></description>
	<dc:creator>BioJoker</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41475/proteoclade-a-taxonomic-toolkit-for-multi-species-and-metaproteomic-analysis</guid>
	<pubDate>Wed, 18 Mar 2020 14:27:20 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41475/proteoclade-a-taxonomic-toolkit-for-multi-species-and-metaproteomic-analysis</link>
	<title><![CDATA[ProteoClade: A taxonomic toolkit for multi-species and metaproteomic analysis]]></title>
	<description><![CDATA[<p>ProteoClade is a Python library for&nbsp;<span>taxonomic-based annotation and quantification of bottom-up proteomics data</span>. It is designed to be user-friendly, and has been optimized for speed and storage requirements.</p>
<p>ProteoClade helps you analyze two general categories of experiments:</p>
<ol>
<li>
<p><span><em>Targeted Database</em>&nbsp;Searches:</span>&nbsp;Experiments in which a limited number of species are defined ahead of time, such as those involving Patient-Derived Xenografts (PDXs) or host-pathogen interactions. Reference protein sequence databases are used for targeted searches (ex: using Mascot, MaxQuant).</p>
</li>
<li>
<p><span><em>De Novo</em>&nbsp;Searches:</span>&nbsp;Experiments in which the organisms are unspecified ahead of time or involve samples of high taxonomic complexity. Mass spectra are analyzed in the absence of a reference database (ex: using PEAKS, PepNovo).</p>
</li>
</ol>
<p>ProteoClade scales from two organisms to every organism in UniProt. Please&nbsp;<a href="https://proteoclade.readthedocs.io/">refer to the complete documentation at proteoclade.readthedocs.io</a>&nbsp;for installation, a user's guide, and examples.</p>
<p><a href="https://journals.plos.org/ploscompbiol/article?id=10.1371/journal.pcbi.1007741">https://journals.plos.org/ploscompbiol/article?id=10.1371/journal.pcbi.1007741</a></p><p>Address of the bookmark: <a href="https://github.com/HeldLab/ProteoClade" rel="nofollow">https://github.com/HeldLab/ProteoClade</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>

</channel>
</rss>