<?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/27216?offset=520</link>
	<atom:link href="https://bioinformaticsonline.com/related/27216?offset=520" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/14024/grapher</guid>
	<pubDate>Thu, 14 Aug 2014 14:02:17 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/14024/grapher</link>
	<title><![CDATA[GrapheR !!!]]></title>
	<description><![CDATA[<p>What a wonderful gem <em>GrapheR</em> is.... Oh yes it is. <em>GrapheR</em> is a GUI for base graphics in R by http://www.maximeherve.com/. The package provides a graphical user interface for creating base charts in R. It is ideal for beginners in R, as the user interface is very clear and the code is written along side into a text file, allowing users to recreate the charts directly in the console. <br /><br />Adding and changing legends? Messing around with the plotting window settings? It is much easier/quicker with this GUI than reading the help file and trying to understand the various parameters.<br />Here is a little example using the iris data set.<br /><br />library(GrapheR)<br />data(iris)<br />run.GrapheR()<br /><br />This will bring up a window that helps me to create the chart and tweak the various parameters.</p><p><img src="http://4.bp.blogspot.com/-NbnCM1dPh3E/U9aW9YxJ9oI/AAAAAAAABgo/gEPzPhOpf2Y/s1600/GrapheR.png" alt="image" width="878" height="868" style="border: 0px; border: 0px;"><br /><br />Finally, I find the underlying R code in a file created by <em>GrapheR</em>. For more details read also the <a href="http://cran.r-project.org/web/packages/GrapheR/index.html" target="_blank">package vignette</a>, which is available in <a href="http://cran.r-project.org/web/packages/GrapheR/vignettes/manual_en.pdf" target="_blank">English</a>, <a href="http://cran.r-project.org/web/packages/GrapheR/vignettes/manual_fr.pdf" target="_blank">French</a> and <a href="http://cran.r-project.org/web/packages/GrapheR/vignettes/manual_de.pdf" target="_blank">German</a>!</p>]]></description>
	<dc:creator>John Parker</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41144/seqmule-automated-human-exomegenome-variants-detection</guid>
	<pubDate>Tue, 18 Feb 2020 03:22:54 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41144/seqmule-automated-human-exomegenome-variants-detection</link>
	<title><![CDATA[SeqMule: Automated human exome/genome variants detection]]></title>
	<description><![CDATA[<p>SeqMule takes single-end or paird-end FASTQ or BAM files, generates a script consisting of more than 10 popular alignment, analysis tools and runs the script line by line. Users can change the pipeline or fine-tune the parameters by modifying its configuration file.</p><p>Address of the bookmark: <a href="https://doc-openbio.readthedocs.io/projects/seqmule/en/latest/" rel="nofollow">https://doc-openbio.readthedocs.io/projects/seqmule/en/latest/</a></p>]]></description>
	<dc:creator>BioStar</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/41459/jcvipython-utility-libraries-on-genome-assembly-annotation-and-comparative-genomics</guid>
	<pubDate>Tue, 17 Mar 2020 06:19:06 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41459/jcvipython-utility-libraries-on-genome-assembly-annotation-and-comparative-genomics</link>
	<title><![CDATA[JCVI:Python utility libraries on genome assembly, annotation and comparative genomics]]></title>
	<description><![CDATA[<p>Collection of Python libraries to parse bioinformatics files, or perform computation related to assembly, annotation, and comparative genomics.</p>
<p>https://github.com/tanghaibao/jcvi</p>
<p>More at https://github.com/tanghaibao/jcvi/wiki</p><p>Address of the bookmark: <a href="https://github.com/tanghaibao/jcvi" rel="nofollow">https://github.com/tanghaibao/jcvi</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41599/haslr-a-hybrid-assembler-which-uses-both-second-and-third-generation-sequencing-reads</guid>
	<pubDate>Mon, 04 May 2020 02:04:03 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41599/haslr-a-hybrid-assembler-which-uses-both-second-and-third-generation-sequencing-reads</link>
	<title><![CDATA[HASLR: a hybrid assembler which uses both second and third generation sequencing reads]]></title>
	<description><![CDATA[<p><span>HASLR, a hybrid assembler which uses both second and third generation sequencing reads to efficiently generate accurate genome assemblies. Our experiments show that HASLR is not only the fastest assembler but also the one with the lowest number of misassemblies on all the samples compared to other tested assemblers. Furthermore, the generated assemblies in terms of contiguity and accuracy are on par with the other tools on most of the samples. Availability. HASLR is an open source tool available at https://github.com/vpc-ccg/haslr.</span></p><p>Address of the bookmark: <a href="https://github.com/vpc-ccg/haslr" rel="nofollow">https://github.com/vpc-ccg/haslr</a></p>]]></description>
	<dc:creator>BioStar</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/42267/hapsolo-an-optimization-approach-for-removing-secondary-haplotigs-during-diploid-genome-assembly-and-scaffolding</guid>
	<pubDate>Mon, 26 Oct 2020 21:23:36 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42267/hapsolo-an-optimization-approach-for-removing-secondary-haplotigs-during-diploid-genome-assembly-and-scaffolding</link>
	<title><![CDATA[HapSolo: An optimization approach for removing secondary haplotigs during diploid genome assembly and scaffolding.]]></title>
	<description><![CDATA[<p><span>Despite marked recent improvements in long-read sequencing technology, the assembly of diploid genomes remains a difficult task. A major obstacle is distinguishing between alternative contigs that represent highly heterozygous regions. If primary and secondary contigs are not properly identified, the primary assembly will overrepresent both the size and complexity of the genome, which complicates downstream analysis such as scaffolding.</span></p>
<p><span>More at&nbsp;https://github.com/esolares/HapSolo</span></p><p>Address of the bookmark: <a href="https://github.com/esolares/HapSolo" rel="nofollow">https://github.com/esolares/HapSolo</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43055/infogenomer-integrative-reconstruction-of-cancer-genome-karyotypes</guid>
	<pubDate>Wed, 05 May 2021 01:02:18 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43055/infogenomer-integrative-reconstruction-of-cancer-genome-karyotypes</link>
	<title><![CDATA[InfoGenomeR: Integrative reconstruction of cancer genome karyotypes]]></title>
	<description><![CDATA[<p>InfoGenomeR is the Integrative Framework for Genome Reconstruction that uses a breakpoint graph to model the connectivity among genomic segments at the genome-wide scale. InfoGenomeR integrates cancer purity and ploidy, total CNAs, allele-specific CNAs, and haplotype information to identify the optimal breakpoint graph representing cancer genomes.</p>
<p><img src="https://github.com/YeonghunL/InfoGenomeR/raw/master/doc/overview.png" alt="image" style="border: 0px; border: 0px;"></p>
<p>More at&nbsp;https://www.nature.com/articles/s41467-021-22671-6</p><p>Address of the bookmark: <a href="https://github.com/dmcblab/InfoGenomeR" rel="nofollow">https://github.com/dmcblab/InfoGenomeR</a></p>]]></description>
	<dc:creator>Jit</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/43273/understanding-kmer</guid>
	<pubDate>Wed, 18 Aug 2021 04:27:51 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43273/understanding-kmer</link>
	<title><![CDATA[Understanding kmer !]]></title>
	<description><![CDATA[<p><a href="https://en.wikipedia.org/wiki/k-mer">What is a&nbsp;<em>k-mer</em>&nbsp;anyway?</a><span>&nbsp;A&nbsp;</span><em>k-mer</em><span>&nbsp;is just a sequence of&nbsp;</span><em>k</em><span>&nbsp;characters in a string (or nucleotides in a DNA sequence). Now, it is important to remember that to get&nbsp;</span><em>all k-mers</em><span>&nbsp;from a sequence you need to get the first&nbsp;</span><em>k</em><span>&nbsp;characters, then move just a single character for the start of the next&nbsp;</span><em>k-mer</em><span>&nbsp;and so on. Effectively, this will create sequences that overlap in&nbsp;</span><code>k-1</code><span>&nbsp;positions.</span></p><p>Address of the bookmark: <a href="https://bioinfologics.github.io/post/2018/09/17/k-mer-counting-part-i-introduction/" rel="nofollow">https://bioinfologics.github.io/post/2018/09/17/k-mer-counting-part-i-introduction/</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>

</channel>
</rss>