<?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/27080?offset=770</link>
	<atom:link href="https://bioinformaticsonline.com/related/27080?offset=770" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	
<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/14905/internship-in-computational-biology</guid>
  <pubDate>Thu, 04 Sep 2014 04:19:40 -0500</pubDate>
  <link></link>
  <title><![CDATA[Internship in Computational Biology]]></title>
  <description><![CDATA[
<p>We are looking for a motivated and autonomous intern to study gene expression in hybrid organisms. The student will work on natural hybrids of two or three different species of fungal endosymbionts of grasses. The pupose of this project is to build software allowing us to identify the genomic origin of expressed genes. To do that, the intern will have to analyze expression data (from RNA-seq) to find SNPs on the sequenced mRNAs allowing to identify from which of the parental genome the expressed gene come from. The data will have to be saved in a database using the standard BioSQL schema.</p>

<p>This job will allow the intern to become more familiar with new biological and bioinformatics tools like next generation sequencing, RNA-Seq data analysis and comparative genomics.</p>

<p>To apply for this position, send the following documents (in PDF format) to Dr Pierre-Yves Dupont (email p.y.dupont@massey.ac.nz):</p>

<p>1. A short cover letter.<br />2. A curriculum vitae, with transcript details.<br />3. The names and contact details of two referees willing to provide a confidential letter of recommendation upon request.</p>

<p>Informal enquiries are welcome. Formal applications are due by Sunday 2nd December 2012.<br />Requirements: </p>

<p>This position requires a good understanding of genetic problems, a good command of at least one scripting language (Perl, Python...), a basic knowledge of MySQL or any relational database management system. Knowledge in biological programming libraries (BioPython, BioPerl, BioRuby...), Java, C++ or any compiled language is an asset but not required. Undergraduate or Master degree is required.<br />Contact Information: </p>

<p>Dr. Pierre-Yves Dupont<br />Institute of Molecular BioSciences<br />Massey University<br />Private Bag 11 222<br />Palmerston North 4442<br />NEW ZEALAND</p>

<p>http://massey.genomicus.com/<br />p.y.dupont@massey.ac.nz</p>

<p>Information about the Institute of Molecular BioSciences (http://imbs.massey.ac.nz/) and the Computational Biology Research Group (http://massey.genomicus.com/) is available online. For more information about the position, you can contact Dr Pierre-Yves Dupont (email p.y.dupont@massey.ac.nz).</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34445/inc-seq-accurate-single-molecule-reads-using-nanopore-sequencing</guid>
	<pubDate>Mon, 27 Nov 2017 10:38:56 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34445/inc-seq-accurate-single-molecule-reads-using-nanopore-sequencing</link>
	<title><![CDATA[INC-Seq: accurate single molecule reads using nanopore sequencing]]></title>
	<description><![CDATA[<p><span>INC-Seq reads enabled accurate species-level classification, identification of species at 0.1&nbsp;% abundance and robust quantification of relative abundances, providing a cheap and effective approach for pathogen detection and microbiome profiling on the MinION system.</span></p><p>Address of the bookmark: <a href="https://github.com/CSB5/INC-Seq" rel="nofollow">https://github.com/CSB5/INC-Seq</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/16158/bioinformatics-position-at-irccs-casa-sollievo-della-sofferenza</guid>
  <pubDate>Wed, 10 Sep 2014 14:25:34 -0500</pubDate>
  <link></link>
  <title><![CDATA[Bioinformatics position at IRCCS Casa Sollievo della Sofferenza]]></title>
  <description><![CDATA[
<p>The bioinformatics unit at IRCCS Casa Sollievo della Sofferenza - Mendel laboratory in Rome is looking for one young bioinformatician with specific experience and/or interest in the analysis of genomics and transcriptomic data.</p>

<p>The candidate will be mainly in charge of developing research on Gene Expression/SNP Arrays data, NGS whole -exome and -transcriptome datasets and biological networks in the contexts of genetic diseases, innovative therapies and regenerative medicine. Main activities will be: (i) data analysis (short-reads mapping, genomics aberrations discovery and annotation, variants pathogenicity detection); (ii) functional/pathway enrichment analysis; (iii) biological networks analysis (artificial knockout, redundancy and lethality analysis, gene set essentiality); (iv) developing of ad-hoc software solutions/routines on clusters of CPUs and GPUs.</p>

<p>The correct cultural background (training in Biology / Computer Science / Statistics or a mix of the three) and a strong interest in working in high throughput data analysis will be considered at the same level of specific experience in the above-mentioned fields.</p>

<p>Knowledge of molecular modeling and simulation and willingness to learn one or more of these languages: python, perl, R, Java, C++, C# is a golden plus. Good knowledge of Scientific English will be positively evaluated for this position, together with good presentation and teamwork skills.</p>

<p>Candidates should send:<br />• a cover letter explaining the role they would like to undertake within the Center, even if it is not listed in this job adv, stating clearly why they would be a good fit to the proposed role, and what they would bring to the Center in terms of expertise, ideas, talent;<br />• a CV including a list of publications;<br />• List of referees.</p>

<p>A CV with one professional reference, details on educational background and of the biological and/or bioinformatic and/or data analysis skills and experience should be sent by email for a preliminary selection to: Tommaso Mazza t.mazza@css-mendel.it</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35899/reference-free-prediction-of-rearrangement-breakpoint-reads</guid>
	<pubDate>Thu, 08 Mar 2018 05:05:25 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35899/reference-free-prediction-of-rearrangement-breakpoint-reads</link>
	<title><![CDATA[Reference-free prediction of rearrangement breakpoint reads]]></title>
	<description><![CDATA[<p><span>lideSort-BPR (&nbsp;</span><span>b</span><span>&nbsp;reak&nbsp;</span><span>p</span><span>&nbsp;oint&nbsp;</span><span>r</span><span>&nbsp;eads) is based on a fast algorithm for all-against-all comparisons of short reads and theoretical analyses of the number of neighboring reads. When applied to a dataset with a sequencing depth of 100&times;, it finds &sim;88% of the breakpoints correctly with no false-positive reads. Moreover, evaluation on a real prostate cancer dataset shows that the proposed method predicts more fusion transcripts correctly than previous approaches, and yet produces fewer false-positive reads. To our knowledge, this is the first method to detect breakpoint reads without using a reference genome.</span></p>
<p><span>https://github.com/ewijaya/slidesort-bpr</span></p><p>Address of the bookmark: <a href="https://code.google.com/archive/p/slidesort-bpr/" rel="nofollow">https://code.google.com/archive/p/slidesort-bpr/</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/17187/urdip-bioinformatics-rajrf-vacancies</guid>
  <pubDate>Sat, 20 Sep 2014 20:52:56 -0500</pubDate>
  <link></link>
  <title><![CDATA[URDIP Bioinformatics RA/JRF Vacancies]]></title>
  <description><![CDATA[
<p>CSIR - UNIT FOR RESEARCH AND DEVELOPMENT OF INFORMATION PRODUCTS (CSIR- URDIP)</p>

<p>Adv. No. URDIP/ 6/2014</p>

<p>Opportunity for young Bioinformatics Professionals to make a career in the area of Intellectual Property CSIR has set up a Unit for Research and Development of Information Products (CSIR-URDIP) at Pune to work in the area of scientific informatics. One of the major focus areas of research work at CSIR-URDIP is PATENT INFORMATICS. With the increasing applications of Bioinformatics in the areas of life sciences industry such as Agriculture and Health Care (Diagnostics and Drugs), the output of research in these area is being protected by different forms of Intellectual Property rights. Realizing the importance of IP in the Bioinformatics field, Department of Biotechnology (DBT) has sanctioned a project on “Development, Facilitation and Harvesting of Bioinformatics related Intellectual Property” at CSIR-URDIP.</p>

<p>The project will involve application of Patent Informatics tools and techniques to Bioinformatics (including creation of patent landscapes, preparation of techno-legal reports of patentability, freedom to operate studies) to help protect IPRs and develop and conduct training programmes on IPRs related to Bioinformatics.</p>

<p>CSIR-URDIP invites applications from young Bioinformatics professionals to work on this emerging area which offers challenging opportunities and attractive career possibilities in future.</p>

<p>Position I: Research Associate</p>

<p>No of Positions: One</p>

<p>Consolidated amount Payable: Rs. 22,000/- per month + 20% HRA= Rs.26,400</p>

<p>Qualification:  PhD in Bioinformatics. In exceptional cases, candidature of M. Tech. candidates with First class in Bioinformatics with three years of relevant work experience will also be considered.</p>

<p>Age Limit: 35 years. The age should not exceed the limit indicated as on a closing date of receipt of completed application form.</p>

<p>Upper age limit is relaxable for 5 years for SC/ST, OBC, Physically handicapped and female candidates as per CSIR/Government of India rules.</p>

<p>Position II: Junior Research Fellow</p>

<p>No of Positions: one</p>

<p>Consolidated amount Payable: Rs. 16,000/- + 20% HRA = 19,200</p>

<p>Qualification: M.Sc / BE or equivalent in Bioinformatics with minimum of 55% marks in aggregate Job requirement: Scientific literature and patent search, analysis and Report Writing</p>

<p>Preference: Preference will be given to candidates with knowledge of patents and or 1-2 years of experience + Knowledge of Computers (MS Excel + Word Processing)</p>

<p>Age Limit: 28 years. The age should not exceed the limit indicated as on a closing date of receipt of completed application form.</p>

<p>For details please visit our website (www.urdip.res.in/careers) for further details and apply online by 30th September, 2014.</p>

<p>Advertisement: http://www.urdip.res.in/download/Advt6_2014.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36607/tarean-a-computational-tool-for-identification-and-characterization-of-satellite-dna-from-unassembled-short-reads</guid>
	<pubDate>Tue, 15 May 2018 02:53:11 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36607/tarean-a-computational-tool-for-identification-and-characterization-of-satellite-dna-from-unassembled-short-reads</link>
	<title><![CDATA[TAREAN: A computational tool for identification and characterization of satellite DNA from unassembled short reads]]></title>
	<description><![CDATA[<p><strong>TA</strong>ndem&nbsp;<strong>RE</strong>peat&nbsp;<strong>AN</strong>alyzer -TAREAN &ndash; is a computational pipeline for&nbsp;<strong>unsupervised identification of satellite repeats</strong>&nbsp;from unassembled sequence reads. The pipeline uses low-pass whole genome sequence reads and performs their graph-based clustering. Resulting clusters, representing all types of repeats, are then examined for the presence of circular structures and putative satellite repeats are reported.</p>
<p><em><strong>How to use TAREAN</strong></em>:</p>
<ul>
<li>Install a local instance of the pipeline using its source code available from&nbsp;<a href="https://bitbucket.org/petrnovak/repex_tarean" target="_blank" title="TAREAN source code">bitbucket repository</a>.</li>
<li>Use&nbsp; public Galaxy-based server at&nbsp;<a href="https://repeatexplorer-elixir.cerit-sc.cz/" target="_blank">https://repeatexplorer-elixir.cerit-sc.cz/</a>. The server is provided in frame of the&nbsp;<a href="https://www.elixir-czech.cz/" target="_blank">Elixir CZ project</a>&nbsp;and is maintained by&nbsp;<a href="https://www.cesnet.cz/" target="_blank">CESNET</a>&nbsp;and&nbsp;<a href="https://www.cerit-sc.cz/en/index.html" target="_blank">CERIT-SC</a>. Simple registration is required to use this service.</li>
</ul>
<p>Development of TAREAN was supported by&nbsp;<a href="https://www.elixir-czech.cz/" target="_blank" title="ELIXIR-CZ">ELIXIR CZ</a>&nbsp;research infrastructure project (MEYS Grant No: LM2015047).</p>
<p><strong><em>References</em></strong></p>
<p>Novak, P., Avila Robledillo, L., Koblizkova, A., Vrbova, I., Neumann, P., Macas, J. (2017) &ndash;&nbsp;<a href="https://academic.oup.com/nar/article/3574061/" target="_blank">TAREAN: a computational tool for identification and characterization of satellite DNA from unassembled short reads</a>.&nbsp;<em>Nucleic Acids Res.</em>, doi:10.1093/nar/gkx257</p><p>Address of the bookmark: <a href="https://bitbucket.org/petrnovak/repex_tarean" rel="nofollow">https://bitbucket.org/petrnovak/repex_tarean</a></p>]]></description>
	<dc:creator>Surabhi Chaudhary</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/17176/arvados</guid>
	<pubDate>Sat, 20 Sep 2014 16:54:21 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/17176/arvados</link>
	<title><![CDATA[Arvados]]></title>
	<description><![CDATA[<p>Arvados is a free and open&nbsp;source bioinformatics&nbsp;platform for genomic and&nbsp;biomedical data. User can&nbsp;Store | Organize | Compute | Share the data for free.&nbsp;</p>
<p><img src="https://arvados.org/images/dax.png" width="400" height="535" alt="image" style="border: 0px;"></p><p>Address of the bookmark: <a href="https://arvados.org/" rel="nofollow">https://arvados.org/</a></p>]]></description>
	<dc:creator>Martin Jones</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36918/p-rna-scaffolder-a-fast-and-accurate-genome-scaffolder-using-paired-end-rna-sequencing-reads</guid>
	<pubDate>Tue, 12 Jun 2018 08:14:41 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36918/p-rna-scaffolder-a-fast-and-accurate-genome-scaffolder-using-paired-end-rna-sequencing-reads</link>
	<title><![CDATA[P_RNA_scaffolder: a fast and accurate genome scaffolder using paired-end RNA-sequencing reads]]></title>
	<description><![CDATA[P_RNA_scaffolder, a fast and accurate tool using paired-end RNA-sequencing reads to scaffold genomes. This tool aims to improve the completeness of both protein-coding and non-coding genes. After this tool was applied to scaffolding human contigs, the structures of both protein-coding genes and circular RNAs were almost completely recovered and equivalent to those in a complete genome, especially for long proteins and long circular RNAs.<p>Address of the bookmark: <a href="http://www.fishbrowser.org/software/P_RNA_scaffolder/" rel="nofollow">http://www.fishbrowser.org/software/P_RNA_scaffolder/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41673/lr-gapcloser-a-tiling-path-based-gap-closer-that-uses-long-reads-to-complete-genome-assembly</guid>
	<pubDate>Thu, 14 May 2020 15:09:52 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41673/lr-gapcloser-a-tiling-path-based-gap-closer-that-uses-long-reads-to-complete-genome-assembly</link>
	<title><![CDATA[LR_Gapcloser: a tiling path-based gap closer that uses long reads to complete genome assembly]]></title>
	<description><![CDATA[<p>LR_Gapcloser is a gap closing tool using long reads from studied species. The long reads could be downloaed from public read archive database (for instance, NCBI SRA database ) or be your own data. Then they are fragmented and aligned to scaffolds using BWA mem algorithm in BWA package. In the package, we provided a compiled bwa, so the user needn't to install bwa. LR_Gapcloser uses the alignments to find the bridging that cross the gap, and then fills the long read original sequence into the genomic gaps.</p><p>Address of the bookmark: <a href="https://github.com/CAFS-bioinformatics/LR_Gapcloser" rel="nofollow">https://github.com/CAFS-bioinformatics/LR_Gapcloser</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37576/lrcstats-a-tool-for-evaluating-long-reads-correction-methods</guid>
	<pubDate>Wed, 22 Aug 2018 11:05:04 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37576/lrcstats-a-tool-for-evaluating-long-reads-correction-methods</link>
	<title><![CDATA[LRCstats: a tool for evaluating long reads correction methods]]></title>
	<description><![CDATA[<p><span>LRCstats is an open-source pipeline for benchmarking DNA long read correction algorithms for long reads outputted by third generation sequencing technology such as machines produced by Pacific Biosciences. The reads produced by third generation sequencing technology, as the name suggests, are longer in length than reads produced by next generation sequencing technologies, such as those produced by Illumina. However, long reads are plagued by high error rates, which can cause issues in downstream analysis. Long read correction algorithms reduce the error rate of long reads either through self-correcting methods or using accurate, short reads outputted by next generation sequencing technologies to correct long reads.</span></p><p>Address of the bookmark: <a href="https://github.com/cchauve/lrcstats" rel="nofollow">https://github.com/cchauve/lrcstats</a></p>]]></description>
	<dc:creator>Aaryan Lokwani</dc:creator>
</item>

</channel>
</rss>