<?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/27799?offset=1150</link>
	<atom:link href="https://bioinformaticsonline.com/related/27799?offset=1150" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34922/camsa-a-tool-for-comparative-analysis-and-merging-of-scaffold-assemblies</guid>
	<pubDate>Thu, 28 Dec 2017 09:10:26 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34922/camsa-a-tool-for-comparative-analysis-and-merging-of-scaffold-assemblies</link>
	<title><![CDATA[CAMSA :: a tool for Comparative Analysis and Merging of Scaffold Assemblies]]></title>
	<description><![CDATA[<p>CAMSA &ndash; is a tool for&nbsp;<span>C</span>omparative&nbsp;<span>A</span>nalysis and&nbsp;<span>M</span>erging of&nbsp;<span>S</span>caffold&nbsp;<span>A</span>ssemblies, distributed both as a standalone software package and as Python library under the MIT license.</p>
<p>Main features:</p>
<ol>
<li>works with any number of scaffold assemblies in de-novo non-progressive fashion</li>
<li>allows to simultaneously work with scaffold assemblies obtained from any&nbsp;<em>in silico</em>&nbsp;and&nbsp;<em>in vitro</em>&nbsp;techniques, supporting multiple existing formats via built-in converters</li>
<li>creates an extensive report with several comparative quality metrics (both on assembly level and on the level of individual assembly points)</li>
<li>constructs a merged combined scaffold assembly</li>
<li>provides an interactive framework for a visual comparative analysis of the given assemblies</li>
</ol><p>Address of the bookmark: <a href="https://cblab.org/camsa/" rel="nofollow">https://cblab.org/camsa/</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/18578/research-scientist-%E2%80%93-national-institute-of-cholera-and-enteric-diseases</guid>
  <pubDate>Wed, 22 Oct 2014 10:26:46 -0500</pubDate>
  <link></link>
  <title><![CDATA[Research Scientist – National Institute of Cholera and Enteric Diseases]]></title>
  <description><![CDATA[
<p>The following post is to be filled up on purely temporary basis under the project entitled "Second phase of Task Force Biomedical Informatics Center of ICMR" under Dr. Santasabuj Das, Scientist 'D' of this Institute:-</p>

<p>01. Scientist II 01<br />Essential: Ph.D. degree in Life Sciences from a recognized university along with a minimum of 2 years of research experience in Bioinformatics as evidenced by publications in the peer reviewed journals.</p>

<p>OR<br />Ph.D. degree in Bioinformatics from a recognized university.</p>

<p>OR<br />M.Sc. in Bioinformatics from a recognized university along with a minimum of 3 years of research experience in Bioinformatics as evidenced by publications in the peer reviewed journals.</p>

<p>Desirable:<br />Thorough Knowledge about In silico genome analysis and comparative genomics.<br />Experience with in silico identification of novel virulence factors of pathogens, host-pathogen interactions and Systems Biology.<br />Additional Postdoctoral research experience in relevant subjects from a recognized institutions.</p>

<p>Rs. 44,000/- p.m. (consolidated) plus 30% HRA</p>

<p>Below 40 years</p>

<p>Applications along with Bio-Data containing detail work experience and full list of publications may be sent via email tosantasabujdas@yahoo.com latest by October 27, 2014.</p>

<p>Short-listed candidates will be called via email for an interview to be held at the institute in the second week of November, 2014.</p>

<p>Advertisement: www.niced.org.in/placements.htm</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/videolist/watch/18866/celebrating-crystallography-an-animated-adventure</guid>
	<pubDate>Fri, 31 Oct 2014 15:59:00 -0500</pubDate>
	<link>https://bioinformaticsonline.com/videolist/watch/18866/celebrating-crystallography-an-animated-adventure</link>
	<title><![CDATA[Celebrating Crystallography - An animated adventure]]></title>
	<description><![CDATA[<iframe width="" height="" src="https://www.youtube-nocookie.com/embed/uqQlwYv8VQI" frameborder="0" allowfullscreen></iframe>NEW: Now with French or Spanish subtitles (click on the 'Captions' icon to select). Plus... Watch the French language version here: https://www.youtube.com/watch?v=PvLu7BOsJhM

X-ray crystallography is arguably one of the greatest innovations of the twentieth century, but not that many people know what it is or how it came about.

Join us on an animated journey through the 100 year history of crystallography -- from the pioneering work of William and Lawrence Bragg in 1913 to the surface of Mars!

Narrated by structural biologist Stephen Curry and produced by animation company 12foot6, the film explores the extraordinary history of crystallography. To date 28 Nobel Prizes have been awarded to projects related to the field and X-ray crystallography remains the foremost technique in determining the structures of a huge range of complex molecules.

This film was produced in celebration of the Bragg Centenary and was funded by STFC.

Watch more science videos on the amazing Ri Channel: http://richannel.org

Watch more animations from 12foot6: http://12foot6.com/

The Ri is on Twitter: http://twitter.com/ri_science
and Facebook: http://www.facebook.com/royalinstitution
Subscribe for the latest science videos: http://richannel.org/newsletter]]></description>
	
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36857/%E2%80%9Cone-code-to-find-them-all%E2%80%9D-a-perl-tool-to-conveniently-parse-repeatmasker-output-files</guid>
	<pubDate>Mon, 04 Jun 2018 03:45:15 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36857/%E2%80%9Cone-code-to-find-them-all%E2%80%9D-a-perl-tool-to-conveniently-parse-repeatmasker-output-files</link>
	<title><![CDATA[“One code to find them all”: a perl tool to conveniently parse RepeatMasker output files]]></title>
	<description><![CDATA[One code to find them all is a set of perl scripts to extract useful information from RepeatMasker about transposable elements, retrieve their sequences and get some quantitative information.

Assemble RepeatMasker hits into complete TE copies, including LTR-retrotransposon
Retrieve corresponding TE sequences, and flanking sequences, from the local fasta files
Compute summary statistics for each TE family (number of TE copies, genome coverage...)
Ambiguous cases such as nested TE can be assembled into copies automatically or manually
Allow for working with a TE user-defined library
Allow for working with only a user-chosen set of TE families


http://doua.prabi.fr/software/one-code-to-find-them-all<p>Address of the bookmark: <a href="http://doua.prabi.fr/software/one-code-to-find-them-all" rel="nofollow">http://doua.prabi.fr/software/one-code-to-find-them-all</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36954/mscaffolder-a-comparative-genome-scaffolding-tool</guid>
	<pubDate>Fri, 15 Jun 2018 04:48:01 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36954/mscaffolder-a-comparative-genome-scaffolding-tool</link>
	<title><![CDATA[mScaffolder: A comparative genome scaffolding tool]]></title>
	<description><![CDATA[<p>A comparative genome scaffolding tool based on MUMmer</p>
<p>mScaffolder scaffolds a genome using an existing high quality genome as the reference. It aligns the two genomes using nucmer utility from MUMmer and then orders and orients the contigs of the candidate genome guided by their alignments to the reference genome. Please send your questions and comments to&nbsp;<a href="mailto:mchakrab@uci.edu">mchakrab@uci.edu</a>.</p>
<p><span>Citation</span><span>&nbsp;</span><a href="https://www.nature.com/articles/s41588-017-0010-y">https://www.nature.com/articles/s41588-017-0010-y</a></p><p>Address of the bookmark: <a href="https://github.com/mahulchak/mscaffolder" rel="nofollow">https://github.com/mahulchak/mscaffolder</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/19161/niab-molecular-biologybioinformatics-scientistra-openings</guid>
  <pubDate>Thu, 13 Nov 2014 13:37:27 -0600</pubDate>
  <link></link>
  <title><![CDATA[NIAB Molecular Biology/Bioinformatics Scientist/RA Openings]]></title>
  <description><![CDATA[
<p>D. No. 1-121/1, 4th and 5th Floors, Axis Clinicals Building, Miyapur, Hyderabad, Telangana, India- 500 049</p>

<p>Email: admin@niab.org.in Telephones: +91 40 2304 9403 Telefax: +91 40 2304 2740<br />Advertisement No: 5/2014</p>

<p>About NIAB National Institute of Animal Biotechnology (NIAB), Hyderabad, an autonomous institute under the aegis of Department of Biotechnology, Government of India, is aimed to harness novel and emerging biotechnologies and create knowledge in the cutting edge areas for improving animal health and productivity.</p>

<p>Applications are invited for the following temporary research positions to work in ongoing DBTBBSRC sponsored research project entitled “Transcriptome Analysis in Indian buffalo and the Genetics of Innate Immunity” at the National Institute of Animal Biotechnology, Hyderabad.</p>

<p>(A) Project Scientist – Level B (One Position)</p>

<p>Emoluments: Rs. 15600 + GP Rs. 5400 + 30 % HRA p.m. (Total emoluments will be Rs. 49,770/-p.m. for the duration of the project)</p>

<p>Essential Qualification: Candidates having M.V.Sc. in Veterinary Microbiology / Veterinary Pathology / Veterinary Public Health / Ph.D. degree in Life Sciences, Biotechnology, Molecular Biology or any other related field from the recognized university are eligible to apply.</p>

<p>The candidate should have a good academic record and research experience as evidenced from published in standard referred journals / patents.</p>

<p>Desirable: Candidates having research experience in the area of tissue culture, genomics, Transcriptomics and Advanced Molecular Biology will be given preference.</p>

<p>Age Limit: Not exceeding 30 years as on last date of the submission of the application.</p>

<p>(B) Research Associate in Bioinformatics (One position)</p>

<p>Fellowship: Rs. 22,000 + 30 % HRA</p>

<p>Essential Qualification: Candidates having Ph.D. degree or M.Tech. with three years of<br />experience in Bioinformatics, Computational Biology, Biotechnology, Life Sciences or any other related field are eligible to apply.</p>

<p>Desirable: Candidate having research experience in the area of next generation sequencing (NGS) data analysis, Genome wide association studies, Genomic selection, advance genomic data analysis etc., will be given preference. The candidate should have a good academic record and research experience as evidenced from published papers in standard journals / patents.</p>

<p>Age Limit: Not exceeding 30 years as on last date of the submission of the application.</p>

<p>Project Duration: The duration of the project is Three years and the positions are co- terminus with the duration of the project. (Initial appointment will be for one year and further extension will be granted based on annual review).</p>

<p>Mode of submission of application: Only online applications are to be submitted through<br />www.niab.org.in on or before 08 December, 2014. Link for online submission of applications will be available from 10 November 2014.</p>

<p>Advertisement: www.niab.org.in/Notifications/Advt_5_2014/Advt_5_2014.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37524/fmlrc-a-long-read-error-correction-tool-using-the-multi-string-burrows-wheeler-transform</guid>
	<pubDate>Fri, 10 Aug 2018 13:29:28 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37524/fmlrc-a-long-read-error-correction-tool-using-the-multi-string-burrows-wheeler-transform</link>
	<title><![CDATA[FMLRC: a long-read error correction tool using the multi-string Burrows Wheeler Transform]]></title>
	<description><![CDATA[<p><span>FMLRC, or FM-index Long Read Corrector, is a tool for performing hybrid correction of long read sequencing using the BWT and FM-index of short-read sequencing data. Given a BWT of the short-read sequencing data, FMLRC will build an FM-index and use that as an implicit de Bruijn graph. Each long read is then corrected independently by identifying low frequency k-mers in the long read and replacing them with the closest matching high frequency k-mers in the implicit de Bruijn graph. In contrast to other de Bruijn graph based implementations, FMLRC is not restricted to a particular k-mer size and instead uses a two pass method with both a short "k-mer" and a longer "K-mer". This allows FMLRC to correct through low complexity regions that are computational difficult for short k-mers.</span></p><p>Address of the bookmark: <a href="https://github.com/holtjma/fmlrc" rel="nofollow">https://github.com/holtjma/fmlrc</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/19249/bioinformatics-jrfrasrf-position-at-panjab-university</guid>
  <pubDate>Wed, 19 Nov 2014 20:19:49 -0600</pubDate>
  <link></link>
  <title><![CDATA[Bioinformatics JRF/RA/SRF position at PANJAB UNIVERSITY]]></title>
  <description><![CDATA[
<p>CENTRE FOR SYSTEMS BIOLOGY &amp; BIOINFORMATICS<br />UIEAST, PANJAB UNIVERSITY, CHANDIGARH</p>

<p>Applications are invited along with complete bio-data and attested copies of certificates of qualifications, experience etc. for the one post of Research Fellow and one post of Program Assistant under PURSE Grant of the University in Centre for Systems Biology &amp; Bioinformatics, UIEAST, Panjab University, Chandigarh which is tenable till the period of<br />the project.</p>

<p>Essential Qualification</p>

<p>For Research Fellow:-</p>

<p>M.Sc. in Systems Biology and Bioinformatics / Life Sciences with minimum 55% marks.</p>

<p>Preference will be given to NET/GATE/ICMR qualified candidates without fellowship however, candidates who have cleared the Panjab University Ph.D. entrance test in Systems Biology &amp; Bioinformatics will also be eligible.</p>

<p>For Program Assistant:-</p>

<p>The candidate must have M.Sc./M.Tech/MCA/PGDCA in Computer Science and must be able to handle LAN, Linex. Preference will be given to the candidate having experience in<br />System Administration.</p>

<p>Emoluments</p>

<p>For Research Fellow Rs. 12,500/- per month (Fixed)<br />For Program Assistant Rs. 12,500/- per month (Fixed)</p>

<p>Applications should be reach on or before 19-11-2014 in the office of the undersigned.</p>

<p>Interview will be held on 21-11-2014 in the office of the Coordinator, Centre for Systems Biology &amp; Bioinformatics, South Campus, Block-3, Sector-25, Panjab University, Chandigarh. No TA/DA will be paid.</p>

<p>Advertisement:</p>

<p>http://jobs.puchd.ac.in/includes/jobs/2014/20141110143634-Advertisement.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37672/seqmonka-tool-to-visualise-and-analyse-high-throughput-mapped-sequence-data</guid>
	<pubDate>Tue, 11 Sep 2018 04:39:38 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37672/seqmonka-tool-to-visualise-and-analyse-high-throughput-mapped-sequence-data</link>
	<title><![CDATA[SeqMonk:A tool to visualise and analyse high throughput mapped sequence data]]></title>
	<description><![CDATA[<p>SeqMonk is a program to enable the visualisation and analysis of mapped sequence data. It was written for use with mapped next generation sequence data but can in theory be used for any dataset which can be expressed as a series of genomic positions. It's main features are:</p>
<ul>
<li>Import of mapped data from mapped data (BAM/SAM/bowtie etc)</li>
<li>Creation of data groups for visualisation and analysis</li>
<li>Visualisation of mapped regions against an annotated genome.</li>
<li>Flexible quantitation of the mapped data to allow comparisons between data sets</li>
<li>Statistical analysis of data to find regions of interest</li>
<li>Creation of reports containing data and genome annotation</li>
</ul><p>Address of the bookmark: <a href="http://www.bioinformatics.babraham.ac.uk/projects/seqmonk/" rel="nofollow">http://www.bioinformatics.babraham.ac.uk/projects/seqmonk/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>