<?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/44628?offset=270</link>
	<atom:link href="https://bioinformaticsonline.com/related/44628?offset=270" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/43084/frequently-used-bioinformatics-tools-for-viral-genome-analysis</guid>
	<pubDate>Wed, 23 Jun 2021 07:40:41 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/43084/frequently-used-bioinformatics-tools-for-viral-genome-analysis</link>
	<title><![CDATA[Frequently used bioinformatics tools for viral genome analysis !]]></title>
	<description><![CDATA[<p><strong>IVA: accurate de novo assembly of RNA virus genomes.</strong><br /> Hunt M, Gall A, Ong SH, Brener J, Ferns B, Goulder P, Nastouli E, Keane JA, Kellam P, Otto TD.<br /> Bioinformatics. 2015 Jul 15;31(14):2374-6. doi: <a href="http://bioinformatics.oxfordjournals.org/content/31/14/2374.long">10.1093/bioinformatics/btv120</a>. Epub 2015 Feb 28.</p><p><a href="http://www.nature.com/nmeth/journal/v9/n1/full/nmeth.1814.html"><strong>Adapter sequences</strong></a>:<br /> <strong>Optimal enzymes for amplifying sequencing libraries.</strong><br /> Quail, M. a et al. Nat. Methods 9, 10-1 (2012).</p><p><a href="http://genome.cshlp.org/content/early/2012/01/12/gr.131383.111"><strong>GAGE</strong></a>:<br /> <strong>GAGE: A critical evaluation of genome assemblies and assembly algorithms.</strong><br /> Salzberg, S. L. et al. Genome Res. 22, 557-67 (2012).</p><p><a href="http://www.biomedcentral.com/1471-2105/14/160"><strong>KMC</strong></a>:<br /> <strong>Disk-based k-mer counting on a PC.</strong><br /> Deorowicz, S., Debudaj-Grabysz, A. &amp; Grabowski, S. BMC Bioinformatics 14, 160 (2013).</p><p><a href="http://genomebiology.com/2014/15/3/R46"><strong>Kraken</strong></a>:<br /> <strong>Kraken: ultrafast metagenomic sequence classification using exact alignments.</strong><br /> Wood, D. E. &amp; Salzberg, S. L. Genome Biol. 15, R46 (2014).</p><p><a href="http://genomebiology.com/2004/5/2/r12"><strong>MUMmer</strong></a>:<br /> <strong>Versatile and open software for comparing large genomes.</strong><br /> Kurtz, S. et al. Genome Biol. 5, R12 (2004).</p><p><strong>R</strong>:<br /> <strong>R: A language and environment for statistical computing.</strong><br /> R Core Team (2013). R Foundation for Statistical Computing, Vienna, Austria. URL <a href="http://www.R-project.org/">http://www.R-project.org/</a>.</p><p><a href="http://nar.oxfordjournals.org/content/39/9/e57"><strong>RATT</strong></a>:<br /> <strong>RATT: Rapid Annotation Transfer Tool.</strong><br /> Otto, T. D., Dillon, G. P., Degrave, W. S. &amp; Berriman, M. Nucleic Acids Res. 39, e57 (2011).</p><p><a href="http://bioinformatics.oxfordjournals.org/content/25/16/2078.abstract"><strong>SAMtools</strong></a>:<br /> <strong>The Sequence Alignment/Map format and SAMtools.</strong><br /> Li, H. et al. Bioinformatics 25, 2078-9 (2009).</p><p><a href="http://bioinformatics.oxfordjournals.org/content/early/2014/04/12/bioinformatics.btu170"><strong>Trimmomatic</strong></a>:<br /> <strong>Trimmomatic: A flexible trimmer for Illumina Sequence Data.</strong><br /> Bolger, A. M., Lohse, M. &amp; Usadel, B. Bioinformatics 1-7 (2014).</p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/42972/list-of-bioinformatics-workflow-management-tools</guid>
	<pubDate>Sat, 20 Mar 2021 00:15:25 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/42972/list-of-bioinformatics-workflow-management-tools</link>
	<title><![CDATA[List of bioinformatics workflow management tools !]]></title>
	<description><![CDATA[<h3>Here are list of&nbsp;Workflow Managers</h3><ul>
<li><span><a href="https://github.com/pcingola/BigDataScript">BigDataScript</a></span>&nbsp;&ndash; A cross-system scripting language for working with big data pipelines in computer systems of different sizes and capabilities. [&nbsp;<a href="https://pubmed.ncbi.nlm.nih.gov/25189778">paper-2014</a>&nbsp;|&nbsp;<a href="https://pcingola.github.io/BigDataScript">web</a>&nbsp;]</li>
<li><span><a href="https://github.com/ssadedin/bpipe">Bpipe</a></span>&nbsp;&ndash; A small language for defining pipeline stages and linking them together to make pipelines. [&nbsp;<a href="http://docs.bpipe.org/">web</a>&nbsp;]</li>
<li><span><a href="https://github.com/common-workflow-language/common-workflow-language">Common Workflow Language</a></span>&nbsp;&ndash; a specification for describing analysis workflows and tools that are portable and scalable across a variety of software and hardware environments, from workstations to cluster, cloud, and high performance computing (HPC) environments. [&nbsp;<a href="http://www.commonwl.org/">web</a>&nbsp;]</li>
<li><span><a href="https://github.com/broadinstitute/cromwell">Cromwell</a></span>&nbsp;&ndash; A Workflow Management System geared towards scientific workflows. [&nbsp;<a href="https://cromwell.readthedocs.io/">web</a>&nbsp;]</li>
<li><span><a href="https://github.com/galaxyproject">Galaxy</a></span>&nbsp;&ndash; a popular open-source, web-based platform for data intensive biomedical research. Has several features, from data analysis to workflow management to visualization tools. [&nbsp;<a href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6030816">paper-2018</a>&nbsp;|&nbsp;<a href="https://galaxyproject.org/">web</a>&nbsp;]</li>
<li><span><a href="https://github.com/nextflow-io/nextflow">Nextflow</a>&nbsp;(recommended)</span>&nbsp;&ndash; A fluent DSL modelled around the UNIX pipe concept, that simplifies writing parallel and scalable pipelines in a portable manner. [&nbsp;<a href="https://pubmed.ncbi.nlm.nih.gov/29412134">paper-2018</a>&nbsp;|&nbsp;<a href="http://nextflow.io/">web</a>&nbsp;]</li>
<li><span><a href="https://github.com/cgat-developers/ruffus">Ruffus</a></span>&nbsp;&ndash; Computation Pipeline library for python widely used in science and bioinformatics. [&nbsp;<a href="https://pubmed.ncbi.nlm.nih.gov/20847218">paper-2010</a>&nbsp;|&nbsp;<a href="http://www.ruffus.org.uk/">web</a>&nbsp;]</li>
<li><span><a href="https://github.com/SeqWare/seqware">SeqWare</a></span>&nbsp;&ndash; Hadoop Oozie-based workflow system focused on genomics data analysis in cloud environments. [&nbsp;<a href="https://pubmed.ncbi.nlm.nih.gov/21210981">paper-2010</a>&nbsp;|&nbsp;<a href="https://seqware.github.io/">web</a>&nbsp;]</li>
<li><span><a href="https://bitbucket.org/snakemake">Snakemake</a></span>&nbsp;&ndash; A workflow management system in Python that aims to reduce the complexity of creating workflows by providing a fast and comfortable execution environment. [&nbsp;<a href="https://pubmed.ncbi.nlm.nih.gov/29788404">paper-2018</a>&nbsp;|&nbsp;<a href="https://snakemake.readthedocs.io/">web</a>&nbsp;]</li>
<li><span><a href="https://github.com/broadinstitute/wdl">Workflow Descriptor Language</a></span>&nbsp;&ndash; Workflow standard developed by the Broad. [&nbsp;<a href="https://software.broadinstitute.org/wdl">web</a>&nbsp;]</li>
</ul>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39720/snakemake-workflow-dna-seq-gatk-variant-calling</guid>
	<pubDate>Thu, 25 Jul 2019 12:55:07 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39720/snakemake-workflow-dna-seq-gatk-variant-calling</link>
	<title><![CDATA[Snakemake workflow: dna-seq-gatk-variant-calling]]></title>
	<description><![CDATA[<p><span>This Snakemake pipeline implements the&nbsp;</span><a href="https://software.broadinstitute.org/gatk/best-practices/workflow?id=11145">GATK best-practices workflow</a><span>&nbsp;for calling small genomic variants.</span></p><p>Address of the bookmark: <a href="https://github.com/snakemake-workflows/dna-seq-gatk-variant-calling" rel="nofollow">https://github.com/snakemake-workflows/dna-seq-gatk-variant-calling</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43797/gtotree-a-user-friendly-workflow-for-phylogenomics</guid>
	<pubDate>Wed, 23 Feb 2022 08:18:58 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43797/gtotree-a-user-friendly-workflow-for-phylogenomics</link>
	<title><![CDATA[GToTree: a user-friendly workflow for phylogenomics]]></title>
	<description><![CDATA[<p><a href="https://github.com/AstrobioMike/GToTree/wiki">GToTree</a><span>&nbsp;is a user-friendly workflow for phylogenomics intended to give more researchers the capability to create phylogenomic trees. The open-access Bioinformatics Journal publication is available&nbsp;</span><a href="https://doi.org/10.1093/bioinformatics/btz188">here</a><span>, and documentation and examples can be found&nbsp;</span><a href="https://github.com/AstrobioMike/GToTree/wiki">at the wiki here</a><span>.</span></p><p>Address of the bookmark: <a href="https://github.com/AstrobioMike/GToTree" rel="nofollow">https://github.com/AstrobioMike/GToTree</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37512/purecn-copy-number-calling-and-snv-classification-using-targeted-short-read-sequencing</guid>
	<pubDate>Thu, 09 Aug 2018 04:09:37 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37512/purecn-copy-number-calling-and-snv-classification-using-targeted-short-read-sequencing</link>
	<title><![CDATA[PureCN: copy number calling and SNV classification using targeted short read sequencing]]></title>
	<description><![CDATA[<p>This package estimates tumor purity, copy number, and loss of heterozygosity (LOH), and classifies single nucleotide variants (SNVs) by somatic status and clonality. PureCN is designed for targeted short read sequencing data, integrates well with standard somatic variant detection and copy number pipelines, and has support for tumor samples without matching normal samples.</p>
<p>Author: Markus Riester [aut, cre], Angad P. Singh [aut]</p>
<p>Maintainer: Markus Riester &lt;markus.riester at novartis.com&gt;</p>
<div id="bioc_citation_outer">
<p>Citation (from within R, enter&nbsp;<code>citation("PureCN")</code>):</p>
<div id="bioc_citation">
<p>Riester M, Singh A, Brannon A, Yu K, Campbell C, Chiang D, Morrissey M (2016). &ldquo;PureCN: Copy number calling and SNV classification using targeted short read sequencing.&rdquo;&nbsp;<em>Source Code for Biology and Medicine</em>,&nbsp;<strong>11</strong>, 13. doi:&nbsp;<a href="http://doi.org/10.1186/s13029-016-0060-z">10.1186/s13029-016-0060-z</a>.</p>
</div>
</div><p>Address of the bookmark: <a href="http://bioconductor.org/packages/release/bioc/html/PureCN.html" rel="nofollow">http://bioconductor.org/packages/release/bioc/html/PureCN.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42987/public-databases-for-bioinformatics</guid>
	<pubDate>Tue, 23 Mar 2021 05:32:15 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42987/public-databases-for-bioinformatics</link>
	<title><![CDATA[Public Databases for Bioinformatics !]]></title>
	<description><![CDATA[<pre>https://www.nature.com/articles/s41467-020-17155-y<br><br>Server Infrastructure:

File Server:

dhara: Synology 3614 Storage Appliance
4 Core Xeon
108TB disk storage
10Gb ethernet to SCG3
Access atx: dhara:5000
Has btsync server (try it - its much better than dropbox)

Compute Servers:

nandi: Kundaje and Phi Server
24 intel cores
256GB RAM
500GB of SSD storage 
36TB RAID6 local storage
4 Intel Phi's (space for 4 more GPU's)


durga: Montgomery and sensitive data
24 intel cores
256GB RAM
500GB of SSD RAID0 storage 
60TB RAID6 local storage

mitra: Bassik and Web/DB Server
24 core
256GB RAM 
500GB of SSD RAID0 storage 
36TB RAID6 local storage

vayu: Kundaje GPU server
4 core
64GB RAM 
200GB of SSD storage 
8TB RAID10 local storage
4 Nvidia GTX 970 4GB GPUs

amold: Bickel and SGE server
32 AMD core
128GB RAM 
200GB of SSD storage 
12TB RAID5 local storage

wotan: Bickel and SGE server
64 AMD core
256GB RAM 
200GB of SSD storage 
12TB RAID5 local storage

Filesystem:

/users/$USER
default home directory
full backups nightly 
nfs mount to dhara
should store code, papers, and other highly processed data here

/mnt/data/
globally accessible data
should store common data here
e.g. genomes and indexes, annotations, ENCODE data  
if you dont want this to count towards your quote you must chown

/mnt/lab_data/$LAB/
lab accessible data
should store lab project data here 
e.g. ATAC-seq prediction data, enhancer prediction, motif calls

/srv/scratch/$USER
fast local storage
not backed up, but on raid and data will never be deleted
most analysis should be performed here

/srv/persistent/$USER
fast local storage
synced nightly, but not backed up
       ie if the hard drives fail or you delete something and notice 
       within 24 hours we can recover. Otherwise not. (vs home which is 
       properly backed up )  
intermediate analysis products that would be hard to recover should be stored here 
       e.g. stochastic analysis results that need to be kept so that paper 
       results can be reproduced

/srv/www/$LABNAME/
web accessible from mitra.stanford.edu
*NOT BACKED UP*

Some parallel programming patterns:

# gzip a bunch of files
parallel gzip -- *.FILESTOGZIP

# fork example in python:
(for more detailed examples look at 
 https://github.com/nboley/grit/ grit/lib/multiprocessing_utils.py)

import os
import time
import random

import multiprocessing

class ProcessSafeOPStream( object ):
    def __init__( self, writeable_obj ):
        self.writeable_obj = writeable_obj
        self.lock = multiprocessing.Lock()
        self.name = self.writeable_obj.name
        return
    
    def write( self, data ):
        self.lock.acquire()
        self.writeable_obj.write( data )
        self.writeable_obj.flush()
        self.lock.release()
        return
    
    def close( self ):
        self.writeable_obj.close()

def worker(queue, ofp):
    # Try without this
    random.seed()
    while True:
        i = queue.get()
        if i == 'FINISHED': return
        # simulate an expensive function
        x = random.random()
        time.sleep(x/10)
        print i, x
        ofp.write("%i\t%s\n" % (i, x))

NSIMS = 10000
NPROC = 25

# populate queue
todo = multiprocessing.Queue()
for i in xrange(NSIMS): todo.put(i)
for i in xrange(NPROC): todo.put('FINISHED')

ofp = ProcessSafeOPStream( open("output.txt", "w") )

pids = []
for i in xrange(NPROC):
    pid = os.fork()
    if pid == 0:
       worker(todo, ofp)
       os._exit(0)
    else:
       pids.append(pid)  

for pid in pids:
    os.waitpid(pid, 0)

ofp.close()

print "FINISHED"<br><br></pre>
<p>For use case 1 we obtained the following ENCODE and ROADMAP datasets&nbsp;<a href="https://www.encodeproject.org/files/ENCFF446WOD/@@download/ENCFF446WOD.bed.gz">https://www.encodeproject.org/files/ENCFF446WOD/@@download/ENCFF446WOD.bed.gz</a>,&nbsp;<a href="https://www.encodeproject.org/files/ENCFF546PJU/@@download/ENCFF546PJU.bam">https://www.encodeproject.org/files/ENCFF546PJU/@@download/ENCFF546PJU.bam</a>,&nbsp;<a href="https://www.encodeproject.org/files/ENCFF059BEU/@@download/ENCFF059BEU.bam">https://www.encodeproject.org/files/ENCFF059BEU/@@download/ENCFF059BEU.bam</a>. Blacklisted regions were obtained from&nbsp;<a href="http://mitra.stanford.edu/kundaje/akundaje/release/blacklists/hg38-human/hg38.blacklist.bed.gz">http://mitra.stanford.edu/kundaje/akundaje/release/blacklists/hg38-human/hg38.blacklist.bed.gz</a>. The human genome version hg38 was obtained from&nbsp;<a href="http://hgdownload.cse.ucsc.edu/goldenPath/hg38/bigZips/hg38.fa.gz">http://hgdownload.cse.ucsc.edu/goldenPath/hg38/bigZips/hg38.fa.gz</a>.</p>
<p>For use case 2 we used the set of narrowPeak files summarized in&nbsp;<a href="https://github.com/wkopp/janggu_usecases/tree/master/extra/urls.txt">https://github.com/wkopp/janggu_usecases/tree/master/extra/urls.txt</a>&nbsp;(archived version v1.0.1). The human genome version hg19 was obtained from&nbsp;<a href="http://hgdownload.cse.ucsc.edu/goldenPath/hg19/bigZips/hg19.fa.gz">http://hgdownload.cse.ucsc.edu/goldenPath/hg19/bigZips/hg19.fa.gz</a></p>
<p>For use case 3 we used the ENCODE datasets&nbsp;<a href="https://www.encodeproject.org/files/ENCFF591XCX/@@download/ENCFF591XCX.bam">https://www.encodeproject.org/files/ENCFF591XCX/@@download/ENCFF591XCX.bam</a>,&nbsp;<a href="https://www.encodeproject.org/files/ENCFF736LHE/@@download/ENCFF736LHE.bigWig">https://www.encodeproject.org/files/ENCFF736LHE/@@download/ENCFF736LHE.bigWig</a>,&nbsp;<a href="https://www.encodeproject.org/files/ENCFF177HHM/@@download/ENCFF177HHM.bam">https://www.encodeproject.org/files/ENCFF177HHM/@@download/ENCFF177HHM.bam</a>&nbsp;as we as the GENCODE annotation v29 from&nbsp;<a href="ftp://ftp.ebi.ac.uk/pub/databases/gencode/Gencode_human/release_29/gencode.v29.annotation.gtf.gz">ftp://ftp.ebi.ac.uk/pub/databases/gencode/Gencode_human/release_29/gencode.v29.annotation.gtf.gz</a>.</p><p>Address of the bookmark: <a href="http://mitra.stanford.edu/" rel="nofollow">http://mitra.stanford.edu/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34482/ribbon-visualizing-complex-genome-alignments-and-structural-variation</guid>
	<pubDate>Wed, 29 Nov 2017 07:40:22 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34482/ribbon-visualizing-complex-genome-alignments-and-structural-variation</link>
	<title><![CDATA[Ribbon: Visualizing complex genome alignments and structural variation:]]></title>
	<description><![CDATA[<p>Ribbon can be used for long reads, short reads, paired-end reads, and assembly/genome alignments. Instructions for each data format are available by clicking on "instructions" in each tab on the right.</p>
<p>Local installation:</p>
<p>You can install Ribbon locally from Github by following the instructions here:&nbsp;<a href="https://github.com/MariaNattestad/ribbon" target="_blank">https://github.com/MariaNattestad/Ribbon</a></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/34567/jobtree-based-python-wrapper-to-run-the-genome-simulation-tool-suite-evolver</guid>
	<pubDate>Fri, 08 Dec 2017 16:26:32 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34567/jobtree-based-python-wrapper-to-run-the-genome-simulation-tool-suite-evolver</link>
	<title><![CDATA[jobTree based python wrapper to run the genome simulation tool suite Evolver]]></title>
	<description><![CDATA[<p><span>evolverSimControl</span><span>&nbsp;(</span><span>eSC</span><span>) can be used to simulate multi-chromosome genome evolution on an arbitrary phylogeny (</span><a href="http://evolution.genetics.washington.edu/phylip/newicktree.html">Newick format</a><span>). In addition to simply running evolver,&nbsp;</span><span>eSC</span><span>&nbsp;also automatically creates statistical summaries of the simulation as it runs including text and image files. Also included are convenience scripts to: check on a running simulation and see detailed status and logging information; extract fasta sequence files from the leaf nodes of a completed simulation; extract pairwise multiple alignment files (</span><a href="http://genome.ucsc.edu/FAQ/FAQformat.html#format5">.maf</a><span>) from leaf and branch nodes from a completed simulation and with the help of&nbsp;</span><a href="https://github.com/dentearl/mafTools/">mafJoin</a><span>, join them together into a single maf covering the entire simulation.</span></p><p>Address of the bookmark: <a href="https://github.com/dentearl/evolverSimControl" rel="nofollow">https://github.com/dentearl/evolverSimControl</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34620/mash-fast-genome-and-metagenome-distance-estimation-using-minhash</guid>
	<pubDate>Tue, 12 Dec 2017 17:30:12 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34620/mash-fast-genome-and-metagenome-distance-estimation-using-minhash</link>
	<title><![CDATA[Mash: fast genome and metagenome distance estimation using MinHash]]></title>
	<description><![CDATA[<p>Mash is normally distributed as a dependency-free binary for Linux or OSX (see&nbsp;<a href="https://github.com/marbl/Mash/releases">https://github.com/marbl/Mash/releases</a>). This source distribution is intended for other operating systems or for development. Mash requires c++11 to build, which is available in and GCC &gt;= 4.8 and OSX &gt;= 10.7.</p>
<p>See&nbsp;<a href="http://mash.readthedocs.org/">http://mash.readthedocs.org</a>&nbsp;for more information.</p><p>Address of the bookmark: <a href="https://github.com/marbl/Mash/releases" rel="nofollow">https://github.com/marbl/Mash/releases</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35131/giggle-a-search-engine-for-large-scale-integrated-genome-analysis</guid>
	<pubDate>Wed, 10 Jan 2018 03:10:45 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35131/giggle-a-search-engine-for-large-scale-integrated-genome-analysis</link>
	<title><![CDATA[GIGGLE: a search engine for large-scale integrated genome analysis]]></title>
	<description><![CDATA[<p><span>GIGGLE is a genomics search engine that identifies and ranks the significance of genomic loci shared between query features and thousands of genome interval files. GIGGLE (</span><a href="https://github.com/ryanlayer/giggle">https://github.com/ryanlayer/giggle</a><span>) scales to billions of intervals and is over three orders of magnitude faster than existing methods. Its speed extends the accessibility and utility of resources such as ENCODE, Roadmap Epigenomics, and GTEx by facilitating data integration and hypothesis generation.</span></p>
<p>https://www.nature.com/articles/nmeth.4556</p><p>Address of the bookmark: <a href="https://github.com/ryanlayer/giggle" rel="nofollow">https://github.com/ryanlayer/giggle</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>