<?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/19786?offset=1290</link>
	<atom:link href="https://bioinformaticsonline.com/related/19786?offset=1290" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	
<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/17515/ngs-online-training</guid>
  <pubDate>Sat, 27 Sep 2014 07:42:29 -0500</pubDate>
  <link></link>
  <title><![CDATA[NGS Online Training]]></title>
  <description><![CDATA[
<p>ArrayGen Technologies announces to provide online NGS training through out the globe. Now analyze your own NGS datasets from anywhere.For more information contact us at training@arraygen.com</p>

<p>Please visit our site at www.arraygen.com</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/40416/5700-year-old-human-genome</guid>
	<pubDate>Thu, 19 Dec 2019 11:22:18 -0600</pubDate>
	<link>https://bioinformaticsonline.com/news/view/40416/5700-year-old-human-genome</link>
	<title><![CDATA[5700 year-old human genome !]]></title>
	<description><![CDATA[<p>A Landmark in genomics, scientists have done something that hasn't been done ever.</p><p>Scientists have reconstructed the genome of an ancient human who lived nearly 5,700 years ago in Southern Denmark from the birch pitch- an ancient tar-like substance.</p><p>By sequencing the sample, researchers not only discovered the ancient human DNA but also microbial DNA reflecting the oral microbiome of the person who chewed the pitch, along with plant and animal DNA that could be the recent<span> meal she might have consumed.</span></p><p><span style="font-size: 12.8px;">The DNA sample is comparable in quality to well-preserved teeth and skull bones. The DNA suggests that the chewer was a female, most likely with dark skin, dark brown hair and blue eyes.</span></p><div><p><a href="https://www.nature.com/articles/s41467-019-13549-9?fbclid=IwAR0FPk0Cl25YjHVdcfK4tqFhCsPx00SCSMUwlU6zNwMDNrKi1QynwtJKDfE" target="_blank">https://www.nature.com/articles/s41467-019-13549-9</a></p><p><img src="https://i.kinja-img.com/gawker-media/image/upload/c_scale,f_auto,fl_progressive,q_80,w_800/ykcvh491evenyvlrjb9r.jpg" width="800" height="450" alt="image" style="border: 0px;"></p><p>Artistic reconstruction. (Tom Bj&ouml;rklund)</p><p>More at&nbsp;<a href="https://gizmodo.com/scientists-reconstruct-lola-after-finding-her-dna-in-1840481633">https://gizmodo.com/scientists-reconstruct-lola-after-finding-her-dna-in-1840481633</a></p></div>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/17966/internship-program-for-bioinformatics-biotechnology-professionals-no-of-vacancy-2</guid>
  <pubDate>Wed, 08 Oct 2014 01:10:08 -0500</pubDate>
  <link></link>
  <title><![CDATA[Internship Program for Bioinformatics / Biotechnology Professionals (No. Of Vacancy: 2)]]></title>
  <description><![CDATA[
<p>ArrayGen is offering an Internship Program for Post graduate Bioinformatics / Biotechnology students and professionals. ArrayGen Technologies provide an excellent opportunity to gain research experience and explore if a scientific career is right for you. Currently we offer positions to outstanding students interested in Next Generation Sequencing (NGS) data analysis. Applications are accepted throughout the year. Accepted students will be listed on web with their schedules. Accepted students can attend our future workshops and trainings freely at the specified venue.</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40715/mutatrix-a-population-genome-simulator-which-generates-simulated-genomes</guid>
	<pubDate>Tue, 28 Jan 2020 04:06:58 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40715/mutatrix-a-population-genome-simulator-which-generates-simulated-genomes</link>
	<title><![CDATA[mutatrix: a population genome simulator which generates simulated genomes.]]></title>
	<description><![CDATA[<p><span>genome simulation across a population with zeta-distributed allele frequency, snps, insertions, deletions, and multi-nucleotide polymorphisms</span></p>
<p><span>More at&nbsp;<a href="https://github.com/ekg/mutatrix">https://github.com/ekg/mutatrix</a></span></p>
<pre>./mutatrix -S sample -P test/ -p 2 -n 10 reference.fasta</pre><p>Address of the bookmark: <a href="https://github.com/ekg/mutatrix" rel="nofollow">https://github.com/ekg/mutatrix</a></p>]]></description>
	<dc:creator>Jit</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/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/opportunity/view/18820/jrfsrf-at-university-of-calcutta</guid>
  <pubDate>Fri, 31 Oct 2014 08:53:10 -0500</pubDate>
  <link></link>
  <title><![CDATA[JRF/SRF at University of Calcutta]]></title>
  <description><![CDATA[
<p>Applications are invited to appear at a walk-in-interview for one post of Junior Research Fellow in the DBT(DBT Twinning NER) sponsored project entitled “Protein folding kinetics is a selection force on shaping codon usage bias in the high expression genes” in the room of the HOD, Department of Biotechnology and the Coordinator, DR. B. C. Guha Centre for Genetic Engineering and Biotechnology, University College of Science, 35 Ballygunge Circular Road, Kolkata 700019 on the 12th November, 2014 at 3:00 p.m.</p>

<p>Essential qualifications: First class M. Sc. in any branch of life sciences and qualified CSIR-UGC NET/GATE Examination.</p>

<p>Desirable qualifications: Practical experience in biochemical and biophysical studies of proteins</p>

<p>Emoluments: as per DBT norms</p>

<p>The project is tenable for two years, initially for one year.</p>

<p>Age: Below 28 years (relaxable in the case of SC/ST/OBC/women candidates)</p>

<p>Candidates are requested to bring two sets of complete applications on plain paper furnishing bio-data and copies of attested certificates along with originals (for verification) on the date of interview.</p>

<p>No TA/DA is admissible for candidates appearing at the interview.</p>

<p>Dr. Rajat Banerjee<br />Assistant Professor<br />Department of Biotechnology and<br />Dr. B. C. Guha Centre for Genetic Engineering and Biotechnology<br />University College of Science<br />35, Ballygunge Circular Road<br />Kolkata 700019</p>

<p>Advertisement: www.caluniv.ac.in/news/jrf_biotech_2.pdf</p>
]]></description>
</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/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/43057/hapsolo-an-optimization-approach-for-removing-secondary-haplotigs-during-diploid-genome-assembly-and-scaffolding</guid>
	<pubDate>Sat, 08 May 2021 21:25:00 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43057/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>HapSolo, that identifies secondary contigs and defines a primary assembly based on multiple pairwise contig alignment metrics. HapSolo evaluates candidate primary assemblies using BUSCO scores and then distinguishes among candidate assemblies using a cost function. The cost function can be defined by the user but by default considers the number of missing, duplicated and single BUSCO genes within the assembly. HapSolo performs hill climbing to minimize cost over thousands of candidate assemblies.&nbsp;</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>

</channel>
</rss>