<?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/27104?offset=890</link>
	<atom:link href="https://bioinformaticsonline.com/related/27104?offset=890" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35418/karyoploter-plot-whole-genomes-with-arbitrary-data</guid>
	<pubDate>Fri, 02 Feb 2018 03:24:28 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35418/karyoploter-plot-whole-genomes-with-arbitrary-data</link>
	<title><![CDATA[karyoploteR: plot whole genomes with arbitrary data]]></title>
	<description><![CDATA[<p><span><a href="http://bioconductor.org/packages/karyoploteR">karyoploteR</a></span><span>&nbsp;is an R package to create karyoplots, that is, representations of whole genomes with arbitrary data plotted on them. It is inspired by the R base graphics system and does not depend on other graphics packages. The aim of karyoploteR is to offer the user an easy way to plot data along the genome to get broad genome-wide view to facilitate the identification of genome wide relations and distributions.</span></p><p>Address of the bookmark: <a href="https://bernatgel.github.io/karyoploter_tutorial/" rel="nofollow">https://bernatgel.github.io/karyoploter_tutorial/</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</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/32946/grass-a-generic-algorithm-for-scaffolding-next-generation-sequencing-assemblies</guid>
	<pubDate>Tue, 23 May 2017 05:20:32 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32946/grass-a-generic-algorithm-for-scaffolding-next-generation-sequencing-assemblies</link>
	<title><![CDATA[GRASS: a generic algorithm for scaffolding next-generation sequencing assemblies.]]></title>
	<description><![CDATA[<p><span>GRASS (GeneRic ASsembly Scaffolder)-a novel algorithm for scaffolding second-generation sequencing assemblies capable of using diverse information sources. GRASS offers a mixed-integer programming formulation of the contig scaffolding problem, which combines contig order, distance and orientation in a single optimization objective. The resulting optimization problem is solved using an expectation-maximization procedure and an unconstrained binary quadratic programming approximation of the original problem. We compared GRASS with existing HTS scaffolders using Illumina paired reads of three bacterial genomes. Our algorithm constructs a comparable number of scaffolds, but makes fewer errors. This result is further improved when additional data, in the form of related genome sequences, are used.</span></p><p>Address of the bookmark: <a href="https://github.com/AlexeyG/GRASS" rel="nofollow">https://github.com/AlexeyG/GRASS</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</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/36812/porechop-tool-for-finding-and-removing-adapters-from-oxford-nanopore-reads</guid>
	<pubDate>Tue, 29 May 2018 07:33:44 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36812/porechop-tool-for-finding-and-removing-adapters-from-oxford-nanopore-reads</link>
	<title><![CDATA[Porechop:  tool for finding and removing adapters from Oxford Nanopore reads]]></title>
	<description><![CDATA[<p>Porechop is a tool for finding and removing adapters from <a href="https://nanoporetech.com/">Oxford Nanopore</a> reads. Adapters on the ends of reads are trimmed off, and when a read has an adapter in its middle, it is treated as chimeric and chopped into separate reads. Porechop performs thorough alignments to effectively find adapters, even at low sequence identity.</p>
<p>Porechop also supports demultiplexing of Nanopore reads that were barcoded with the <a href="https://store.nanoporetech.com/native-barcoding-kit-1d.html">Native Barcoding Kit</a>, <a href="https://store.nanoporetech.com/pcr-barcoding-kit-96.html">PCR Barcoding Kit</a> or <a href="https://store.nanoporetech.com/rapid-barcoding-sequencing-kit.html">Rapid Barcoding Kit</a>.</p><p>Address of the bookmark: <a href="https://github.com/rrwick/Porechop" rel="nofollow">https://github.com/rrwick/Porechop</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/8174/the-2014-cemm-phd-program</guid>
  <pubDate>Wed, 05 Feb 2014 06:03:15 -0600</pubDate>
  <link></link>
  <title><![CDATA[The 2014 CeMM PhD Program]]></title>
  <description><![CDATA[
<p>For our next PhD Program starting in October 2014 we are looking for exceptionally motivated PhD candidates with a keen interest in genomics and medicine and a strong interest to work in teams.</p>

<p>The 2014 CeMM PhD Program will focus on two thematic areas: INFECTION and CANCER, that are built on the pillars of epigenetics, bioinformatics and systems biology, chemical biology and the mechanism of action of drugs, high-throughput genetics, genomics and proteomics, and molecular and cell biology.</p>

<p>The choice of this strategic focus rests on the synergies between immunology, infection and cancer in pathophysiological and technological terms. It furthermore reflects the strength of the current CeMM faculty, itself built around the historical and contemporary expertise in immunology and cancer of the Medical University of Vienna.</p>

<p>As a CeMM PhD student you will get the chance to work at the cutting edge of interdisciplinary molecular medicine research and be trained by the entire CeMM and associated faculty to become one of the scientists shaping the future of molecular medicine.<br />Requirements</p>

<p>To be eligible to enroll in the CeMM PhD Program all candidates are required to have a bachelor’s or master’s degree in medicine, biology, chemistry, bioinformatics, mathematics or any scientific/technical, subject-relevant degree. Candidates do not need to have completed their degree at the time of application, however they must have obtained their final degree certificate by mid-September. The working language at CeMM is English, so excellent written and oral communication skills in English are required.<br />Timeline</p>

<p>    Applications open on 20th January and close on 20th March 2014.<br />    Two references are required to be submitted through the online system by 31st March 2014.<br />    All complete candidate applications are reviewed by the CeMM Faculty in early April.<br />    Selected candidates are invited to a Skype panel interview in late April.<br />    Shortlisted candidates are then invited to Vienna in May for a full interview process, including an opportunity to introduce yourself through a presentation and interview rounds, meet research group members, and attend an informal dinner to get to know the Faculty members and learn more about their research.<br />    Positions are offered by CeMM Faculty in June.<br />    Start of PhD Program: 1st October 2014 .</p>

<p>Contact</p>

<p>Binia Maria Günther, BEd BA<br />Human Resources Manager<br />bguenther@cemm.oeaw.ac.at</p>

<p>Catherine Lloyd, Ph.D.<br />PhD and Postdoc Program Manager<br />clloyd@cemm.oeaw.ac.at</p>

<p>More Info: www.cemm.oeaw.ac.at/phd-program/application/</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37239/kat-a-k-mer-analysis-toolkit-to-quality-control-ngs-datasets-and-genome-assemblies</guid>
	<pubDate>Fri, 06 Jul 2018 03:36:45 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37239/kat-a-k-mer-analysis-toolkit-to-quality-control-ngs-datasets-and-genome-assemblies</link>
	<title><![CDATA[KAT: a K-mer analysis toolkit to quality control NGS datasets and genome assemblies]]></title>
	<description><![CDATA[<p>KAT is a suite of tools that analyse jellyfish hashes or sequence files (fasta or fastq) using kmer counts. The following tools are currently available in KAT:</p>
<ul>
<li><span>hist</span>: Create an histogram of k-mer occurrences from a sequence file. Adds metadata in output for easy plotting.</li>
<li><span>gcp:</span>&nbsp;K-mer GC Processor. Creates a matrix of the number of K-mers found given a GC count and a K-mer count.</li>
<li><span>comp</span>: K-mer comparison tool. Creates a matrix of shared K-mers between two (or three) sequence files or hashes.</li>
<li><span>sect</span>: SEquence Coverage estimator Tool. Estimates the coverage of each sequence in a file using K-mers from another sequence file.</li>
<li><span>blob</span>: Given, reads and an assembly, calculates both the read and assembly K-mer coverage along with GC% for each sequence in the assembly.SEquence Coverage estimator Tool.</li>
<li><span>filter</span>: Filtering tools. Contains tools for filtering k-mer hashes and FastQ/A files:
<ul>
<li><span>kmer</span>: Produces a k-mer hash containing only k-mers within specified coverage and GC tolerances.</li>
<li><span>seq</span>: Filters a sequence file based on whether or not the sequences contain k-mers within a provided hash.</li>
</ul>
</li>
<li><span>plot</span>: Plotting tools. Contains several plotting tools to visualise K-mer and compare distributions. The following plot tools are available:
<ul>
<li><span>density</span>: Creates a density plot from a matrix created with the "comp" tool. Typically this is used to compare two K-mer hashes produced by different NGS reads.</li>
<li><span>profile</span>: Creates a K-mer coverage plot for a single sequence. Takes in fasta coverage output coverage from the "sect" tool</li>
<li><span>spectra-cn</span>: Creates a stacked histogram using a matrix created with the "comp" tool. Typically this is used to compare a jellyfish hash produced from a read set to a jellyfish hash produced from an assembly. The plot shows the amount of distinct K-mers absent, as well as the copy number variation present within the assembly.</li>
<li><span>spectra-hist</span>: Creates a K-mer spectra plot for a set of K-mer histograms produced either by jellyfish-histo or kat-histo.</li>
<li><span>spectra-mx</span>: Creates a K-mer spectra plot for a set of K-mer histograms that are derived from selected rows or columns in a matrix produced by the "comp".</li>
</ul>
</li>
</ul>
<p>In addition, KAT contains a python script for analysing the mathematical distributions present in the K-mer spectra in order to determine how much content is present in each peak.</p>
<p>This README only contains some brief details of how to install and use KAT. For more extensive documentation please visit:&nbsp;<a href="https://kat.readthedocs.org/en/latest/">https://kat.readthedocs.org/en/latest/</a></p>
<p><a href="https://academic.oup.com/bioinformatics/article/33/4/574/2664339">https://academic.oup.com/bioinformatics/article/33/4/574/2664339&nbsp;</a></p><p>Address of the bookmark: <a href="https://github.com/TGAC/KAT" rel="nofollow">https://github.com/TGAC/KAT</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/8123/jrf-manit</guid>
  <pubDate>Sun, 02 Feb 2014 03:07:58 -0600</pubDate>
  <link></link>
  <title><![CDATA[JRF @ MANIT]]></title>
  <description><![CDATA[
<p>MAULANA AZAD NATIONAL INSTITUTE OF TECHNOLOGY BHOPAL</p>

<p>No. CSE/14/1038</p>

<p>Walk in Interview for the post of JRF under TEQIP-II</p>

<p>SN Department – Qualification Post Graduation – Time</p>

<p>1 Bio-Informatics &amp; Mathematics M.Tech Bio-informatics/M.Sc.* Maths  10.00 AM</p>

<p>2 Biological Sciences M.Sc.* in any branch of Biological Sciences 10.30 AM</p>

<p>3 Chemical Engineering M.Tech Chemical Engineering 11.00 AM</p>

<p>4 Chemistry M.Sc.* Chemistry 11.30 AM</p>

<p>5 Civil Engineering M.Tech Structure/GeoTech. /Water -Resources/Hydraulics/Environment/Transport 12.00 Noon</p>

<p>6 GIS M.Tech GIS/Civil 12.30 PM</p>

<p>7 Computer Science &amp; Engineering M.Tech CSE/Information Security 01.00 PM</p>

<p>8 Electrical Engineering M.Tech Electrical Derives 01.30 PM</p>

<p>9 Electronics &amp; Communication M.Tech Digital Communication 02.00 PM</p>

<p>10 MSME M.Tech Material Science/ Mechanical/Metallurgy 02.30 PM</p>

<p>11 Physics M.Sc.* Physics 03.00 PM</p>

<p>* M.Sc. with NET/GATE qualified</p>

<p>Resume along with one passport size photograph and relevant documents are required at the time of interview</p>

<p>Amount of Fellowship: Rs 18000/-month+ HRA</p>

<p>Duration: 31st Dec 2014 (End of TEQIP-II project)</p>

<p>Date of Interview: 7th  February 2014</p>

<p>Venue Institute Committee Room</p>

<p>Advertisement:</p>

<p>http://www.manit.ac.in/manitbhopal/Year2014/Recruitment/Advertisement%20JRF.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37502/alignqc-a-tool-for-assessing-an-alignment-and-generating-reports-that-are-easy-to-share</guid>
	<pubDate>Tue, 07 Aug 2018 04:41:07 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37502/alignqc-a-tool-for-assessing-an-alignment-and-generating-reports-that-are-easy-to-share</link>
	<title><![CDATA[AlignQC: A tool for assessing an alignment, and generating reports that are easy to share]]></title>
	<description><![CDATA[<p><span>Long read alignment analysis. Generate a reports on sequence alignments for mappability vs read sizes, error patterns, annotations and rarefraction curve analysis. The most basic analysis only requires a BAM file, and outputs a web browser compatible xhtml to visualize/share/store/extract analysis results.</span></p>
<p>https://f1000research.com/articles/6-100/</p>
<p>https://github.com/jason-weirather/AlignQC</p><p>Address of the bookmark: <a href="https://www.healthcare.uiowa.edu/labs/au/AlignQC/" rel="nofollow">https://www.healthcare.uiowa.edu/labs/au/AlignQC/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/8287/post-doc-in-computational-genetics-and-genomics-at-ceinge-biotecnologie-avanzate-naples-italy</guid>
  <pubDate>Tue, 11 Feb 2014 08:06:47 -0600</pubDate>
  <link></link>
  <title><![CDATA[Post doc in Computational Genetics and Genomics at CEINGE Biotecnologie Avanzate, Naples, Italy]]></title>
  <description><![CDATA[
<p>We are seeking one motivated scientist to analyze genomics and transcriptomics data of a large collection of neuroblastoma tumors. The successful candidate will be part of a team of researchers with extensive expertise in genome cancer study. He/she will be involved in the analysis of DNA-seq, RNA-seq, ChIP-seq data using available methods running in R and UNIX environment.</p>

<p>Qualifications</p>

<p>PhD or Post-Graduated Master degree is required. Successful candidates will have some expertise in data analysis of NGS data by using methods running in R and UNIX environment. Familiarity with genome databases and browsers is required.</p>

<p>Application</p>

<p>Candidates should send a CV and a brief personal statement focusing on their skills and interests related to the research project.</p>

<p>Contacts</p>

<p>Start date: 1° April 2014<br />Salary on grant: 25,000 euros per year.<br />Contact Person (Referent): Mario Capasso<br />Ref. Email: mario.capasso@unina.it and achille.iolascon@unina.it<br />Tel: +39 081 3737889</p>
]]></description>
</item>

</channel>
</rss>