<?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/27113?offset=1180</link>
	<atom:link href="https://bioinformaticsonline.com/related/27113?offset=1180" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41592/refka-a-fast-and-efficient-long-read-genome-assembly-approach-for-large-and-complex-genomes</guid>
	<pubDate>Fri, 01 May 2020 03:00:40 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41592/refka-a-fast-and-efficient-long-read-genome-assembly-approach-for-large-and-complex-genomes</link>
	<title><![CDATA[RefKA: A fast and efficient long-read genome assembly approach for large and complex genomes]]></title>
	<description><![CDATA[<p><span>RefKA, a reference-based approach for long read genome assembly. This approach relies on breaking up a closely related reference genome into bins, aligning k-mers unique to each bin with PacBio reads, and then assembling each bin in parallel followed by a final bin-stitching step.</span></p>
<p>&nbsp;</p><p>Address of the bookmark: <a href="https://github.com/AppliedBioinformatics/RefKA" rel="nofollow">https://github.com/AppliedBioinformatics/RefKA</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29578/plink2</guid>
	<pubDate>Thu, 27 Oct 2016 11:24:45 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29578/plink2</link>
	<title><![CDATA[PLINK2]]></title>
	<description><![CDATA[<p><span>This is a comprehensive update to Shaun Purcell's&nbsp;</span><a href="http://pngu.mgh.harvard.edu/~purcell/plink/">PLINK</a><span>&nbsp;command-line program, developed by&nbsp;</span><a href="mailto:chrchang@alumni.caltech.edu">Christopher Chang</a><span>&nbsp;with support from the&nbsp;</span><a href="http://www.niddk.nih.gov/">NIH-NIDDK</a><span>'s Laboratory of Biological Modeling, the&nbsp;</span><a href="http://research.mssm.edu/statgen/">Purcell Lab</a><span>&nbsp;at Mount Sinai School of Medicine, and others. (</span><a href="https://www.cog-genomics.org/plink2/#new">What's new?</a><span>) (</span><a href="https://www.cog-genomics.org/plink2/credits">Credits.</a><span>) (</span><a href="http://www.gigasciencejournal.com/content/4/1/7">Methods paper.</a><span>)</span></p><p>Address of the bookmark: <a href="https://www.cog-genomics.org/plink2/" rel="nofollow">https://www.cog-genomics.org/plink2/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42806/graphunzip-phases-an-assembly-graph-using-hi-c-data-andor-long-reads</guid>
	<pubDate>Fri, 05 Feb 2021 21:22:24 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42806/graphunzip-phases-an-assembly-graph-using-hi-c-data-andor-long-reads</link>
	<title><![CDATA[GraphUnzip: Phases an assembly graph using Hi-C data and/or long reads.]]></title>
	<description><![CDATA[<p>GraphUnzip, a fast, memory-efficient and accurate tool to unzip assembly graphs into their constituent haplotypes using long reads and/or Hi-C data. As GraphUnzip only connects sequences in the assembly graph that already had a potential link based on overlaps, it yields high-quality gap-less supercontigs. To demonstrate the efficiency of GraphUnzip, we tested it on a simulated diploid Escherichia coli genome, and on two real datasets for the genomes of the rotifer Adineta vaga and the potato Solanum tuberosum. In all cases, GraphUnzip yielded highly continuous phased assemblies.</p>
<p>https://www.biorxiv.org/content/biorxiv/early/2021/02/01/2021.01.29.428779.full.pdf</p><p>Address of the bookmark: <a href="https://github.com/nadegeguiglielmoni/GraphUnzip" rel="nofollow">https://github.com/nadegeguiglielmoni/GraphUnzip</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/29624/information-officer-at-iiar-gujarat</guid>
  <pubDate>Fri, 04 Nov 2016 05:19:13 -0500</pubDate>
  <link></link>
  <title><![CDATA[Information Officer at IIAR, Gujarat]]></title>
  <description><![CDATA[
<p>Walk in interview at 10.30 am on Nov 11th, 2016 for the following position at Distributed Information Sub-Centre (DISC) established by Dept. Of Biotechnology, Govt. of India at Indian Institute of Advanced Research, Gandhinagar, Gujarat</p>

<p>Position (scale), qualifications and experience</p>

<p>1. Information Officer (Rs 8000-275-13500): one post <br />Qualifications and experience: MCA, Post-Graduate in any field of biosciences, bioinformatics with at least two years of experience in working in a bioinformatics setup and good knowledge of linux operating system and computer networking.</p>

<p>General terms and conditions: <br />1. The above engagements is presently till March 31st, 2017. However on extension of project grant and satisfactory performance of the candidate, your services can be extended beyond March 31st, 2017 based on the terms and conditions of extension of project grant.</p>

<p>2. It is not an appointment with the institute and will not confer any right to the incumbent to any claim implicit or explicit on any position.</p>

<p>3.No TA/DA will be paid for attending the interview. Outstation candidates have to make their own arrangement for their stay.</p>

<p>4.Candidates, appearing in the walk-in interview are requested to bring the hard copy of application addressed to Dr. Anju Pappachan with latest photograph, CV mentioning qualifications, work experience and name of two referees and one page write up as to why you would like to join the project.</p>

<p>Address: <br />Dr. Anju Pappachan <br />Indian Institute of Advanced Research (IIAR), <br />University  and Institute of Advanced Research, <br />The Puri Foundation for Education in India, <br />Koba Institutional Area, <br />Gandhinagar- 382 007, Gujarat, India. Contact no. 079-30514152 <br />e-mail- anju@iiar.res.in</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/file/view/43732/spades-tutorial-pdf</guid>
	<pubDate>Tue, 01 Feb 2022 04:56:43 -0600</pubDate>
	<link>https://bioinformaticsonline.com/file/view/43732/spades-tutorial-pdf</link>
	<title><![CDATA[Spades tutorial PDF]]></title>
	<description><![CDATA[<p>SPAdes&mdash;St. Petersburg genome Assembler&mdash;was originally developed for de novo assembly of genome sequencing data produced for cultivated microbial isolates and for single-cell genomic DNA sequencing. With time, the functionality of SPAdes was extended to enable assembly of IonTorrent data, as well as hybrid assembly from short and long reads (PacBio and Oxford Nanopore). In this article we present protocols for five different assembly pipelines that comprise the SPAdes package and that are used for assembly of metagenomes and transcriptomes as well as assembly of putative plasmids and biosynthetic gene clusters from whole-genome sequencing and metagenomic datasets.&nbsp;</p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
	<enclosure url="https://bioinformaticsonline.com/file/download/43732" length="268093" type="application/pdf" />
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/29644/junior-research-fellow-at-rajiv-gandhi-centre-for-biotechnology-thiruvananthapuram</guid>
  <pubDate>Mon, 07 Nov 2016 10:27:06 -0600</pubDate>
  <link></link>
  <title><![CDATA[Junior Research Fellow at Rajiv Gandhi Centre for Biotechnology, Thiruvananthapuram]]></title>
  <description><![CDATA[
<p>Adv. # 22/ 2016<br />Applications are invited from suitable candidates for one position of Junior Research Fellow in a DST funded bioinformatics research project entitled "Major gene influxes in microbial genome evolution" in the Laboratory of Dr. Shijulal Nelson-Sathi at Rajiv Gandhi Centre for Biotechnology, Thiruvananthapuram.</p>

<p>ESSENTIAL QUALIFICATIONS:<br />We are looking for a motivated candidate with keen interest in bioinformatics and microbial genome evolution. The candidate must have a Master’s Degree in Bioinformatics, Computational Biology, Computer Science, Microbiology, Biology or a related field with good academic record.</p>

<p>DESIRABLE QUALIFICATIONS<br />Hands on research experience on handling next generation sequencing data and phylogenetic reconstruction methods. Excellent programming skills (Perl/Python/Java/Php) and experience in working on Unix/Linux platform is preferred. Furthermore; good knowledge is required in statistics (R/Matlab) and the application of bioinformatics analysis tools.</p>

<p>AGE:<br />Below 28 years as on 15th November, 2016.</p>

<p>EMOLUMENTS:<br />Rs. 25,000 + 20% HRA for NET/GATE qualified and Post Graduate in Professional Degree course qualified candidates and <br />Rs. 12,000/- + 20% HRA for others.</p>

<p>DURATION:<br />Initial appointment will be given for one year and further extension will be based on the performance till termination of the project.<br />Only those fulfilling the above criteria need apply and will be called for interview. In the event of more than 10 candidates being short-listed by screening the applications, a written test will be conducted before the selection interview and only those who are successful in the written test will be interviewed. No TA/ DA will be given for appearing in the interview.</p>

<p>Suitably qualified candidates may send applications in the prescribed format (Download here) with a photograph, a copy of full resume indicating the percentage of Marks obtained and attested photocopies of credentials &amp; experience to reach the undersigned on or before 15th November, 2016. Envelopes must be superscripted with abbreviated title of the project, advertisement number and job title. Selection to the position will not entitle the candidate to any future positions at RGCB (permanent or otherwise). As with all project positions at RGCB, the position will be co terminus with end of the project.</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44529/contigextender-a-new-approach-to-improving-de-novo-sequence-assembly-for-viral-metagenomics-data</guid>
	<pubDate>Wed, 08 May 2024 07:32:45 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44529/contigextender-a-new-approach-to-improving-de-novo-sequence-assembly-for-viral-metagenomics-data</link>
	<title><![CDATA[ContigExtender: a new approach to improving de novo sequence assembly for viral metagenomics data]]></title>
	<description><![CDATA[<p dir="auto">ContigExtender, was developed to extend contigs, complementing de novo assembly. ContigExtender employs a novel recursive Overlap Layout Candidates (r-OLC) strategy that explores multiple extending paths to achieve longer and highly accurate contigs. ContigExtender is effective for extending contigs significantly in in silico synthesized and real metagenomics datasets.</p>
<p dir="auto">More at&nbsp;https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7953547/</p>
<p dir="auto"><a href="https://camo.githubusercontent.com/72dc78177cd84dd0c667a2922a9fd984fb548b5ec94b11f9a547211a4adba3b1/68747470733a2f2f692e696d6775722e636f6d2f7734516944496a2e706e67" target="_blank"><img src="https://camo.githubusercontent.com/72dc78177cd84dd0c667a2922a9fd984fb548b5ec94b11f9a547211a4adba3b1/68747470733a2f2f692e696d6775722e636f6d2f7734516944496a2e706e67" alt="extension process" title="extension process" style="border: 0px;"></a></p><p>Address of the bookmark: <a href="https://github.com/dengzac/contig-extender" rel="nofollow">https://github.com/dengzac/contig-extender</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29658/bookmarks-biostatistics-materials-and-books</guid>
	<pubDate>Tue, 08 Nov 2016 07:42:42 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29658/bookmarks-biostatistics-materials-and-books</link>
	<title><![CDATA[Bookmarks Biostatistics materials and books]]></title>
	<description><![CDATA[<p>Biostatistics did not spring fully formed from the brow of R. A. Fisher, but evolved over many years. This process is continuing, although it may not be obvious from the outside. It has been ten years since the first edition of this book appeared (and rather longer since it was begun). Over this time, new areas of biostatistics have been developed and emphases and interpretations have changed</p>
<p>Please bookmarks your favourate biostatistics&nbsp;books in commend sectons ...</p><p>Address of the bookmark: <a href="http://www.cos.ufrj.br/~bioestatistica/livros/Introduction%20to%20Biostatistics.pdf" rel="nofollow">http://www.cos.ufrj.br/~bioestatistica/livros/Introduction%20to%20Biostatistics.pdf</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44513/mike-an-ultrafast-assembly-and-alignment-free-approach-for-phylogenetic-tree-construction</guid>
	<pubDate>Mon, 08 Apr 2024 06:19:52 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44513/mike-an-ultrafast-assembly-and-alignment-free-approach-for-phylogenetic-tree-construction</link>
	<title><![CDATA[MIKE: an ultrafast, assembly-, and alignment-free approach for phylogenetic tree construction]]></title>
	<description><![CDATA[<p><span>MIKE (MinHash-based&nbsp;</span><em>k</em><span>-mer algorithm). This algorithm is designed for the swift calculation of the Jaccard coefficient directly from raw sequencing reads and enables the construction of phylogenetic trees based on the resultant Jaccard coefficient. Simulation results highlight the superior speed of MIKE compared to existing state-of-the-art methods. We used MIKE to reconstruct a phylogenetic tree, incorporating 238 yeast, 303&nbsp;</span><em>Zea</em><span>, 141&nbsp;</span><em>Ficus</em><span>, 67&nbsp;</span><em>Oryza</em><span>, and 43&nbsp;</span><em>Saccharum spontaneum</em><span>&nbsp;samples. MIKE demonstrated accurate performance across varying evolutionary scales, reproductive modes, and ploidy levels, proving itself as a powerful tool for phylogenetic tree construction.</span></p><p>Address of the bookmark: <a href="https://github.com/Argonum-Clever2/mike" rel="nofollow">https://github.com/Argonum-Clever2/mike</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/29842/research-assistant-bioinformatics-recruitment-in-national-institute-of-cancer-prevention-research-icmr-on-contract-basis</guid>
  <pubDate>Tue, 15 Nov 2016 17:15:48 -0600</pubDate>
  <link></link>
  <title><![CDATA[Research Assistant Bioinformatics recruitment in National Institute Of Cancer Prevention &amp; Research (ICMR) on Contract basis]]></title>
  <description><![CDATA[
<p>National Institute Of Cancer Prevention &amp; Research - ICMR</p>

<p>Research Assistant Bioinformatics recruitment in National Institute Of Cancer Prevention &amp; Research (ICMR) on Contract basis <br />Project entitled: “Next generation EGFR inhibitor identification using ligand based QSAR technique” </p>

<p>Essential: M.Sc. in Bioinformatics or related field. Desirable: Experience in QSAR and structure based drug designing.<br />Age: 28 years<br />No.of Post: 1</p>

<p>Pay Scale : Rs.27000</p>

<p>Application format is attached and should be sent by post to Dr. Subhash M Agarwal, Scientist D, Division of Bioinformatics, National Institute of Cancer Prevention &amp; Research (ICMR), Plot No. I-7, Sector-39, Noida 201301 (U.P).</p>

<p>More at http://www.icmr.nic.in/icmrnews/NICPR_Advertisement%20for%20RA.pdf</p>
]]></description>
</item>

</channel>
</rss>