<?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/17926?offset=1020</link>
	<atom:link href="https://bioinformaticsonline.com/related/17926?offset=1020" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38199/pacasus-correction-of-palindromes-in-long-reads-from-pacbio-and-nanopore</guid>
	<pubDate>Mon, 12 Nov 2018 05:26:48 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38199/pacasus-correction-of-palindromes-in-long-reads-from-pacbio-and-nanopore</link>
	<title><![CDATA[Pacasus: Correction of palindromes in long reads from PacBio and Nanopore]]></title>
	<description><![CDATA[<p><br>Tool for detecting and cleaning PacBio / Nanopore long reads after whole genome amplification. Check the poster from the Revolutionizing Next-Generation Sequencing (2nd edition) conference in the source folder:&nbsp;<a href="https://github.com/swarris/Pacasus/blob/master/vib2017.pdf">https://github.com/swarris/Pacasus/blob/master/vib2017.pdf</a>.</p>
<p>The prepint version is found on&nbsp;<a href="http://www.biorxiv.org/content/early/2017/08/09/173872">http://www.biorxiv.org/content/early/2017/08/09/173872</a></p>
<p>It uses the pyPaSWAS framework for sequence alignment (<a href="https://github.com/swarris/pyPaSWAS">https://github.com/swarris/pyPaSWAS</a>)</p><p>Address of the bookmark: <a href="https://github.com/swarris/Pacasus" rel="nofollow">https://github.com/swarris/Pacasus</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>

<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/40531/shasta-long-read-assembler</guid>
	<pubDate>Tue, 14 Jan 2020 06:47:07 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40531/shasta-long-read-assembler</link>
	<title><![CDATA[Shasta long read assembler]]></title>
	<description><![CDATA[<p>The goal of the Shasta long read assembler is to rapidly produce accurate assembled sequence using as input DNA reads generated by&nbsp;<a href="https://nanoporetech.com/">Oxford Nanopore</a>&nbsp;flow cells.</p>
<p>Computational methods used by the Shasta assembler include:</p>
<ul>
<li>Using a&nbsp;<a href="https://en.wikipedia.org/wiki/Run-length_encoding">run-length</a>&nbsp;representation of the read sequence. This makes the assembly process more resilient to errors in homopolymer repeat counts, which are the most common type of errors in Oxford Nanopore reads.</li>
<li>Using in some phases of the computation a representation of the read sequence based on&nbsp;<em>markers</em>, a fixed subset of short k-mers (k &asymp; 10).</li>
</ul>
<p>More at&nbsp;<a href="https://chanzuckerberg.github.io/shasta/index.html">https://chanzuckerberg.github.io/shasta/index.html</a></p><p>Address of the bookmark: <a href="https://github.com/chanzuckerberg/shasta" rel="nofollow">https://github.com/chanzuckerberg/shasta</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/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/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/33398/tiny-python36-notebook</guid>
	<pubDate>Sat, 03 Jun 2017 03:16:28 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/33398/tiny-python36-notebook</link>
	<title><![CDATA[Tiny Python3.6 Notebook]]></title>
	<description><![CDATA[<p><span>This is not so much an instructional manual, but rather notes, tables, and examples for Python syntax. It was created by the author as an additional resource during training, meant to be distributed as a physical notebook. Participants (who favor the physical characteristics of dead tree material) could add their own notes, thoughts, and have a valuable reference of curated examples.</span></p><p>Address of the bookmark: <a href="https://github.com/mattharrison/Tiny-Python-3.6-Notebook/blob/master/python.rst" rel="nofollow">https://github.com/mattharrison/Tiny-Python-3.6-Notebook/blob/master/python.rst</a></p>]]></description>
	<dc:creator>Neel</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/blog/view/37586/julia-programming-language-a-python-and-r-rival</guid>
	<pubDate>Sat, 25 Aug 2018 04:46:39 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/37586/julia-programming-language-a-python-and-r-rival</link>
	<title><![CDATA[Julia Programming Language, a Python and R rival]]></title>
	<description><![CDATA[<p>Big data has grown to become one of the most lucrative fields. In fact, data scientists are some of the most sought people. They are usually hired to analyze, control and parse large chunks of data. Implementing these actions using traditional techniques is not a walk in the park. This is why most data scientists prefer using programming languages such as R and Python. However, there is one more programming language that can do the job. That is Julia programming language.</p><p>What Is Julia Language?</p><p>Julia is a programming language that came into the limelight in 2012. It is a general-purpose programming language that was designed for solving scientific computations. Julia was meant to be an alternative to Python, R and other programming languages that were mainly used for manipulating data. This is because it has numerous features that can minimize the complexities of numerical computations.&nbsp;</p><p>Julia optimizes on the best features of Python and R while at the same time overlooks their weaknesses. This explains why it is viewed as an alternative to these programming languages. For instance, it utilizes the readability and simplicity of Python then performs faster.</p><p>Julia is the most preferred programming language for data scientists and mathematicians. This is because its core features are similar to the ones that are used on most data software. Also, the language is ideal for these two subjects because its syntax is similar to the standard mathematical formulas.</p><p>Key Features Of Julia Language<br />Uses JIT Compilation<br />Parallelism<br />Dynamic Typing<br />Simple Syntax<br />Allows Metaprogramming<br />Accessible to Libraries<br />-1-Array Indexing</p><p>Julia Vs Python And R Programming Languages<br />1. Speed<br />Julia is faster than both Python and R. This is a very critical aspect that is given special attention in the big data programming. The high speed of Julia is because of JIT compilers. You will need to install external libraries on Python to achieve similar speed.</p><p>2. Syntax<br />Julia has a math-friendly syntax. The syntax of this programming language is similar to the mathematical formulas hence can be used to perform mathematical and scientific computations. This syntax makes it easier to learn than Python.</p><p>3. Parallelism<br />Although both Python and R use parallelism, Julia uses a top-level parallelism. Julia allows the processor to perform to the optimum level than what Python and R can achieve.</p><p>4. Versatility<br />Julia programming language is more versatile than Python and R. It allows a programmer to move from different codes and functions with ease.</p><p>The only area that Python and R are superior to Julia is in terms of community. Given that Julia is a new programming language, it has a small community as compared to others which have been around for years.</p><p>In overall Julia programming language is a better alternative that you can use to handle Big data projects. Despite having a small community, it is one of those programming languages that you can easily learn.</p>]]></description>
	<dc:creator>Radha Agarkar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40298/environment-for-tree-exploration-ete-is-a-python-programming-toolkit-that-assists-in-the-recontruction-manipulation-analysis-and-visualization-of-phylogenetic-trees</guid>
	<pubDate>Wed, 27 Nov 2019 05:32:33 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40298/environment-for-tree-exploration-ete-is-a-python-programming-toolkit-that-assists-in-the-recontruction-manipulation-analysis-and-visualization-of-phylogenetic-trees</link>
	<title><![CDATA[Environment for Tree Exploration (ETE) is a Python programming toolkit that assists in the recontruction, manipulation, analysis and visualization of phylogenetic trees]]></title>
	<description><![CDATA[<p><span>The Environment for Tree Exploration (ETE) is a Python programming toolkit that assists in the recontruction, manipulation, analysis and visualization of phylogenetic trees (although clustering trees or any other tree-like data structure are also supported).</span></p>
<p><span>Other tools</span></p>
<p><span><a href="https://github.com/shenwei356/taxonkit">https://github.com/shenwei356/taxonkit</a></span></p>
<p>&nbsp;</p>
<ul>
<li>ETE, version:&nbsp;<a href="https://pypi.org/project/ete3/3.1.1/">3.1.1</a></li>
<li>BioPython, version:&nbsp;<a href="https://pypi.org/project/biopython/1.73/">1.73</a></li>
<li>taxadb, version:&nbsp;<a href="https://pypi.org/project/taxadb/0.9.0">0.10.1</a></li>
<li>TaxonKit, version:&nbsp;<a href="https://github.com/shenwei356/taxonkit/releases/tag/0.10.1">0.5.0</a></li>
</ul><p>Address of the bookmark: <a href="https://pypi.org/project/ete3/3.1.1/" rel="nofollow">https://pypi.org/project/ete3/3.1.1/</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>

</channel>
</rss>