<?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/34475?offset=230</link>
	<atom:link href="https://bioinformaticsonline.com/related/34475?offset=230" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36817/kwip-the-k-mer-weighted-inner-product-a-de-novo-estimator-of-genetic-similarity</guid>
	<pubDate>Tue, 29 May 2018 08:37:53 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36817/kwip-the-k-mer-weighted-inner-product-a-de-novo-estimator-of-genetic-similarity</link>
	<title><![CDATA[kWIP: The k-mer weighted inner product, a de novo estimator of genetic similarity]]></title>
	<description><![CDATA[<p>The k-mer Weighted Inner Product.</p>
<p>This software implements a <em>de novo</em>, <em>alignment free</em> measure of sample genetic dissimilarity which operates upon raw sequencing reads. It is able to calculate the genetic dissimilarity between samples without any reference genome, and without assembling one.</p>
<p> </p>

De novo estimates of genetic relatedness from next-gen sequencing data https://kwip.readthedocs.org<p>Address of the bookmark: <a href="https://github.com/kdmurray91/kwip" rel="nofollow">https://github.com/kdmurray91/kwip</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37957/base-a-practical-de-novo-assembler-for-large-genomes-using-long-ngs-reads</guid>
	<pubDate>Fri, 19 Oct 2018 07:25:21 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37957/base-a-practical-de-novo-assembler-for-large-genomes-using-long-ngs-reads</link>
	<title><![CDATA[BASE: a practical de novo assembler for large genomes using long NGS reads]]></title>
	<description><![CDATA[<p><span>new&nbsp;</span><em>de novo</em><span>&nbsp;assembler called BASE. It enhances the classic seed-extension approach by indexing the reads efficiently to generate adaptive seeds that have high probability to appear uniquely in the genome. Such seeds form the basis for BASE to build extension trees and then to use reverse validation to remove the branches based on read coverage and paired-end information, resulting in high-quality consensus sequences of reads sharing the seeds. Such consensus sequences are then extended to contigs.</span></p><p>Address of the bookmark: <a href="https://github.com/dhlbh/BASE" rel="nofollow">https://github.com/dhlbh/BASE</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34292/automatic-filtering-trimming-error-removing-and-quality-control-for-fastq-data</guid>
	<pubDate>Mon, 13 Nov 2017 05:10:23 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34292/automatic-filtering-trimming-error-removing-and-quality-control-for-fastq-data</link>
	<title><![CDATA[Automatic Filtering, Trimming, Error Removing and Quality Control for fastq data]]></title>
	<description><![CDATA[<p><span>Automatic Filtering, Trimming, Error Removing and Quality Control for fastq data</span><br><code>AfterQC</code><span>&nbsp;can simply go through all fastq files in a folder and then output three folders:&nbsp;</span><span>good</span><span>,&nbsp;</span><span>bad</span><span>&nbsp;and&nbsp;</span><span>QC</span><span>&nbsp;folders, which contains good reads, bad reads and the QC results of each fastq file/pair.</span><br><span>Currently it supports processing data from HiSeq 2000/2500/3000/4000, Nextseq 500/550, MiniSeq...and other&nbsp;</span><a href="http://support.illumina.com/help/SequencingAnalysisWorkflow/Content/Vault/Informatics/Sequencing_Analysis/CASAVA/swSEQ_mCA_FASTQFiles.htm">Illumina 1.8 or newer formats</a></p><p>Address of the bookmark: <a href="https://github.com/OpenGene/AfterQC" rel="nofollow">https://github.com/OpenGene/AfterQC</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43587/fix-rewritable-error-of-elgg</guid>
	<pubDate>Mon, 15 Nov 2021 06:23:46 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43587/fix-rewritable-error-of-elgg</link>
	<title><![CDATA[Fix rewritable error of ELGG !]]></title>
	<description><![CDATA[<p>The&nbsp;<code><a href="https://httpd.apache.org/docs/2.4/mod/mod_rewrite.html">mod_rewrite</a></code>&nbsp;module uses a rule-based rewriting engine, based on a PCRE regular-expression parser, to rewrite requested URLs on the fly. By default,&nbsp;<code><a href="https://httpd.apache.org/docs/2.4/mod/mod_rewrite.html">mod_rewrite</a></code>&nbsp;maps a URL to a filesystem path. However, it can also be used to redirect one URL to another URL, or to invoke an internal proxy fetch.</p>
<p><code><a href="https://httpd.apache.org/docs/2.4/mod/mod_rewrite.html">mod_rewrite</a></code>&nbsp;provides a flexible and powerful way to manipulate URLs using an unlimited number of rules. Each rule can have an unlimited number of attached rule conditions, to allow you to rewrite URL based on server variables, environment variables, HTTP headers, or time stamps.</p>
<p><code><a href="https://httpd.apache.org/docs/2.4/mod/mod_rewrite.html">mod_rewrite</a></code>&nbsp;operates on the full URL path, including the path-info section. A rewrite rule can be invoked in&nbsp;<code>httpd.conf</code>&nbsp;or in&nbsp;<code>.htaccess</code>. The path generated by a rewrite rule can include a query string, or can lead to internal sub-processing, external request redirection, or internal proxy throughput.</p>
<p>Further details, discussion, and examples, are provided in the&nbsp;<a href="https://httpd.apache.org/docs/2.4/rewrite/">detailed mod_rewrite documentation</a>.</p>
<p>&nbsp;</p>
<ul>
<li>sudo a2enmod rewrite</li>
</ul>
<ul>
<li>sudo systemctl restart apache2</li>
</ul>
<ul>
<li>sudo nano /etc/apache2/sites-available/000-default.conf</li>
</ul>
<p>Write this</p>
<div title="/etc/apache2/sites-available/000-default.conf">/etc/apache2/sites-available/000-default.conf</div>
<div>
<div>
<pre><code><span>&lt;</span>VirtualHost *:8<span><span>0</span>&gt;</span>
    <span></span><span><span>&lt;</span>Directory /var/www/html<span>&gt;</span></span><span></span>
        <span>Options Indexes FollowSymLinks MultiViews</span>
        <span>AllowOverride All</span>
        <span>Require all granted</span>
    <span></span><span><span>&lt;</span>/Directory<span>&gt;</span></span><span></span>

    <span>.</span> <span>.</span> <span>.</span>
<span>&lt;</span>/VirtualHost<span>&gt;</span></code></pre>
</div>
</div><p>Address of the bookmark: <a href="https://www.digitalocean.com/community/tutorials/how-to-rewrite-urls-with-mod_rewrite-for-apache-on-ubuntu-18-04" rel="nofollow">https://www.digitalocean.com/community/tutorials/how-to-rewrite-urls-with-mod_rewrite-for-apache-on-ubuntu-18-04</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42619/metaeuk-sensitive-high-throughput-gene-discovery-and-annotation-for-large-scale-eukaryotic-metagenomics</guid>
	<pubDate>Wed, 13 Jan 2021 19:29:32 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42619/metaeuk-sensitive-high-throughput-gene-discovery-and-annotation-for-large-scale-eukaryotic-metagenomics</link>
	<title><![CDATA[MetaEuk - sensitive, high-throughput gene discovery and annotation for large-scale eukaryotic metagenomics]]></title>
	<description><![CDATA[<p><span>MetaEuk is a modular toolkit designed for large-scale gene discovery and annotation in eukaryotic metagenomic contigs. Metaeuk combines the fast and sensitive homology search capabilities of&nbsp;</span><a href="https://github.com/soedinglab/MMseqs2">MMseqs2</a><span>&nbsp;with a dynamic programming procedure to recover optimal exons sets. It reduces redundancies in multiple discoveries of the same gene and resolves conflicting gene predictions on the same strand. MetaEuk is GPL-licensed open source software that is implemented in C++ and available for Linux and macOS. The software is designed to run on multiple cores.</span></p><p>Address of the bookmark: <a href="https://github.com/soedinglab/metaeuk" rel="nofollow">https://github.com/soedinglab/metaeuk</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/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/35135/alitv%E2%80%94interactive-visualization-of-whole-genome-comparisons</guid>
	<pubDate>Wed, 10 Jan 2018 07:08:17 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35135/alitv%E2%80%94interactive-visualization-of-whole-genome-comparisons</link>
	<title><![CDATA[AliTV—interactive visualization of whole genome comparisons]]></title>
	<description><![CDATA[<p>AliTV, which provides interactive visualization of whole genome alignments. AliTV reads multiple whole genome alignments or automatically generates alignments from the provided data. Optional feature annotations and phylo- genetic information are supported. The user-friendly, web-browser based and highly customizable interface allows rapid exploration and manipulation of the visualized data as well as the export of publication-ready high-quality figures. AliTV is freely available at&nbsp;<a href="https://github.com/AliTVTeam/AliTV">https://github.com/AliTVTeam/AliTV</a></p>
<p>https://alitvteam.github.io/AliTV/</p><p>Address of the bookmark: <a href="https://github.com/AliTVTeam/AliTV" rel="nofollow">https://github.com/AliTVTeam/AliTV</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35543/genometools-the-versatile-open-source-genome-analysis-software</guid>
	<pubDate>Wed, 07 Feb 2018 10:44:18 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35543/genometools-the-versatile-open-source-genome-analysis-software</link>
	<title><![CDATA[GenomeTools: The versatile open source genome analysis software]]></title>
	<description><![CDATA[<p>The&nbsp;<em>GenomeTools</em>&nbsp;genome analysis system is a&nbsp;<a href="http://genometools.org/license.html">free</a>&nbsp;collection of bioinformatics&nbsp;<a href="http://genometools.org/tools.html">tools</a>&nbsp;(in the realm of genome informatics) combined into a single binary named&nbsp;<em>gt</em>. It is based on a C library named &ldquo;libgenometools&rdquo; which consists of several modules.</p>
<p>If you are interested in gene prediction, have a look at&nbsp;<a href="http://genomethreader.org/" title="GenomeThreader gene prediction        software"><em>GenomeThreader</em></a>.</p><p>Address of the bookmark: <a href="http://genometools.org/" rel="nofollow">http://genometools.org/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>