<?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/40531?offset=720</link>
	<atom:link href="https://bioinformaticsonline.com/related/40531?offset=720" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/7387/bioinformatics-software-for-biologists-in-the-genomics-era</guid>
	<pubDate>Sun, 22 Dec 2013 17:31:05 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/7387/bioinformatics-software-for-biologists-in-the-genomics-era</link>
	<title><![CDATA[Bioinformatics software for biologists in the genomics era]]></title>
	<description><![CDATA[<p>The genome sequencing revolution is approaching a landmark figure of 1000 completely sequenced genomes. Coupled with fast-declining, per-base sequencing costs, this influx of DNA sequence data has encouraged laboratory scientists to engage large datasets in comparative sequence analyses for making evolutionary, functional and translational inferences. However, the majority of the scientists at the forefront of experimental research are not bioinformaticians, so a gap exists between the user-friendly software needed and the scripting/programming infrastructure often employed for the analysis of large numbers of genes, long genomic segments and groups of sequences. We see an urgent need for the expansion of the fundamental paradigms under which biologist-friendly software tools are designed and developed to fulfill the needs of biologists to analyze large datasets by using sophisticated computational methods. We argue that the design principles need to be sensitive to the reality that comparatively small teams of biologists have historically developed some of the most popular biological software packages in molecular evolutionary analysis. Furthermore, biological intuitiveness and investigator empowerment need to take precedence over the current supposition that biologists should re-tool and become programmers when analyzing genome scale datasets.</p><p>Address of the bookmark: <a href="http://bioinformatics.oxfordjournals.org/content/23/14/1713.full" rel="nofollow">http://bioinformatics.oxfordjournals.org/content/23/14/1713.full</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/17924/software-developed-in-pevsner-lab</guid>
	<pubDate>Mon, 06 Oct 2014 12:41:26 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/17924/software-developed-in-pevsner-lab</link>
	<title><![CDATA[Software developed in pevsner lab]]></title>
	<description><![CDATA[<div>
<div id="block-system-main">
<div>
<div id="node-7">
<div>
<div>
<div>
<div>
<p><a href="http://pevsnerlab.kennedykrieger.org/dragon.htm">DRAGON</a>: Database Referencing of Array Genes Online</p>
<p><a href="http://pevsnerlab.kennedykrieger.org/php/node/96">SNOMAD</a>: Standardization and Normalization of Microarray Data</p>
<p><a href="http://pevsnerlab.kennedykrieger.org/php/node/70">SNPduo</a>: SNP Analysis Between Two Individuals</p>
<p><a href="http://pevsnerlab.kennedykrieger.org/php/node/71">SNPtrio</a>: Analyzing and Visualizing and Inheritance Patterns in Trios</p>
<p><a href="http://pevsnerlab.kennedykrieger.org/php/node/64">SNPscan</a>: Data Analysis and Visualization of SNP Data</p>
<p><a href="http://pevsnerlab.kennedykrieger.org/php/node/64">pediSNP</a>: Analyze SNP Data From a Pedigree of Two Generations</p>
<p><a href="http://pevsnerlab.kennedykrieger.org/php/node/73">kcoeff</a>: Calculate Cotterman Coefficients of SNP Genotype Data</p>
<p><a href="http://pevsnerlab.kennedykrieger.org/php/node/113">triPOD:</a> Detects chromosomal abnormalities in parent-child trio-based microarray data</p>
</div>
</div>
</div>
</div>
</div>
</div>
</div>
</div><p>Address of the bookmark: <a href="http://pevsnerlab.kennedykrieger.org/php/?q=software" rel="nofollow">http://pevsnerlab.kennedykrieger.org/php/?q=software</a></p>]]></description>
	<dc:creator>Robert M Willioms</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27465/stand-alone-programs-for-bioinformatician</guid>
	<pubDate>Sat, 21 May 2016 22:50:15 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27465/stand-alone-programs-for-bioinformatician</link>
	<title><![CDATA[Stand-alone programs for Bioinformatician]]></title>
	<description><![CDATA[<p>This directory contains applications for stand-alone use, built specifically for a Linux 64-bit machine.</p>
<p>For help on the bigBed and bigWig applications see:<br>http://genome.ucsc.edu/goldenPath/help/bigBed.html<br>http://genome.ucsc.edu/goldenPath/help/bigWig.html</p>
<p>View the file 'FOOTER' to see the usage statement for each of the applications.</p><p>Address of the bookmark: <a href="http://hgdownload.cse.ucsc.edu/admin/exe/linux.x86_64/" rel="nofollow">http://hgdownload.cse.ucsc.edu/admin/exe/linux.x86_64/</a></p>]]></description>
	<dc:creator>Radha Agarkar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30336/finding-patterns-in-biological-sequences</guid>
	<pubDate>Thu, 22 Dec 2016 10:30:49 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30336/finding-patterns-in-biological-sequences</link>
	<title><![CDATA[Finding Patterns in Biological Sequences]]></title>
	<description><![CDATA[<p>In this report we provide an overview of known techniques for discovery of patterns of biological sequences (DNA and proteins). We also provide biological motivation, and methods of biological verification of such patterns. Finally we list publicly available tools and databases for pattern discovery. On-line supplement is available through http://genetics.uwaterloo.ca/&sim;tvinar/cs798g/motif.</p><p>Address of the bookmark: <a href="http://engr.case.edu/li_jing/papers/00798gpattern.pdf" rel="nofollow">http://engr.case.edu/li_jing/papers/00798gpattern.pdf</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/35802/bioinformatics-tools-to-detect-horizontal-gene-transfer-hgt-in-genomes</guid>
	<pubDate>Fri, 02 Mar 2018 04:56:23 -0600</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/35802/bioinformatics-tools-to-detect-horizontal-gene-transfer-hgt-in-genomes</link>
	<title><![CDATA[Bioinformatics tools to detect horizontal gene transfer (HGT) in genomes]]></title>
	<description><![CDATA[<p>Horizontal gene transfer (HGT), the &ldquo;non-sexual movement of genetic material between two organisms&rdquo; , is relatively common in prokaryotes&nbsp;and single-celled eukaryotes, but a number of factors combine to make it far rarer in multicellular eukaryotes. In order for a eukaryotic species to gain a gene by HGT, foreign DNA must enter the host nucleus, integrate into the genome, and in more complex organisms it must enter the sequestered germline in order to be transmitted to offspring. Once there, it must not experience strong negative selection, despite potential for genetic incompatibility with the host genome and mismatch between the niche of the donor and the host. Over the longer term, foreign DNA may become &ldquo;domesticated&rdquo; in the recipient genome and provide novel function.</p><p>Following are the popular tool to detect HGT in genomes:</p><p><a href="http://www.trex.uqam.ca/index.php?action=hgt&amp;project=trex">T-REX</a>&nbsp;/&nbsp;<a href="http://www.trex.uqam.ca/download/hgt-detection_3.22.zip">3.22</a></p><p>HGT detection /&nbsp;download &amp; compile</p><p><a href="https://www.ncbi.nlm.nih.gov/pubmed/20525630">20525630</a></p><p>&nbsp;</p><p><a href="http://compbio.engr.uconn.edu/software/RANGER-DTL/">RANGER-DTL</a>&nbsp;/&nbsp;<a href="http://compbio.engr.uconn.edu/software/RANGER-DTL/Linux.zip">2.0</a></p><p>HGT detection /&nbsp;download binary</p><p><a href="https://www.ncbi.nlm.nih.gov/pubmed/22689773">22689773</a></p><p>&nbsp;</p><p><a href="https://bioinfocs.rice.edu/phylonet">PhyloNet</a>&nbsp;/&nbsp;<a href="https://bioinfocs.rice.edu/sites/g/files/bxs266/f/kcfinder/files/PhyloNet_3.6.1.jar">3.6.1</a></p><p>HGT detection /&nbsp;download binary</p><p><a href="https://www.ncbi.nlm.nih.gov/pubmed/18662388">18662388</a></p><p>&nbsp;</p><p><a href="https://www.cs.hmc.edu/~hadas/jane/index.html">Jane</a>&nbsp;/&nbsp;<a href="https://www.cs.hmc.edu/~hadas/jane/form.html">4.01</a></p><p>HGT detection /&nbsp;download binary (!license!)</p><p><a href="https://www.ncbi.nlm.nih.gov/pubmed/20181081">20181081</a></p><p>&nbsp;</p><p><a href="http://www.tree-puzzle.de/">TREE-PUZZLE</a>&nbsp;/&nbsp;<a href="http://www.tree-puzzle.de/tree-puzzle-5.3.rc16-linux.tar.gz">5.3.rc16</a></p><p>HGT detection /&nbsp;download &amp; compile</p><p><a href="https://www.ncbi.nlm.nih.gov/pubmed/11934758">11934758</a></p><p>&nbsp;</p><p><a href="http://www.sigmath.es.osaka-u.ac.jp/shimo-lab/prog/consel/">CONSEL</a>&nbsp;/&nbsp;<a href="http://www.sigmath.es.osaka-u.ac.jp/shimo-lab/prog/consel/pub/cnsls020.tgz">0.20</a></p><p>HGT detection /&nbsp;download</p><p><a href="https://www.ncbi.nlm.nih.gov/pubmed/11751242">11751242</a></p><p>&nbsp;</p><p><a href="http://darkhorse.ucsd.edu/">DarkHorse</a>&nbsp;/&nbsp;<a href="http://darkhorse.ucsd.edu/DarkHorse-1.5_rev170.tar.gz">1.5 rev170</a></p><p>HGT detection /&nbsp;download &amp; install</p><p><a href="https://www.ncbi.nlm.nih.gov/pubmed/17274820">17274820</a></p><p>&nbsp;</p><p><a href="https://github.com/DittmarLab/HGTector">HGTector</a>&nbsp;/&nbsp;<a href="https://github.com/DittmarLab/HGTector/archive/wgshgt.zip">0.2.1</a></p><p>HGT detection /&nbsp;git clone</p><p><a href="https://www.ncbi.nlm.nih.gov/pubmed/25159222">25159222</a></p><p>&nbsp;</p><p><a href="http://www5.esu.edu/cpsc/bioinfo/software/EGID/">EGID</a>&nbsp;/&nbsp;<a href="http://www5.esu.edu/cpsc/bioinfo/software/EGID/EGID_1.0.tar.gz">1.0</a></p><p>HGT detection /&nbsp;download</p><p><a href="https://www.ncbi.nlm.nih.gov/pubmed/22355228">22355228</a></p><p>&nbsp;</p><p><a href="http://exon.gatech.edu/GeneMark/">GeneMarkS</a>&nbsp;/&nbsp;<a href="http://exon.gatech.edu/GeneMark/license_download.cgi">4.30</a></p><p>HGT detection / download binary (!license!)</p><p><a href="https://www.ncbi.nlm.nih.gov/pubmed/9461475">9461475</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/36392/protein-protein-interaction-sites-predictions</guid>
	<pubDate>Wed, 25 Apr 2018 04:53:20 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/36392/protein-protein-interaction-sites-predictions</link>
	<title><![CDATA[Protein-Protein Interaction Sites Predictions !]]></title>
	<description><![CDATA[<p><span>The study of Protein&ndash;Protein Interactions (PPIs) has a crucial role in biology, medicine and the pharmaceutical industry. PPIs can be investigated from two aspects: The interaction partners of a specific protein and the amino acid residues participating in a given PPI. Information about a protein&rsquo;s interaction partners allows scientists to construct protein interaction networks, such as signaling pathways, which in turn facilitate the understanding of many biological and clinical observations.&nbsp;</span></p><p><span>Following are the list of tools commonly used to PPIs predictions:</span></p><p>Protein-Protein Interaction Sites</p><p><a href="http://pipe.scs.fsu.edu/ppisp.html" target="_blank">PPISP</a></p><p>A consensus neural network method for predicting protein-protein interaction sites</p><p><a href="http://biunit.naist.jp/homcos/" target="_blank">HOMCOS</a></p><p>A server to predict interacting protein pairs and interacting sites by homology modeling of complex structures</p><p><a href="http://prism.ccbb.ku.edu.tr/hotpoint/" target="_blank">HotPOINT</a></p><p>Prediction of protein interfaces using an empirical model</p><p><a href="http://cubic.bioc.columbia.edu/services/isis/" target="_blank">ISIS</a></p><p>Prediction of interaction hotspots from sequence</p><p><a href="http://kfc.mitchell-lab.org/" target="_blank">KFC server</a></p><p>Automated decision-tree approach to predicting protein-protein interaction hot spots</p><p><a href="http://pipe.scs.fsu.edu/meta-ppisp.html" target="_blank">meta-PPISP</a></p><p>A meta server for predicting protein-protein interaction sites. meta-PPISP is built on three individual web servers:&nbsp;<a href="https://bip.weizmann.ac.il/toolbox/structure/binding.htm#cons">cons-PPISP</a>,&nbsp;<a href="https://bip.weizmann.ac.il/toolbox/structure/binding.htm#pin">PINUP</a>, and&nbsp;<a href="https://bip.weizmann.ac.il/toolbox/structure/binding.htm#pro">Promate</a></p><p><a href="http://www.molsoft.com/oda.html" target="_blank">ODA</a></p><p>Identification of optimal surface patches with the lowest docking desolvation energy values</p><p><a href="http://sparks.informatics.iupui.edu/PINUP/" target="_blank">PINUP</a></p><p>Protein binding site prediction with an empirical scoring function</p><p>Other Sites (DNA, RNA, Metals)</p><p><a href="http://ligin.weizmann.ac.il/~lpgerzon/mbs4/mbs.cgi" target="_blank">CHED</a>&nbsp;</p><p>Web server for predicting soft metal binding sites in proteins</p><p><a href="http://cssb.biology.gatech.edu/skolnick/webservice/DBD-Hunter/" target="_blank">DBD-Hunter</a></p><p>A knowledge-based method for the prediction of DNA-protein interactions</p><p><a href="http://pipe.scs.fsu.edu/displar.html" target="_blank">DISPLAR</a></p><p>Given the structure of a protein known to bind DNA, the method predicts residues that contact DNA using neural network method</p><p><a href="http://idbps.tau.ac.il/" target="_blank">iDBPs</a></p><p>Predicts DNA binding proteins for proteins with known 3D structure.</p><p><a href="http://pfp.technion.ac.il/" target="_blank">PFplus</a></p><div style="text-align: left;">A tool for extracting and displaying positive electrostatic patches on protein surfaces which can be indicative of nucleic acid binding interfaces.</div>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36508/mitobim-mitochondrial-baiting-and-iterative-mapping</guid>
	<pubDate>Tue, 08 May 2018 04:15:25 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36508/mitobim-mitochondrial-baiting-and-iterative-mapping</link>
	<title><![CDATA[MITObim - mitochondrial baiting and iterative mapping]]></title>
	<description><![CDATA[<p>This document contains instructions on how to use the MITObim pipeline described in Hahn et al. 2013. The full article can be found&nbsp;<a href="http://nar.oxfordjournals.org/content/41/13/e129" title="MITObim full article at NAR">here</a>. Kindly cite the article if you are using MITObim in your work. The pipeline was originally developed for&nbsp;<span>Illumina</span>&nbsp;data, but thanks to the versatility of the MIRA assembler, MITObim supports in principle also data from the&nbsp;<span>Iontorrent</span>,&nbsp;<span>454</span>&nbsp;and&nbsp;<span>PacBio</span>&nbsp;sequencing platforms.</p>
<p>Below you can find a few basic tutorials for how to run MITObim and I encorage you to give them a try with the testdata that comes with this Repo, just to make sure everything is running smoothly on your system. It'll only take a few minutes and will potentially safe you a lot of time down the line.</p>
<p>I provide further examples&nbsp;<a href="https://github.com/chrishah/MITObim/tree/master/examples">here</a>&nbsp;as Jupyter notebooks. Get in touch if you feel like sharing your particular MITObim solution and I'd be happy to put it up here, too!</p><p>Address of the bookmark: <a href="https://github.com/chrishah/MITObim" rel="nofollow">https://github.com/chrishah/MITObim</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43546/introduction-to-phylogenies-in-r</guid>
	<pubDate>Wed, 13 Oct 2021 02:27:21 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43546/introduction-to-phylogenies-in-r</link>
	<title><![CDATA[Introduction to phylogenies in R]]></title>
	<description><![CDATA[<p><span>R phylogenetics is built on the contributed packages for phylogenetics in R, and there are many such packages. Let's begin today by installing a few critical packages, such as ape, phangorn, phytools, and geiger. To get the most recent CRAN version of these packages, you will need to have R 3.3.x installed on your computer!</span></p><p>Address of the bookmark: <a href="http://www.phytools.org/Cordoba2017/ex/2/Intro-to-phylogenies.html" rel="nofollow">http://www.phytools.org/Cordoba2017/ex/2/Intro-to-phylogenies.html</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/44002/interesting-bioinformatics-resources</guid>
	<pubDate>Fri, 11 Nov 2022 06:30:46 -0600</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/44002/interesting-bioinformatics-resources</link>
	<title><![CDATA[Interesting Bioinformatics Resources !]]></title>
	<description><![CDATA[<p>1. a reproducible workflow.&nbsp;<a href="https://www.youtube.com/watch?v=s3JldKoA0zw">https://www.youtube.com/watch?v=s3JldKoA0zw</a>&nbsp;This two minute video will change your mind on reproducible research&nbsp;</p><p>2. Parallel sequencing lives, or what makes large sequencing projects successful&nbsp;<a href="https://academic.oup.com/gigascience/article/6/11/gix100/4557140?login=false">https://academic.oup.com/gigascience/article/6/11/gix100/4557140?login=false</a></p><p>3. Common-sense approaches to sharing tabular data alongside publication&nbsp;<a href="https://www.sciencedirect.com/science/article/pii/S2666389921002300">https://www.sciencedirect.com/science/article/pii/S2666389921002300</a></p><p>4. A Reproducible Data Analysis Workflow with R Markdown, Git, Make, and Docker&nbsp;<a href="https://psyarxiv.com/8xzqy/">https://psyarxiv.com/8xzqy/</a></p><p>5. Practical Computational Reproducibility in the Life Sciences&nbsp;<a href="https://www.cell.com/cell-systems/fulltext/S2405-4712(18)30140-6">https://www.cell.com/cell-systems/fulltext/S2405-4712(18)30140-6</a></p><p>6. A video by Dr.Keith A. Baggerly from MD Anderson [The Importance of Reproducible Research in High-Throughput Biology](<a href="https://www.youtube.com/watch?v=7gYIs7uYbMo">https://www.youtube.com/watch?v=7gYIs7uYbMo</a>) highly recommended.</p><p>7. Ten Simple Rules for Reproducible Computational Research&nbsp;<a href="http://journals.plos.org/ploscompbiol/article?id=10.1371/journal.pcbi.1003285">http://journals.plos.org/ploscompbiol/article?id=10.1371/journal.pcbi.1003285</a>)</p><p>8. Good Enough Practices in Scientific Computing&nbsp;<a href="http://arxiv.org/abs/1609.00037">http://arxiv.org/abs/1609.00037</a>&nbsp;</p><p>9. Best Practices for Scientific Computing&nbsp;<a href="https://journals.plos.org/plosbiology/article?id=10.1371/journal.pbio.1001745">https://journals.plos.org/plosbiology/article?id=10.1371/journal.pbio.1001745</a></p><p>10. A Quick Guide to Organizing Computational Biology Projects&nbsp;<a href="http://journals.plos.org/ploscompbiol/article?id=10.1371/journal.pcbi.100042">http://journals.plos.org/ploscompbiol/article?id=10.1371/journal.pcbi.100042</a>&nbsp; A must read for computational biologists!</p><p>11. Reproducibility of computational workflows is automated using continuous analysis&nbsp;<a href="https://www.nature.com/articles/nbt.3780">https://www.nature.com/articles/nbt.3780</a></p><p>12. Five selfish reasons to work reproducibly&nbsp;<a href="https://genomebiology.biomedcentral.com/articles/10.1186/s13059-015-0850-7">https://genomebiology.biomedcentral.com/articles/10.1186/s13059-015-0850-7</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/44618/important-bioinformatics-tools</guid>
	<pubDate>Tue, 30 Jul 2024 05:03:29 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/44618/important-bioinformatics-tools</link>
	<title><![CDATA[Important Bioinformatics Tools !]]></title>
	<description><![CDATA[<p><span>1. Ktrim: An extra-fast, accurate adapter trimmer for sequencing data. It processes FASTQ files from multiple lanes with minimal mismatching and over-trimming of adapters.</span><span><br /></span><span><br /></span><span>2. BWA MEM: A reliable alignment tool (particularly for mapping ALT contigs and HLA genes, which are not fully addressed in BWA-MEM2).</span><span><br /></span><span><br /></span><span>3. Sambamba markdup: Quickly marks or removes duplicate reads using Picard's criteria.</span><span><br /></span><span><br /></span><span>4. ichorCNA: Estimates the tumor DNA fraction in cell-free DNA from ultra-low-pass whole genome sequencing (0.1x coverage) based on copy number alterations (CNA).</span><span><br /></span><span><br /></span><span>5. Fragle: A deep learning method for quantifying ctDNA levels from cell-free DNA fragmentomic profiles. It detects TF as low as ~1% ctDNA and works with targeted genomic panel sequencing data.</span><span><br /></span><span><br /></span><span>6. AlfredQC: A quality control tool for high-throughput sequencing data. It assesses metrics like read quality scores, GC content, and duplication rates, visualized through detailed plots and summary statistics.</span><span><br /></span><span><br /></span><span>7. Mosdepth: A fast tool for calculating sequencing coverage depth, offering a quicker alternative to samtools/sambamba depth by processing BAM and CRAM files.</span><span><br /></span><span><br /></span><span>8. Bedtools: A versatile toolkit for genomics, enabling operations like intersect, merge, count, and shuffle on genomic intervals across formats such as BAM, BED, GFF/GTF, and VCF.</span><span><br /></span><span><br /></span><span>9. Datamash: A command-line tool for basic numeric, textual, and statistical operations on input data streams. It supports operations such as grouping, sorting, transposing, and performing arithmetic calculations on tabular data.</span><span><br /></span><span><br /></span><span>10.</span><span> </span><a href="http://gwf.app/" target="_self">gwf.app</a><span>: A pragmatic alternative to Snakemake. Developed at</span><span> </span><a href="https://www.linkedin.com/company/aarhus-university-denmark-/" target="_self"><span>Aarhus University</span></a><span>, this flexible, generic workflow tool builds and runs large scientific workflows.</span></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>

</channel>
</rss>