<?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/28906?offset=1540</link>
	<atom:link href="https://bioinformaticsonline.com/related/28906?offset=1540" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39450/apollo-first-instantaneous-collaborative-genomic-annotation-editor-available-on-the-web</guid>
	<pubDate>Fri, 31 May 2019 19:55:39 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39450/apollo-first-instantaneous-collaborative-genomic-annotation-editor-available-on-the-web</link>
	<title><![CDATA[Apollo: First instantaneous, collaborative genomic annotation editor available on the Web]]></title>
	<description><![CDATA[<ul>
<li>Apollo is a plug-in for the&nbsp;<a href="http://jbrowse.org/">JBrowse</a>&nbsp;Genome Viewer.</li>
<li>In addition to genes and pseudogenes, users can annotate ncRNAs (snRNA, snoRNA, tRNA, rRNA), miRNAs, repeat regions, and transposable elements; each annotation type has its own configuration of the &lsquo;Information Editor&rsquo;.</li>
<li>History tracking with undo/redo functions is available.</li>
<li>Users are able to directly set an annotation to a specific state, choosing from the &lsquo;History&rsquo; display.</li>
<li>Adding and updating PubMed IDs will prompt users with a publication title to confirm their submission.</li>
<li>Gene Ontology (GO) terms are supported and GO ID auto-completion has been incorporated.</li>
<li>Users may access a &lsquo;Recent Changes&rsquo; page.</li>
<li>Help page with Apollo specific content is available.</li>
</ul><p>Address of the bookmark: <a href="http://genomearchitect.github.io/" rel="nofollow">http://genomearchitect.github.io/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/10182/biocodesbioscripts</guid>
	<pubDate>Tue, 22 Apr 2014 20:53:33 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/10182/biocodesbioscripts</link>
	<title><![CDATA[BioCodes/BioScripts]]></title>
	<description><![CDATA[<p>Over the years most bioinformatics people amass a collection of small utility scripts which make their lives easier. Too often they are kept either in private repositories or as part of a public collection to which noone else can contribute. Biocode is a curated repository of general-use utility scripts.</p>
<p>Algorithms scripts @ https://github.com/jschendel/bioinformatics-algorithms-coursera</p><p>Address of the bookmark: <a href="https://github.com/jorvis/biocode" rel="nofollow">https://github.com/jorvis/biocode</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40302/simug-a-general-purpose-genome-simulator</guid>
	<pubDate>Thu, 28 Nov 2019 04:33:18 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40302/simug-a-general-purpose-genome-simulator</link>
	<title><![CDATA[simuG: a general-purpose genome simulator]]></title>
	<description><![CDATA[<p><span>Simulated genomes with pre-defined and random genomic variants can be very useful for benchmarking genomic and bioinformatics analyses. Here we introduce simuG, a lightweight tool for simulating the full-spectrum of genomic variants (single nucleotide polymorphisms, Insertions/Deletions, copy number variants, inversions and translocations) for any organisms (including human). The simplicity and versatility of simuG make it a unique general-purpose genome simulator for a wide-range of simulation-based applications.</span></p><p>Address of the bookmark: <a href="https://github.com/yjx1217/simuG" rel="nofollow">https://github.com/yjx1217/simuG</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/10459/associate-professor-bio-informatics-at-university-of-allahabad-in-allahabad</guid>
  <pubDate>Wed, 07 May 2014 00:26:53 -0500</pubDate>
  <link></link>
  <title><![CDATA[Associate Professor - Bio-Informatics at University of Allahabad in Allahabad]]></title>
  <description><![CDATA[
<p>No of vacancies: 01</p>

<p>Pay scale: Pay Band of Rs. 37400-67000 with AGP of Rs. 9000.</p>

<p>i. Educational Qualification: Good academic record with a Ph.D. Degree in the concerned/allied/relevant disciplines.</p>

<p>ii. A Master's Degree with at least 55% marks (or an equivalent grade in a point scale wherever grading system is followed).</p>

<p>iii. A minimum of eight years of experience of teaching and/or research in an academic/research position equivalent to that of Assistant Professor in a University, College or Accredited Research Institution/industry excluding the period of Ph.D. research with evidence of published work and a minimum of 5 publications as books and/or research/policy papers.</p>

<p>iv. Contribution to educational innovation, design of new curricula and courses, and technology - mediated teaching learning process with evidence of having guided doctoral candidates and research students.</p>

<p>v. A minimum score as stipulated in the Academic Performance Indicator (API) based Performance Based Appraisal System (PBAS), set out in UGC Regulation.</p>

<p>Download application form from website: http://www.allduniv.ac.in/</p>

<p>Send your application to the Registrar, University of Allahabad, Allahabad-211002 (U.P.) on or before 30th April 2014</p>

<p>For more details: http://www.allduniv.ac.in/images/adv/backlog/advt-details.pdf OR http://www.allduniv.ac.in/images/news/extension-notice.pdf</p>

<p>Last Apply Date: 30 May 2014</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/videolist/watch/10664/dna-replication-process-3d-animation</guid>
	<pubDate>Sat, 10 May 2014 04:41:22 -0500</pubDate>
	<link>https://bioinformaticsonline.com/videolist/watch/10664/dna-replication-process-3d-animation</link>
	<title><![CDATA[DNA Replication Process [3D Animation]]]></title>
	<description><![CDATA[<iframe width="" height="" src="https://www.youtube-nocookie.com/embed/27TxKoFU2Nw" frameborder="0" allowfullscreen></iframe>See an organised list of all the animations: http://doctorprodigious.wordpress.com/hd-animations/]]></description>
	
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/41300/china%E2%80%99s-bgi-says-it-can-sequence-a-genome-for-just-100</guid>
	<pubDate>Sat, 29 Feb 2020 04:49:43 -0600</pubDate>
	<link>https://bioinformaticsonline.com/news/view/41300/china%E2%80%99s-bgi-says-it-can-sequence-a-genome-for-just-100</link>
	<title><![CDATA[China’s BGI says it can sequence a genome for just $100]]></title>
	<description><![CDATA[<p>Using technology originally acquired in the US, the Chinese gene giant BGI Group says it will make genome sequencing cheaper than ever, breaking the $100 barrier for the first time.</p><p>The Shenzhen company says the low cost will be possible with an &ldquo;extreme&rdquo; DNA sequencing system it plans to offer that is capable of decoding the genomes of 100,000 people a year.</p><p>Ref:&nbsp;<a href="https://www.technologyreview.com/s/615289/china-bgi-100-dollar-genome/">https://www.technologyreview.com/s/615289/china-bgi-100-dollar-genome/</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/10748/bioinformatics-phd-at-cuk-kerala</guid>
  <pubDate>Sat, 10 May 2014 20:21:22 -0500</pubDate>
  <link></link>
  <title><![CDATA[Bioinformatics PhD at CUK Kerala]]></title>
  <description><![CDATA[
<p>Applications are invited from highly motivated students (UGC-CSIR-JRF) with a background in Genomics/ Biotechnology/ Molecular Microbiology/ Biochemistry and Bioinformatics to pursue research leading to Ph.D. in the following areas;</p>

<p>    1. Cancer Genomics</p>

<p>    2. Microbial Genetics and Metagenomics</p>

<p>    3. Human Infective Diseases</p>

<p>    4. Computational Drug Design</p>

<p>Interested candidates may apply to Dr. Ranjith N. Kumavath, Assistant Professor &amp; Head, Department of Genomic Science, School of Biological Sciences, Central University of Kerala, Padannakad (PO), Nileshwar, Kasaragod-671328,Kerala. Email: RNkumavath@gmail.com</p>
]]></description>
</item>
<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/10925/a-brief-bioinformatics-tutorial</guid>
	<pubDate>Wed, 21 May 2014 12:50:09 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/10925/a-brief-bioinformatics-tutorial</link>
	<title><![CDATA[A Brief Bioinformatics Tutorial]]></title>
	<description><![CDATA[<p>This is about how to use a computer to find what is known about a gene of interest and also how to get new insights about it.</p>
<p>The tutorial is divided in three main parts:</p>
<ul>
<li>In the <strong>Sequence </strong>part, you will see how to look efficiently for a particular protein sequence, how to blast it against the database of your choice to find homologues, how to perform a multiple alignment of the homologues you've selected and how to edit this alignment.</li>
<li>The <strong>Structure </strong>part is about molecular visualization, homology modeling and structural domain prediction.</li>
<li>In the <strong>Function </strong>part, you will be introduced to you 3 useful servers to investigate the function of a protein. i.e. finding interactors, co-expressed genes, see a phylogenetic profile, easily access papers citing your gene etc ...</li>
</ul>
<p>During all the three parts, we will use the <em>S. cerevisiae </em>VPS36 protein as an example.</p><p>Address of the bookmark: <a href="http://www.mrc-lmb.cam.ac.uk/rlw/text/bioinfo_tuto/introduction.html" rel="nofollow">http://www.mrc-lmb.cam.ac.uk/rlw/text/bioinfo_tuto/introduction.html</a></p>]]></description>
	<dc:creator>Jit</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>

</channel>
</rss>