<?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/31300?offset=1040</link>
	<atom:link href="https://bioinformaticsonline.com/related/31300?offset=1040" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27430/mosaik-a-hash-based-algorithm-for-accurate-next-generation-sequencing-short-read-mapping</guid>
	<pubDate>Fri, 20 May 2016 18:53:49 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27430/mosaik-a-hash-based-algorithm-for-accurate-next-generation-sequencing-short-read-mapping</link>
	<title><![CDATA[MOSAIK: A Hash-Based Algorithm for Accurate Next-Generation Sequencing Short-Read Mapping]]></title>
	<description><![CDATA[<p><span>MOSAIK is a stable, sensitive and open-source program for mapping second and third-generation sequencing reads to a reference genome. Uniquely among current mapping tools, MOSAIK can align reads generated by all the major sequencing technologies, including Illumina, Applied Biosystems SOLiD, Roche 454, Ion Torrent and Pacific BioSciences SMRT. Indeed, MOSAIK was the only aligner to provide consistent mappings for all the generated data (sequencing technologies, low-coverage and exome) in the 1000 Genomes Project. To provide highly accurate alignments, MOSAIK employs a hash clustering strategy coupled with the Smith-Waterman algorithm. This method is well-suited to capture mismatches as well as short insertions and deletions. To support the growing interest in larger structural variant (SV) discovery, MOSAIK provides explicit support for handling known-sequence SVs, e.g. mobile element insertions (MEIs) as well as generating outputs tailored to aid in SV discovery.</span></p><p>Address of the bookmark: <a href="http://journals.plos.org/plosone/article?id=10.1371/journal.pone.0090581" rel="nofollow">http://journals.plos.org/plosone/article?id=10.1371/journal.pone.0090581</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/27453/senior-project-fellow-bioinformatics-at-nbri</guid>
  <pubDate>Sat, 21 May 2016 21:01:05 -0500</pubDate>
  <link></link>
  <title><![CDATA[Senior Project Fellow Bioinformatics at NBRI]]></title>
  <description><![CDATA[
<p>Walk In Interview No. 03/Project/2016<br />Senior Project Fellow Bioinformatics Job vacancies in CSIR- National Botanical Research Institute (NBRI), Lucknow<br />Area III: Molecular Biology &amp; Biotechnology<br />Qualification : 1st Class M.Sc. in Bioinformatics/Biotechnology/ Life Science /Biochemistry/Botany with 2 years research experience and at least one publication in SCI Journal or 1st class M.Tech in Bioinformatics<br />Age : 32 years<br />Salary : Rs.18000<br />How to apply<br />Date &amp; Venue of Interview For Area III: 27-05-2016 at 11.00 A.M. at Conference Room, T.N. Khushoo Block, NBRI, Lucknow.</p>

<p>http://www.nbri.res.in/temp.php</p>
]]></description>
</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/opportunity/view/27540/research-associate-bioinformatics-at-manit</guid>
  <pubDate>Thu, 26 May 2016 02:20:58 -0500</pubDate>
  <link></link>
  <title><![CDATA[Research Associate Bioinformatics at MANIT]]></title>
  <description><![CDATA[
<p>Research Associate Jobs opportunity in Maulana Azad National Institute of Technology (MANIT) on contract basis<br />Project : “Screening of Anti-venom potential of medicinal plants from Tribal region of Madhya Pradesh"<br />No. of Post : 01</p>

<p>Qualification : The minimum qualifications are : Ph.D in Bioinformatics/ Biotechnology or allied branches with atleast two publication in SCI journals.<br />Fellowship : The consolidated emoluments of Rs.36, 000/ PM+HRA+MA as per CSIR rules.</p>

<p>How to apply<br />Applications (in prescribed attached format and supporting documents) to be received in the Dr. Rahul Shrivastava, Principal Investigator (CSIR Project), Department of Biological Science and Engineering, Maulana Azad National Institute of Technology, Bhopal – 462003 (MP) on or before 7th June 2016.</p>

<p>More at http://www.web.manit.ac.in/Year%202016/Recruitment%20Contract%20Faculty/Biological/Advertisement%20for%20Antivenome%20project%202.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27685/biodbnet</guid>
	<pubDate>Thu, 02 Jun 2016 11:11:47 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27685/biodbnet</link>
	<title><![CDATA[BioDBnet]]></title>
	<description><![CDATA[<p><span>Database to Database Conversions</span> </p>
<p>db2db allows for conversions of identifiers from one database to other database identifiers or annotations. To use db2db select the input type of your data, changing the input type automatically changes the output options to the ones specific for the input selected. Then select one or more output types and add your identifiers in the ID list box. Set the remove duplicate values to 'No' if you do not want duplicates to be removed. Clicking on submit then returns a table of your inputs matched against all the outputs selected in the exact order as entered. Results can be limited to a particular taxon by entering it's <a href="https://biodbnet-abcc.ncifcrf.gov/tools/orgTaxon.php">Taxon ID</a>. The performance will vary widely depending on the number of outputs and the options selected. Conversions to a single output with the default options should complete in a few seconds</p><p>Address of the bookmark: <a href="https://biodbnet-abcc.ncifcrf.gov/db/db2db.php" rel="nofollow">https://biodbnet-abcc.ncifcrf.gov/db/db2db.php</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/27713/mutabind</guid>
	<pubDate>Mon, 06 Jun 2016 13:34:09 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/27713/mutabind</link>
	<title><![CDATA[MutaBind]]></title>
	<description><![CDATA[<p><span>MutaBind is a new computational method and server created through NCBI research efforts that maps mutations on a protein structural complex, calculates changes in binding affinity, identifies deleterious mutations and produces a downloadable mutant structural model.&nbsp;</span><a href="http://www.ncbi.nlm.nih.gov/projects/mutabind/index.fcgi/" target="_blank">http://www.ncbi.nlm.nih.gov/projects/mutabind/index.fcgi/</a></p><p><img src="http://www.ncbi.nlm.nih.gov/projects/mutabind/prj-sunddg/static/myimgs/CirclesDiamondBlueThiner.png" width="471" height="258" alt="image" style="border: 0px;"></p><p><span>MutaBind guides you through this process, step by step, starting with selecting a protein complex and inputting PDB code or uploading PDB files. You can also retrieve results with a job ID number, view help documents, and review the MutaBind method and references.</span></p><p><span>More at&nbsp;http://www.ncbi.nlm.nih.gov/projects/mutabind/index.fcgi/</span></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27818/gaemr</guid>
	<pubDate>Tue, 14 Jun 2016 06:18:37 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27818/gaemr</link>
	<title><![CDATA[GAEMR]]></title>
	<description><![CDATA[<p>The&nbsp;<span>G</span>enome&nbsp;<span>A</span>ssembly&nbsp;<span>E</span>valuation&nbsp;<span>M</span>etrics and&nbsp;<span>R</span>eporting (GAEMR) package is an assembly analysis framework composed a number of integrated modules. These modules can be executed as a single program to generate a complete analysis report, or executed individually to generate specific charts and tables. GAEMR standardizes input by converting a variety of read types to Binary Alignment Map (BAM) format, allowing a single input format to be entered into GAEMR&rsquo;s analysis pipeline, hence enabling the generation of standard reports.</p>
<p>GAEMR&rsquo;s analysis philosophy is centered on contiguity, correctness, and completeness -- how many pieces in an assembly composed of, how well those pieces accurately represent the genome sequenced, and how much of that genome is represented by those pieces. By performing over twenty different analyses based on these principles, GAEMR gives a clear picture of the condition of a genome assembly.&nbsp;</p><p>Address of the bookmark: <a href="https://www.broadinstitute.org/software/gaemr/" rel="nofollow">https://www.broadinstitute.org/software/gaemr/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27841/covcal-coverage-read-count-calculator</guid>
	<pubDate>Wed, 15 Jun 2016 18:08:13 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27841/covcal-coverage-read-count-calculator</link>
	<title><![CDATA[CovCal: Coverage / Read Count Calculator]]></title>
	<description><![CDATA[<h2>Coverage / Read Count Calculator</h2>
<h4>Calculate how much sequencing you need to hit a target depth of coverage (or vice versa).</h4>
<p><span>Instructions:</span> set the read length/configuration and genome size, then select what you want to calculate.</p>
<p>Written by <a href="http://stephenturner.us/" target="blank">Stephen Turner</a>, based on the <a href="http://www.ncbi.nlm.nih.gov/pubmed/3294162" target="_blank">Lander-Waterman formula</a>, inspired by <a href="http://core-genomics.blogspot.com/2016/05/how-many-reads-to-sequence-genome.html" target="_blank">a similar calculator</a> written by James Hadfield. Coverage is calculated as <em>C=LN/G</em> and reads as <em>N=CG/L</em> where <em>C</em> = Coverage (X),<em>L</em> = Read length (bp), <em>G</em> = Haploid genome size (bp), and <em>N</em> = Number of reads. Source code <a href="https://github.com/stephenturner/covcalc" target="_blank">on GitHub</a>.</p><p>Address of the bookmark: <a href="http://apps.bioconnector.virginia.edu/covcalc/" rel="nofollow">http://apps.bioconnector.virginia.edu/covcalc/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27959/darkhorse</guid>
	<pubDate>Wed, 22 Jun 2016 05:37:38 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27959/darkhorse</link>
	<title><![CDATA[DarkHorse]]></title>
	<description><![CDATA[<p><em>DarkHorse</em>&nbsp;is a bioinformatic method for rapid, automated identification and ranking of phylogenetically atypical proteins on a genome-wide basis. It works by selecting potential ortholog matches from a reference database of amino acid sequences, then using these matches to calculate a lineage probability index (LPI) score for each genome protein.</p>
<p>LPI scores are inversely proportional to the phylogenetic distance between database match sequences and the query genome. These scores are useful not only for large-scale<em>de novo</em>&nbsp;predictions of horizontally transferred proteins, but can also serve as an independent quality control test for potential horizontal transfer candidates identified by alternative methods, especially those based on nucleic acid signatures. Candidates having high LPI scores are unlikely to have been horizontally transferred, since they are highly conserved among closely related organisms.</p>
<p>One unique and powerful feature of the DarkHorse HGT Candidate database is the opportunity to explore the phylogenetic background of potential HGT donors as well as recipients. The breadth of the database allows not only query sequences, but also their database match partners to be evaluated for sequence similarity or novelty compared to taxonomically related organisms.</p>
<p><em>DarkHorse</em>&nbsp;is configurable for varying degrees of phylogenetic granularity and protein sequence conservation. Users should consult the&nbsp;<a href="http://darkhorse.ucsd.edu/#references">references</a>&nbsp;cited below for a complete explanation of parameter selection and result interpretation. A brief&nbsp;<a href="http://darkhorse.ucsd.edu/tutorial.html">tutorial</a>&nbsp;page is also available on-line.</p><p>Address of the bookmark: <a href="http://darkhorse.ucsd.edu/download.html" rel="nofollow">http://darkhorse.ucsd.edu/download.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/27965/cheatsheet-for-linux</guid>
	<pubDate>Wed, 22 Jun 2016 07:55:06 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/27965/cheatsheet-for-linux</link>
	<title><![CDATA[Cheatsheet for Linux !!]]></title>
	<description><![CDATA[<p>Linux Commands Cheat Sheet<br /><br />&nbsp;&nbsp;&nbsp; File System<br /><br />&nbsp;&nbsp;&nbsp; ls &mdash; list items in current directory<br /><br />&nbsp;&nbsp;&nbsp; ls -l &mdash; list items in current directory and show in long format to see perimissions, size, an modification date<br /><br />&nbsp;&nbsp;&nbsp; ls -a &mdash; list all items in current directory, including hidden files<br /><br />&nbsp;&nbsp;&nbsp; ls -F &mdash; list all items in current directory and show directories with a slash and executables with a star<br /><br />&nbsp;&nbsp;&nbsp; ls dir &mdash; list all items in directory dir<br /><br />&nbsp;&nbsp;&nbsp; cd dir &mdash; change directory to dir<br /><br />&nbsp;&nbsp;&nbsp; cd .. &mdash; go up one directory<br /><br />&nbsp;&nbsp;&nbsp; cd / &mdash; go to the root directory<br /><br />&nbsp;&nbsp;&nbsp; cd ~ &mdash; go to to your home directory<br /><br />&nbsp;&nbsp;&nbsp; cd - &mdash; go to the last directory you were just in<br /><br />&nbsp;&nbsp;&nbsp; pwd &mdash; show present working directory<br /><br />&nbsp;&nbsp;&nbsp; mkdir dir &mdash; make directory dir<br /><br />&nbsp;&nbsp;&nbsp; rm file &mdash; remove file<br /><br />&nbsp;&nbsp;&nbsp; rm -r dir &mdash; remove directory dir recursively<br /><br />&nbsp;&nbsp;&nbsp; cp file1 file2 &mdash; copy file1 to file2<br /><br />&nbsp;&nbsp;&nbsp; cp -r dir1 dir2 &mdash; copy directory dir1 to dir2 recursively<br /><br />&nbsp;&nbsp;&nbsp; mv file1 file2 &mdash; move (rename) file1 to file2<br /><br />&nbsp;&nbsp;&nbsp; ln -s file link &mdash; create symbolic link to file<br /><br />&nbsp;&nbsp;&nbsp; touch file &mdash; create or update file<br /><br />&nbsp;&nbsp;&nbsp; cat file &mdash; output the contents of file<br /><br />&nbsp;&nbsp;&nbsp; less file &mdash; view file with page navigation<br /><br />&nbsp;&nbsp;&nbsp; head file &mdash; output the first 10 lines of file<br /><br />&nbsp;&nbsp;&nbsp; tail file &mdash; output the last 10 lines of file<br /><br />&nbsp;&nbsp;&nbsp; tail -f file &mdash; output the contents of file as it grows, starting with the last 10 lines<br /><br />&nbsp;&nbsp;&nbsp; vim file &mdash; edit file<br /><br />&nbsp;&nbsp;&nbsp; alias name 'command' &mdash; create an alias for a command<br />&nbsp;&nbsp;&nbsp; System<br /><br />&nbsp;&nbsp;&nbsp; shutdown &mdash; shut down machine<br /><br />&nbsp;&nbsp;&nbsp; reboot &mdash; restart machine<br /><br />&nbsp;&nbsp;&nbsp; date &mdash; show the current date and time<br /><br />&nbsp;&nbsp;&nbsp; whoami &mdash; who you are logged in as<br /><br />&nbsp;&nbsp;&nbsp; finger user &mdash; display information about user<br /><br />&nbsp;&nbsp;&nbsp; man command &mdash; show the manual for command<br /><br />&nbsp;&nbsp;&nbsp; df &mdash; show disk usage<br /><br />&nbsp;&nbsp;&nbsp; du &mdash; show directory space usage<br /><br />&nbsp;&nbsp;&nbsp; free &mdash; show memory and swap usage<br /><br />&nbsp;&nbsp;&nbsp; whereis app &mdash; show possible locations of app<br /><br />&nbsp;&nbsp;&nbsp; which app &mdash; show which app will be run by default<br />&nbsp;&nbsp;&nbsp; Process Management<br /><br />&nbsp;&nbsp;&nbsp; ps &mdash; display your currently active processes<br /><br />&nbsp;&nbsp;&nbsp; top &mdash; display all running processes<br /><br />&nbsp;&nbsp;&nbsp; kill pid &mdash; kill process id pid<br /><br />&nbsp;&nbsp;&nbsp; kill -9 pid &mdash; force kill process id pid<br />&nbsp;&nbsp;&nbsp; Permissions<br /><br />&nbsp;&nbsp;&nbsp; ls -l &mdash; list items in current directory and show permissions<br /><br />&nbsp;&nbsp;&nbsp; chmod ugo file &mdash; change permissions of file to ugo - u is the user's permissions, g is the group's permissions, and o is everyone else's permissions. The values of u, g, and o can be any number between 0 and 7.<br /><br />&nbsp;&nbsp;&nbsp; 7 &mdash; full permissions<br /><br />&nbsp;&nbsp;&nbsp; 6 &mdash; read and write only<br /><br />&nbsp;&nbsp;&nbsp; 5 &mdash; read and execute only<br /><br />&nbsp;&nbsp;&nbsp; 4 &mdash; read only<br /><br />&nbsp;&nbsp;&nbsp; 3 &mdash; write and execute only<br /><br />&nbsp;&nbsp;&nbsp; 2 &mdash; write only<br /><br />&nbsp;&nbsp;&nbsp; 1 &mdash; execute only<br /><br />&nbsp;&nbsp;&nbsp; 0 &mdash; no permissions<br /><br />&nbsp;&nbsp;&nbsp; chmod 600 file &mdash; you can read and write - good for files<br /><br />&nbsp;&nbsp;&nbsp; chmod 700 file &mdash; you can read, write, and execute - good for scripts<br /><br />&nbsp;&nbsp;&nbsp; chmod 644 file &mdash; you can read and write, and everyone else can only read - good for web pages<br /><br />&nbsp;&nbsp;&nbsp; chmod 755 file &mdash; you can read, write, and execute, and everyone else can read and execute - good for programs that you want to share<br />&nbsp;&nbsp;&nbsp; Networking<br /><br />&nbsp;&nbsp;&nbsp; wget file &mdash; download a file<br /><br />&nbsp;&nbsp;&nbsp; curl file &mdash; download a file<br /><br />&nbsp;&nbsp;&nbsp; scp user@host:file dir &mdash; secure copy a file from remote server to the dir directory on your machine<br /><br />&nbsp;&nbsp;&nbsp; scp file user@host:dir &mdash; secure copy a file from your machine to the dir directory on a remote server<br /><br />&nbsp;&nbsp;&nbsp; scp -r user@host:dir dir &mdash; secure copy the directory dir from remote server to the directory dir on your machine<br /><br />&nbsp;&nbsp;&nbsp; ssh user@host &mdash; connect to host as user<br /><br />&nbsp;&nbsp;&nbsp; ssh -p port user@host &mdash; connect to host on port as user<br /><br />&nbsp;&nbsp;&nbsp; ssh-copy-id user@host &mdash; add your key to host for user to enable a keyed or passwordless login<br /><br />&nbsp;&nbsp;&nbsp; ping host &mdash; ping host and output results<br /><br />&nbsp;&nbsp;&nbsp; whois domain &mdash; get information for domain<br /><br />&nbsp;&nbsp;&nbsp; dig domain &mdash; get DNS information for domain<br /><br />&nbsp;&nbsp;&nbsp; dig -x host &mdash; reverse lookup host<br /><br />&nbsp;&nbsp;&nbsp; lsof -i tcp:1337 &mdash; list all processes running on port 1337<br />&nbsp;&nbsp;&nbsp; Searching<br /><br />&nbsp;&nbsp;&nbsp; grep pattern files &mdash; search for pattern in files<br /><br />&nbsp;&nbsp;&nbsp; grep -r pattern dir &mdash; search recursively for pattern in dir<br /><br />&nbsp;&nbsp;&nbsp; grep -rn pattern dir &mdash; search recursively for pattern in dir and show the line number found<br /><br />&nbsp;&nbsp;&nbsp; grep -r pattern dir --include='*.ext &mdash; search recursively for pattern in dir and only search in files with .ext extension<br /><br />&nbsp;&nbsp;&nbsp; command | grep pattern &mdash; search for pattern in the output of command<br /><br />&nbsp;&nbsp;&nbsp; find file &mdash; find all instances of file in real system<br /><br />&nbsp;&nbsp;&nbsp; locate file &mdash; find all instances of file using indexed database built from the updatedb command. Much faster than find<br /><br />&nbsp;&nbsp;&nbsp; sed -i 's/day/night/g' file &mdash; find all occurrences of day in a file and replace them with night - s means substitude and g means global - sed also supports regular expressions<br />&nbsp;&nbsp;&nbsp; Compression<br /><br />&nbsp;&nbsp;&nbsp; tar cf file.tar files &mdash; create a tar named file.tar containing files<br /><br />&nbsp;&nbsp;&nbsp; tar xf file.tar &mdash; extract the files from file.tar<br /><br />&nbsp;&nbsp;&nbsp; tar czf file.tar.gz files &mdash; create a tar with Gzip compression<br /><br />&nbsp;&nbsp;&nbsp; tar xzf file.tar.gz &mdash; extract a tar using Gzip<br /><br />&nbsp;&nbsp;&nbsp; gzip file &mdash; compresses file and renames it to file.gz<br /><br />&nbsp;&nbsp;&nbsp; gzip -d file.gz &mdash; decompresses file.gz back to file<br />&nbsp;&nbsp;&nbsp; Shortcuts<br /><br />&nbsp;&nbsp;&nbsp; ctrl+a &mdash; move cursor to beginning of line<br /><br />&nbsp;&nbsp;&nbsp; ctrl+f &mdash; move cursor to end of line<br /><br />&nbsp;&nbsp;&nbsp; alt+f &mdash; move cursor forward 1 word<br /><br />&nbsp;&nbsp;&nbsp; alt+b &mdash; move cursor backward 1 word</p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>