<?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/27799?offset=720</link>
	<atom:link href="https://bioinformaticsonline.com/related/27799?offset=720" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38063/referee-genome-assembly-quality-scores</guid>
	<pubDate>Sun, 04 Nov 2018 16:44:30 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38063/referee-genome-assembly-quality-scores</link>
	<title><![CDATA[Referee: Genome assembly quality scores]]></title>
	<description><![CDATA[<p>Modern genome sequencing technologies provide a succint measure of quality at each position in every read, however all of this information is lost in the assembly process. Referee summarizes the quality information from the reads that map to a site in an assembled genome to calculate a quality score for each position in the genome assembly.</p>
<p>We accomplish this by first calculating genotype likelihoods for every site. For a given site in a diploid genome, there are 10 possible genotypes (AA, AC, AG, AT, CC, CG, CT, GG, GT, TT). Referee takes as input the genotype likelihoods calculated for all 10 genotypes given the called reference base at each position.</p>
<h3>Referee is a program to calculate a quality score for every position in a genome assembly. This allows for easy filtering of low quality sites for any downstream analysis.</h3>
<p>https://github.com/gwct/referee</p><p>Address of the bookmark: <a href="https://gwct.github.io/referee/#" rel="nofollow">https://gwct.github.io/referee/#</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/14186/pybedtools</guid>
	<pubDate>Wed, 20 Aug 2014 01:03:41 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/14186/pybedtools</link>
	<title><![CDATA[pybedtools]]></title>
	<description><![CDATA[<p>pybedtools is a Python wrapper for Aaron Quinlan's BEDtools programs (https://github.com/arq5x/bedtools), which are widely used for genomic interval manipulation or "genome algebra". pybedtools extends BEDTools by offering feature-level manipulations from with Python. See full online documentation, including installation instructions, at http://pythonhosted.org/pybedtools/.</p><p>More at http://pythonhosted.org/pybedtools/</p><p>A powerful toolset for genome arithmetic.http://code.google.com/p/bedtools/</p>]]></description>
	<dc:creator>Shruti Paniwala</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39726/jackalope-a-swift-versatile-phylogenomic-and-high-throughput-sequencing-simulator</guid>
	<pubDate>Fri, 26 Jul 2019 00:58:12 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39726/jackalope-a-swift-versatile-phylogenomic-and-high-throughput-sequencing-simulator</link>
	<title><![CDATA[jackalope: A swift, versatile phylogenomic and high-throughput sequencing simulator]]></title>
	<description><![CDATA[<p><code>jackalope</code> simply and efficiently simulates (i) variants from reference genomes and (ii) reads from both Illumina and Pacific Biosciences (PacBio) platforms. It can either read reference genomes from FASTA files or simulate new ones. Genomic variants can be simulated using summary statistics, phylogenies, Variant Call Format (VCF) files, and coalescent simulations&mdash;the latter of which can include selection, recombination, and demographic fluctuations. <code>jackalope</code> can simulate single, paired-end, or mate-pair Illumina reads, as well as reads from Pacific Biosciences These simulations include sequencing errors, mapping qualities, multiplexing, and optical/PCR duplicates. All outputs can be written to standard file formats.</p>
<p><span>A swift, versatile phylogenomic and high-throughput sequencing simulator </span> <span><a href="https://jackalope.lucasnell.com">https://jackalope.lucasnell.com</a></span></p><p>Address of the bookmark: <a href="https://github.com/lucasnell/jackalope" rel="nofollow">https://github.com/lucasnell/jackalope</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40699/kevler-reference-free-variant-discovery-in-large-eukaryotic-genomes</guid>
	<pubDate>Tue, 28 Jan 2020 03:21:53 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40699/kevler-reference-free-variant-discovery-in-large-eukaryotic-genomes</link>
	<title><![CDATA[Kevler: Reference-free variant discovery in large eukaryotic genomes]]></title>
	<description><![CDATA[<p><span>Welcome to&nbsp;</span><span>kevlar</span><span>, software for predicting&nbsp;</span><em>de novo</em><span>&nbsp;genetic variants without mapping reads to a reference genome! kevlar's&nbsp;</span><em>k</em><span>-mer abundance based method calls single nucleotide variants (SNVs), multinucleotide variants (MNVs), insertion/deletion variants (indels), and structural variants (SVs) simultaneously with a single simple model.&nbsp;</span></p>
<p><span>More at&nbsp;<a href="https://kevlar.readthedocs.io/en/latest/">https://kevlar.readthedocs.io/en/latest/</a></span></p>
<p><span><a href="https://www.cell.com/iscience/pdf/S2589-0042(19)30259-7.pdf">https://www.cell.com/iscience/pdf/S2589-0042(19)30259-7.pdf</a></span></p><p>Address of the bookmark: <a href="https://github.com/kevlar-dev/kevlar" rel="nofollow">https://github.com/kevlar-dev/kevlar</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/14904/bioinformatics-jrfsrf-position-at-iari</guid>
  <pubDate>Thu, 04 Sep 2014 04:14:01 -0500</pubDate>
  <link></link>
  <title><![CDATA[Bioinformatics JRF/SRF position at IARI]]></title>
  <description><![CDATA[
<p>DIVISION OF NEMATOLOGY<br />INDIAN AGRICULTURAL RESEARCH INSTITUTE<br />NEW DELHI 110012<br />Applications are invited for the posts of one Junior<br />Research Fellow and one RA in the DBT funded project entitled “ Plant parasitic nematode genome informatics - insilico resource development”. The project is for a period of three years. </p>

<p>Essential qualifications for JRF<br />: M. Sc. in Bioinformatics with experience in Proteomics, genomics and structural biology. Knowledge of programming language, pearl and database – HTML, CSS,php and Java script.<br />Essential qualifications for Research Associate:<br />MSc/MTech in Bioinformatics with three years experience or Ph.D in Bioinformatics with experience in proteomics, genomics and structural biology. Knowledge of programming language, perl and database<br />– HTML, CSS, Java script. NGS sequence assembly and analysis and algorithm designing.<br />Age limit : 35 years maximum (5 year relaxation for SC/ST and women candidates)<br />Emoluments:<br />JRF: 16,000 + 30% HRA<br />.<br />Res Assoc: Rs22,000 + 30% HRA<br />The post is purely temporary in nature and is co-terminus with the project. The appointment would be initially for one year and may be extended further upon satisfactory performance.<br />Interested candidates<br />should send the duly filled application forms (format in the following page ) so as to reach on or before 20.9.2014 along with all the relevant documents.</p>

<p>More at http://www.iari.res.in/files/JRF_RA-03092014-20140903-135319.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/26252/recombination-detection-tool</guid>
	<pubDate>Tue, 02 Feb 2016 10:11:14 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/26252/recombination-detection-tool</link>
	<title><![CDATA[Recombination detection tool]]></title>
	<description><![CDATA[<p>A program to detect recombination hotspots using population genetic data.</p>
<p>More at https://github.com/auton1/LDhot</p><p>Address of the bookmark: <a href="https://github.com/auton1/LDhot" rel="nofollow">https://github.com/auton1/LDhot</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/35033/bbsplit-read-binning-tool-for-metagenomes-and-contaminated-libraries</guid>
	<pubDate>Wed, 03 Jan 2018 00:25:27 -0600</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/35033/bbsplit-read-binning-tool-for-metagenomes-and-contaminated-libraries</link>
	<title><![CDATA[BBSplit: Read Binning Tool for Metagenomes and Contaminated Libraries]]></title>
	<description><![CDATA[<p>BBSplit internally uses BBMap to map reads to multiple genomes at once, and determine which genome they match best. This is different than with ordinary mapping. If a genome (say, human) contains an exact repeat somewhere, reads mapping to it will be mapped ambiguously. But if you want to determine whether reads are mouse or human, it does not matter whether they map ambiguously within human, only whether they are ambiguous between human and mouse. BBSplit tracks this additional ambiguity information and decides how to use it based on the &ldquo;ambig2&rdquo; flag. The normal use of BBSplit is like Seal, either quantifying how many reads go to each reference, or splitting the reads into multiple output files, one per reference. BBSplit can only be run using references indexed with BBSplit, as they contain additional information regarding which sequences came from which reference file.</p><p><span>BBSplit is a tool that bins reads by mapping to multiple references simultaneously, using&nbsp;</span><a href="http://seqanswers.com/forums/showthread.php?t=41057" target="_blank">BBMap</a><span>. The reads go to the bin of the reference they map to best. There are also disambiguation options, such that reads that map to multiple references can be binned with all of them, none of them, one of them, or put in a special "ambiguous" file for each of them. Paired reads will always be kept together.</span><br /><br /><span>For example, if you had a library of something that was contaminated with e.coli and salmonella, you could do this:</span><br /><br /><strong>bbsplit.sh in=reads.fq ref=ecoli.fa,salmonella.fa basename=out_%.fq outu=clean.fq int=t</strong><br /><br /><span>This will produce 3 output files:</span><br /><strong>out_ecoli.fq</strong><span>&nbsp;(ecoli reads)</span><br /><strong>out_salmonella.fq</strong><span>&nbsp;(salmonella reads)</span><br /><strong>clean.fq</strong><span>&nbsp;(unmapped reads)</span><br /><br /><span>In this case, "int=t" means that the input file is paired and interleaved. For single-end reads you would leave that out. For paired reads in 2 files, you would do this:</span><br /><strong>bbsplit.sh in1=reads1.fq in2=reads2.fq ref=ecoli.fa,salmonella.fa basename=out_%.fq outu1=clean1.fq outu2=clean2.fq</strong></p><p><strong><span>BBSplit is available here:</span><br /><a href="https://sourceforge.net/projects/bbmap/" target="_blank">https://sourceforge.net/projects/bbmap/</a></strong></p><p><span>The sensitivity can be raised to be equivalent to BBMap with these flags: "minratio=0.56 minhits=1 maxindel=16000"</span></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/17186/urdip-pune-bioinformatics-srfpa-openings</guid>
  <pubDate>Sat, 20 Sep 2014 20:48:50 -0500</pubDate>
  <link></link>
  <title><![CDATA[URDIP Pune Bioinformatics SRF/PA Openings]]></title>
  <description><![CDATA[
<p>CSIR UNIT FOR RESEARCH AND DEVELOPMENT OF INFORMATION PRODUCTS<br />NCL Campus, S.No.113,114, Pashan, Pune 411 008</p>

<p>ADVERTISEMENT NO. - URDIP/ 5/2014</p>

<p>Learning opportunity for young Science and Engineering professionals to make a career in Information Science Industry CSIR has set up a Unit for Research and Development of Information Products (CSIR-URDIP) at Pune to work in the area of Scientific Informatics (ChemBioinformatics/Patent Informatics/Phytoinformatics/Toxinformatics) and related<br />software development projects.</p>

<p>Applications are invited from CSIR - UGC NET Qualified Candidates for consideration as Project Fellow (PF) and/or Senior Project Fellow (SPF) based on the experience to work on existing and new projects at CSIRURDIP.</p>

<p>Project Fellow</p>

<p>    Remuneration - (Rs. 16,000.00 + 20% HRA)</p>

<p>    M. Sc. In Biochemistry/Microbiology/Bioinformatics [Post-code A02] only with minimum of 55% marks</p>

<p>Senior Project Fellow</p>

<p>    Remuneration - (Rs. 18,000.00 + 20% HRA)</p>

<p>    M. Sc. in Biochemistry/Microbiology/Bioinformatics [Post-code A05] only with minimum of 55% marks plus two years research or relevant informatics experience</p>

<p>Please visit www.urdip.res.in/career.htm to apply online by 30th September, 2014.</p>

<p>Successful candidates who have appeared for NET exam in 2012 and 2013 are only eligible to apply.</p>

<p>Advertisement: http://115.112.95.114/urhr/download/Advt5_2014.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38304/lordfast-sensitive-and-fast-alignment-search-tool-for-long-noisy-read-sequencing-data</guid>
	<pubDate>Tue, 27 Nov 2018 04:43:57 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38304/lordfast-sensitive-and-fast-alignment-search-tool-for-long-noisy-read-sequencing-data</link>
	<title><![CDATA[lordFAST: sensitive and Fast Alignment Search Tool for LOng noisy Read sequencing Data]]></title>
	<description><![CDATA[<p><span>lordFAST is a sensitive tool for mapping long reads with high error rates. lordFAST is specially designed for aligning reads from PacBio sequencing technology but provides the user the ability to change alignment parameters depending on the reads and application.</span></p>
<p>lordFAST, a novel long-read mapper that is specifically designed to align reads generated by PacBio and potentially other SMS technologies to a reference. lordFAST not only has higher sensitivity than the available alternatives, it is also among the fastest and has a very low memory footprint.</p>
<p>&nbsp;</p><p>Address of the bookmark: <a href="https://github.com/vpc-ccg/lordfast" rel="nofollow">https://github.com/vpc-ccg/lordfast</a></p>]]></description>
	<dc:creator>BioJoker</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/17189/bioinformatics-svims-project-assistant-walk-in</guid>
  <pubDate>Sat, 20 Sep 2014 21:02:29 -0500</pubDate>
  <link></link>
  <title><![CDATA[Bioinformatics SVIMS Project Assistant Walk IN]]></title>
  <description><![CDATA[
<p>SRI VENKATESWARA INSTITUTE OF MEDICAL SCIENCES<br />TIRUPATI, ANDHRA PRADESH, INDIA- 517 507<br />BIOINFORMATICS CENTRE, DEPARTMENT OF BIOINFORMATICS</p>

<p>Eligible candidates are invited for a walk-in-interview for recruitment of Project Assistant in SVIMS Bioinformatics centre under the BTISnet Project entitled “Creation of Bioinformatics Infrastructure Facility for promotion of Biology teaching through Bioinformatics” on 25.09.2014 at 11 AM in SVIMS, Tirupati. The engagement will be made purely on temporary basis for a period of one year and it can be terminated at any time without notice or without assigning any reason thereof by the Coordinator of the Project. The person engaged shall not be entitled for any claim implicit or explicit for absorption in the University.</p>

<p>1. Name of the post : Project Assistant</p>

<p>2. Qualification :<br />i) Essential : MSc Bioinformatics/MTech (Biotechnology/Bioinformatics)</p>

<p>ii) Desirable : Experience in Bioinformatics research work (Preference will be given to candidates  qualified in BINC/UGC/CSIR/NET/GATE)</p>

<p>3. Remuneration : 16000 + 10% HRA for NET/GATE candidates 14000 + 10% HRA for M. Tech / M.Sc. Candidates</p>

<p>4. Place of posting : Tirupati</p>

<p>5. Duration of the Project : One year</p>

<p>Terms and conditions:</p>

<p>1. Candidates are required to submit the Biodata relevant certificates in support of their age and educational qualification etc., before the interview committee, SVIMS University, Tirupati.</p>

<p>2. Candidates called for interview will attend the interview at their own cost.<br />3. Interim enquiries will not be entertained.<br />4. The maximum age limit for Project Assistant is 28 years for general category and 33 years for SC and ST category candidates as on 25th September, 2014.</p>

<p>Advertisement:</p>

<p>http://svr98.ehostpros.com/~svimsb98/Project%20Assistant_notification.pdf</p>
]]></description>
</item>

</channel>
</rss>