<?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/29018?offset=990</link>
	<atom:link href="https://bioinformaticsonline.com/related/29018?offset=990" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38023/mitos-improved-de-novo-metazoan-mitochondrial-genome-annotation</guid>
	<pubDate>Fri, 26 Oct 2018 08:25:39 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38023/mitos-improved-de-novo-metazoan-mitochondrial-genome-annotation</link>
	<title><![CDATA[MITOS: improved de novo metazoan mitochondrial genome annotation]]></title>
	<description><![CDATA[<p><span>Allows automatic annotation of metazoan mitochondrial genomes. MITOS is a pipeline designed to compute a consistent de novo annotation of the mitogenomic sequences. The software allows for a systematic error screening, the standardisation of gene name and gene boundary designation, anticodon labelling of tRNAs, and provides the means for the assessment of the validity of a gene assignment.</span></p><p>Address of the bookmark: <a href="http://mitos.bioinf.uni-leipzig.de/index.py" rel="nofollow">http://mitos.bioinf.uni-leipzig.de/index.py</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/7383/embo-practical-course-on-bioinformatics-and-genomes-analyses-at-hellenic-pasteur-institute-athens-greece</guid>
  <pubDate>Sat, 21 Dec 2013 10:00:24 -0600</pubDate>
  <link></link>
  <title><![CDATA[EMBO practical Course on  "Bioinformatics and Genomes Analyses" at Hellenic Pasteur Institute, Athens, Greece]]></title>
  <description><![CDATA[
<p>The main objectives of this Practical Course are to strengthen skills <br />of PhD students and young researchers in the domain of Bioinformatics <br />and Genome Data Analyses on the use of advanced fundamental algorithms <br />and their applications in genome studies.</p>

<p>The course topics will include theoretical and practical aspects in:<br />- Genomes comparisons,<br />- Evolutionary analyses (orthologs, paralogs and ancestral genomes <br />inference),<br />- RNAseq and Next Generation Sequencing (including algorithms, methods <br />and sequence mapping tools, data analyses and applications).</p>

<p>The course programme will be centred on theoretical presentations <br />followed by practical sessions. Practical sessions in a Linux <br />environment will involve Unix shell and Perl scripting. Participants <br />are assumed to be familiar with this environment.</p>

<p>A series of lectures delivered by prominent scientists on recent hot <br />topics in genome (Viruses, Prokaryotes, Eukaryotes) studies will be <br />included in the programme and future research perspectives will be <br />highlighted.</p>

<p>The topics that will be included in the course programme are similar <br />to those included in previously organized courses:http://www.pasteur.fr/~tekaia/BGA_courses.html</p>

<p>The course is aimed at motivated Ph.D students and Post-Doctoral <br />Researchers in Academic Institutions, with background in Mathematics, <br />Statistics, Biology or Computer Science and who are involved in <br />Bioinformatics and Genomes studies.</p>

<p>Selection of participants will be based on their background, running <br />research projects and on expressed motivations.<br />Selected students will have free accommodation and meals and are <br />expected to contribute with 200 euros and to pay for their travel <br />expenses.<br />All participants (students and invited speakers) will stay in the same <br />hotel.</p>

<p>Detailed indications are available on the course web site: http://events.embo.org/14-comparative-genomics/index.html</p>

<p>Candidates are advised to complete carefully the application form, <br />together with an abstract of at least one of their running projects, a <br />"one-page CV" and a personal Identity Picture (Photo).</p>

<p>The application deadline is March 14, 2014.</p>

<p>The organizers:<br />Menelaos Manoussakis, Hellenic Pasteur Institute, Athens, Greece.<br />Evdokia Karagouni, Hellenic Pasteur Institute, Athens - Greece.<br />Evie Melanitou,  Institut Pasteur Paris - France.<br />Fredj Tekaia ( Institut Pasteur Paris France)<br />URL: http://www.pasteur.fr/~tekaia/BGA_courses.html</p>

<p>Date: 5 – 17 May, 2014. <br />More at http://events.embo.org/14-comparative-genomics/index.html<br />will take place in the ,</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38176/asciigenome-genome-browser-based-on-command-line-interface-and-designed-for-running-from-console-terminals</guid>
	<pubDate>Fri, 09 Nov 2018 13:50:04 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38176/asciigenome-genome-browser-based-on-command-line-interface-and-designed-for-running-from-console-terminals</link>
	<title><![CDATA[ASCIIGenome: genome browser based on command line interface and designed for running from console terminals.]]></title>
	<description><![CDATA[<p><code>ASCIIGenome</code>&nbsp;is a genome browser based on command line interface and designed for running from console terminals.</p>
<p>Since&nbsp;<code>ASCIIGenome</code>&nbsp;does not require a graphical interface it is particularly useful for quickly visualizing genomic data on remote servers while offering flexibility similar to popular GUI viewers like&nbsp;<a href="https://www.broadinstitute.org/igv/">IGV</a>.</p>
<p><span>Documentation</span>&nbsp;is at&nbsp;<a href="http://asciigenome.readthedocs.io/en/latest/">readthedocs/asciigenome</a>.</p>
<p>&nbsp;</p><p>Address of the bookmark: <a href="https://github.com/dariober/ASCIIGenome" rel="nofollow">https://github.com/dariober/ASCIIGenome</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/7568/oldest-hominin-dna-sequenced</guid>
	<pubDate>Fri, 27 Dec 2013 19:58:31 -0600</pubDate>
	<link>https://bioinformaticsonline.com/news/view/7568/oldest-hominin-dna-sequenced</link>
	<title><![CDATA[Oldest Hominin DNA Sequenced]]></title>
	<description><![CDATA[<p>Matthias Meyer and his team from the Max Planck Institute for Evolutionary Anthropology in Leipzig, Germany, have developed new techniques for retrieving and sequencing highly degraded ancient DNA. They then joined forces with Juan-Luis Arsuaga and applied the new techniques to a cave bear from the Sima de los Huesos site. After this success, the researchers sampled two grams of bone powder from a hominin thigh bone from the cave. They extracted its DNA and sequenced the genome of the mitochondria or mtDNA, a small part of the genome that is passed down along the maternal line and occurs in many copies per cell. The researchers then compared this ancient mitochondrial DNA with Neandertals, Denisovans, present-day humans, and apes.<br /><br />From the missing mutations in the old DNA sequences the researchers calculated that the Sima hominin lived about 400,000 years ago. They also found that it shared a common ancestor with the Denisovans, an extinct archaic group from Asia related to the Neandertals, about 700,000 years ago. "The fact that the mtDNA of the Sima de los Huesos hominin shares a common ancestor with Denisovan rather than Neandertal mtDNAs is unexpected since its skeletal remains carry Neandertal-derived features," says Matthias Meyer. Considering their age and Neandertal-like features, the Sima hominins were likely related to the population ancestral to both Neandertals and Denisovans. Another possibility is that gene flow from yet another group of hominins brought the Denisova-like mtDNA into the Sima hominins or their ancestors.<br /><br /></p><p>Reference</p><p>http://www.sciencedaily.com/releases/2013/12/131204132018.htm</p>]]></description>
	<dc:creator>Surajeet</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41831/merqury-reference-free-quality-and-phasing-assessment-for-genome-assemblies</guid>
	<pubDate>Sat, 06 Jun 2020 05:38:34 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41831/merqury-reference-free-quality-and-phasing-assessment-for-genome-assemblies</link>
	<title><![CDATA[Merqury: reference-free quality and phasing assessment for genome assemblies]]></title>
	<description><![CDATA[<p><span>Often, genome assembly projects have illumina whole genome sequencing reads available for the assembled individual. The k-mer spectrum of this read set can be used for independently evaluating assembly quality without the need of a high quality reference. Merqury provides a set of tools for this purpose.</span></p>
<p><span><a href="https://github.com/marbl/meryl">https://github.com/marbl/meryl</a></span></p><p>Address of the bookmark: <a href="https://github.com/marbl/merqury" rel="nofollow">https://github.com/marbl/merqury</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/7998/faculty-positions-at-iiit-allahabad</guid>
  <pubDate>Thu, 23 Jan 2014 06:19:34 -0600</pubDate>
  <link></link>
  <title><![CDATA[FACULTY POSITIONS AT IIIT-ALLAHABAD]]></title>
  <description><![CDATA[
<p>OPENINGS OF FACULTY POSITIONS AT IIIT-ALLAHABAD</p>

<p>(Under Tenure-Track Model)</p>

<p>Open Advt. No IIITA/DIC/16012014</p>

<p>IIIT-Allahabad has several Openings for the Faculty positions at the Assistant Professor level.</p>

<p>It is a regular tenure-track faculty positions for 3-5 years in teaching and research. A regular faculty is expected to engage heavily in research and teaching. The eligibility criteria for regular faculty positions are similar as in IITs. For an Assistant Professor position, a candidate must have a PhD (in IT/Computer Science &amp;/or Engineering/Electrical, Electronics &amp;/or Communication Engineering/etc; for interdisciplinary areas the PhD may be in an appropriate field), plus three years experience. However, for PhDs from a well known University/Institute (e.g. IITs/IISc/TIFR/ISI in India or well known research universities across the world), and a good research/academic record, the 3 years experience requirement may be waived.</p>

<p>The pay scale for faculty is same as in IITs. Other benefits include initiation research grant, travel support, book grant, professional society membership, etc., and personal benefits such as medical/LTC, on campus subsidized family housing with excellent modern infrastructural facilities.</p>

<p>Areas of Interest</p>

<p>IIIT-Allahabad aims to build strong research groups in important and emerging areas in CS/IT/ECE as well as in emerging interdisciplinary areas, and applications are invited in all these areas. Some of the areas of special interest, besides strengthening the existing research areas, are : Software Engineering, Theoretical Computer Science, Cyber Physical Systems, Robotics, Network science, Digital Media, Computational neuroscience, Machine learning, Healthcare informatics, Computational Biology, Communications networks (both at hardware and protocol levels), Circuits (including VLSI, analog, low power, etc), Energy systems and technologies, Biomedical electronics and systems, Computer Architecture, signal/image processing, Embedded and control systems.</p>

<p>Application Process</p>

<p>Interested candidates can apply by sending their detailed CV with list of publications clearly mentioning Journal names and citation index with three references through email entitled “Faculty positions at IIIT Allahabad” to faculty.applications@iiita.ac.in. Do not send your applications in any other email addresses. Applications will be considered regularly, hence there is no deadline for applying.</p>

<p>Important Clarifications on Eligibility</p>

<p>A PhD in CS/IT (or other disciplines, as announced) is the minimum expected requirement for an Assistant Professor.</p>

<p>Advertisement: http://iiita.ac.in/pub/Faculty-Position-IIITA1.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38526/versatile-genome-assembly-evaluation-with-quast-lg</guid>
	<pubDate>Fri, 21 Dec 2018 22:06:31 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38526/versatile-genome-assembly-evaluation-with-quast-lg</link>
	<title><![CDATA[Versatile genome assembly evaluation with QUAST-LG]]></title>
	<description><![CDATA[<p>QUAST-LG is an extension of&nbsp;<a href="http://cab.spbu.ru/software/quast/">QUAST</a>&nbsp;intended for evaluating large-scale genome assemblies (up to mammalian-size).</p>
<p>QUAST-LG&nbsp;is included in the QUAST&nbsp; package starting from version 5.0.0 (<a href="https://sourceforge.net/projects/quast/files/latest/download?source=files">download the latest release</a>). Run QUAST as usual and do not forget to add&nbsp;<span>‐‐large</span>&nbsp;option to your command!</p>
<p>A short list of the new features (see&nbsp;<a href="http://cab.spbu.ru/files/quast/latest-docs/CHANGES.txt">CHANGES</a>&nbsp;for all):</p>
<ul>
<li>Significant speedup achieved by both&nbsp;use of new fast aligner (<a href="https://github.com/lh3/minimap2">minimap2</a>) and the refactoring of alignment analyzing&nbsp;modules</li>
<li>New k-mer-based completeness and correctness metrics</li>
<li>BUSCO added for enhanced reference-free analysis</li>
<li>The concept of upper bound&nbsp;assembly (theoretical limits on the assembly&nbsp;completeness and&nbsp;contiguity for a given genome and set of reads)</li>
</ul><p>Address of the bookmark: <a href="http://cab.spbu.ru/software/quast-lg/" rel="nofollow">http://cab.spbu.ru/software/quast-lg/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38670/ltr-finder-an-efficient-program-for-finding-full-length-ltr-retrotranspsons-in-genome-sequences</guid>
	<pubDate>Sun, 13 Jan 2019 07:05:53 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38670/ltr-finder-an-efficient-program-for-finding-full-length-ltr-retrotranspsons-in-genome-sequences</link>
	<title><![CDATA[LTR_Finder: an efficient program for finding full-length LTR retrotranspsons in genome sequences.]]></title>
	<description><![CDATA[<p>LTR_Finder is an efficient program for finding full-length LTR retrotranspsons in genome sequences.</p>
<p>The Program first constructs all exact match pairs by a suffix-array based algorithm and extends them to long highly similar pairs. Then Smith-Waterman algorithm is used to adjust the ends of LTR pair candidates to get alignment boundaries. These boundaries are subject to re-adjustment using supporting information of TG..CA box and TSRs and reliable LTRs are selected. Next, LTR_FINDER tries to identify PBS, PPT and RT inside LTR pairs by build-in aligning and counting modules. RT identification includes a dynamic programming to process frame shift. For other protein domains, LTR_FINDER calls ps_scan (from PROSITE,&nbsp;<a href="http://www.expasy.org/prosite/">http://www.expasy.org/prosite/</a>) to locate cores of important enzymes if they occur.</p><p>Address of the bookmark: <a href="https://github.com/xzhub/LTR_Finder" rel="nofollow">https://github.com/xzhub/LTR_Finder</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/8198/scientist-positions-at-rajiv-gandhi-centre-for-biotechnology</guid>
  <pubDate>Thu, 06 Feb 2014 23:18:49 -0600</pubDate>
  <link></link>
  <title><![CDATA[Scientist Positions at Rajiv Gandhi Centre for Biotechnology]]></title>
  <description><![CDATA[
<p>Rajiv Gandhi Centre for Biotechnology</p>

<p>An Autonomous National Institute under Government of India,<br />Ministry of Science &amp; Technology<br />Department of Biotechnology</p>

<p>No: RGCB/ Advt./2014/1   <br />January 24, 2014</p>

<p>Scientist Positions</p>

<p>Group Leader in Computational Biology/Bioinformatics<br />A highly motivated and innovative individual who will pursue basic research, solve biological problems with emphasis on computational and quantitative experimental methods and build active bridges to translational research. The scientist will also provide computational biology support to analyze complex data sets generated by RGCB scientists and collaborators.</p>

<p>Location: Thiruvananthapuram (Trivandrum)</p>

<p>The above positions will be at the E-II, F or equivalent levels. For senior applicants with an outstanding track record, an option of a contract career path for research excellence at Scientist G or H equivalent level can also be discussed. All positions will initially be for 5 years. Essential and desired qualifications as well as other relevant details for all the above positions are posted on the RGCB website (http://www.rgcb.res.in). The last date for receiving applications is March 14, 2014.   </p>

<p>Sd/-<br />Director</p>

<p>Rajiv Gandhi Centre for Biotechnology<br />Thycaud, P.O., Poojappura,<br />Thiruvananthapuram, Kerala, India-695 014<br />Ph.: 91-471-2529400 (30 Lines), 2347975, 2348104, 2348753, 2345899<br />Fax: 91-471-2348096, 2346333</p>

<p>More at http://rgcb.res.in/jobs.html</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39236/causel-an-epigenome-and-genome-editing-pipeline-for-establishing-function-of-noncoding-gwas-variants</guid>
	<pubDate>Tue, 09 Apr 2019 07:23:37 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39236/causel-an-epigenome-and-genome-editing-pipeline-for-establishing-function-of-noncoding-gwas-variants</link>
	<title><![CDATA[CAUSEL: an epigenome- and genome-editing pipeline for establishing function of noncoding GWAS variants]]></title>
	<description><![CDATA[<p><span>Validated a widely accessible approach that can be used to establish functional causality for noncoding sequence variants identified by GWASs.</span></p>
<p><a href="https://www.nature.com/articles/nm.3975">https://www.nature.com/articles/nm.3975</a></p><p>Address of the bookmark: <a href="https://www.nature.com/articles/nm.3975" rel="nofollow">https://www.nature.com/articles/nm.3975</a></p>]]></description>
	<dc:creator>BioJoker</dc:creator>
</item>

</channel>
</rss>