<?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/27261?offset=810</link>
	<atom:link href="https://bioinformaticsonline.com/related/27261?offset=810" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<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/18820/jrfsrf-at-university-of-calcutta</guid>
  <pubDate>Fri, 31 Oct 2014 08:53:10 -0500</pubDate>
  <link></link>
  <title><![CDATA[JRF/SRF at University of Calcutta]]></title>
  <description><![CDATA[
<p>Applications are invited to appear at a walk-in-interview for one post of Junior Research Fellow in the DBT(DBT Twinning NER) sponsored project entitled “Protein folding kinetics is a selection force on shaping codon usage bias in the high expression genes” in the room of the HOD, Department of Biotechnology and the Coordinator, DR. B. C. Guha Centre for Genetic Engineering and Biotechnology, University College of Science, 35 Ballygunge Circular Road, Kolkata 700019 on the 12th November, 2014 at 3:00 p.m.</p>

<p>Essential qualifications: First class M. Sc. in any branch of life sciences and qualified CSIR-UGC NET/GATE Examination.</p>

<p>Desirable qualifications: Practical experience in biochemical and biophysical studies of proteins</p>

<p>Emoluments: as per DBT norms</p>

<p>The project is tenable for two years, initially for one year.</p>

<p>Age: Below 28 years (relaxable in the case of SC/ST/OBC/women candidates)</p>

<p>Candidates are requested to bring two sets of complete applications on plain paper furnishing bio-data and copies of attested certificates along with originals (for verification) on the date of interview.</p>

<p>No TA/DA is admissible for candidates appearing at the interview.</p>

<p>Dr. Rajat Banerjee<br />Assistant Professor<br />Department of Biotechnology and<br />Dr. B. C. Guha Centre for Genetic Engineering and Biotechnology<br />University College of Science<br />35, Ballygunge Circular Road<br />Kolkata 700019</p>

<p>Advertisement: www.caluniv.ac.in/news/jrf_biotech_2.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/opportunity/view/19085/jrf-in-bioinformatics-pondicherry-university</guid>
  <pubDate>Sat, 08 Nov 2014 14:34:48 -0600</pubDate>
  <link></link>
  <title><![CDATA[JRF in Bioinformatics @ Pondicherry University]]></title>
  <description><![CDATA[
<p>Eager to get JRF job in Puducherry? Pondicherry University, School of Life Sciences, Centre for Bioinformatics has issued notification to fill the vacancy of JRF for DST sponsored research project entitled "Design and discovery of aurora kinase inhibitors as anti cancer drugs; application of computer aided drug design". It is good chance to get job with Pondicherry University and secure your future. Learn eligibility criteria and apply on or before 21.11.2014.</p>

<p>Required Skills:	no special skills required for this job post<br />Required Experience:	<br />Experience in computer aided drug design and or biochemical testing of natural or synthetic compounds is desired<br />Required Education:	<br />M.Sc. / M.Tech.</p>

<p>Required Job Profile:<br />Candidate must possess M.Sc. in bioinformatics or computational biology or biotechnology or any branch of life sciences or pharmacology or chemical sciences or M.Tech. in any branch of life sciences with at least fifty five percent marks with NET or GATE.</p>

<p>Desired Job Profile:<br />Candidate having experience in computer aided drug design and or biochemical testing of natural or synthetic compounds.</p>

<p>How to apply:<br />Eligible and interested candidates should need to appear for walk-in interview on 21.11.2014 at 1700 hrs at the above mentioned address.</p>

<p>Contact<br />Pondicherry University<br />Dr. S. Mohane Coumar, Assistant Professor &amp; Project Investigator, Centre for Bioinformatics, Pondicherry University, Puducherry 605 014<br />Email:registrar@pondiuni.edu.in<br />Phone:	0413-2655175</p>

<p>More at http://www.pondiuni.edu.in/sites/default/files/JRF-bioinfor-041114.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36861/eagler-a-scaffolding-tool-for-long-reads</guid>
	<pubDate>Mon, 04 Jun 2018 05:26:03 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36861/eagler-a-scaffolding-tool-for-long-reads</link>
	<title><![CDATA[EAGLER: a scaffolding tool for long reads.]]></title>
	<description><![CDATA[<p>EAGLER is a scaffolding tool for long reads. The scaffolder takes as input a draft genome created by any NGS assembler and a set of long reads. The long reads are used to extend the contigs present in the NGS draft and possibly join overlapping contigs. EAGLER supports both PacBio and Oxford Nanopore reads.</p>
<p>The tool should be compatible with most UNIX flavors and has been successfully tested on the following operating systems:</p>
<ul>
<li>Mac OS X 10.11.1</li>
<li>Mac OS X 10.10.3</li>
<li>Ubuntu 14.04 LTS</li>
</ul>

https://bib.irb.hr/datoteka/844447.Diplomski_2015_Luka_terbi.pdf<p>Address of the bookmark: <a href="https://github.com/mculinovic/EAGLER" rel="nofollow">https://github.com/mculinovic/EAGLER</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/19091/phd-opportunity-aicadd-fellowship-mhrd-govt-of-india-of-university-of-kerala</guid>
  <pubDate>Sat, 08 Nov 2014 15:16:24 -0600</pubDate>
  <link></link>
  <title><![CDATA[PhD opportunity / AiCADD fellowship (MHRD, Govt. of India) of University of Kerala.]]></title>
  <description><![CDATA[
<p>No. DCB/DBT-BIF/229 /14-15                                                                                     07-11-2014</p>

<p>Applications are invited for the AiCADD fellowship (MHRD, Govt. of India) of University of Kerala.</p>

<p>The terms and conditions of the fellowship is given below:</p>

<p>Ø The AiCADD PhD Fellowship scheme will be available for the students registered for full-time research      or   intending to register and pursue full time research at SIUCEB in frontier areas of bioinformatics,    computational biology, systems biology and closely allied areas with focus on Ayur-Informatics. </p>

<p>  Ø  The fellowships will be widely announced and open to students irrespective of geographical consideration.</p>

<p>  Ø  Candidates availing of this fellowship shall not be in receipt of any other fellowships concurrently.</p>

<p>  Ø  Researchers will be selected on the basis of research aptitude test and personal interview.</p>

<p>  Ø  Each selected student will be eligible for a monthly fellowship of Rs. 10,000/- for the 1st and 2nd year and Rs. 12,000/- for the 3rd year.</p>

<p>  Ø  Candidates must register for PhD within one year of joining, failing which the fellowship will have to be    remitted back.</p>

<p>  Ø  Candidates receiving the fellowship shall submit bi-annual reports of progress and the continuation of the fellowship will be based on the evaluation of the same.</p>

<p>  Ø  Candidates are also required to take up academic duties including teaching upto a maximum of 6 hours     per week, as directed by AiCADD Principal Investigator.</p>

<p> Interested candidates may please forward their application along with resume on or before 15th November 2014 in the following address. Principal Investigator, AiCADD Centre, Dept. of Computational Biology and Bioinformatics, University of Kerala, Thiruvananthapuram - 695581.</p>

<p>More at https://sites.google.com/site/centreforbioinformatics/announcements</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37241/remilo-reference-assisted-misassembly-detection-algorithm-using-short-and-long-reads</guid>
	<pubDate>Fri, 06 Jul 2018 04:27:49 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37241/remilo-reference-assisted-misassembly-detection-algorithm-using-short-and-long-reads</link>
	<title><![CDATA[ReMILO: reference assisted misassembly detection algorithm using short and long reads.]]></title>
	<description><![CDATA[ReMILO, a reference assisted misassembly detection algorithm that uses both short reads and PacBio SMRT long reads. ReMILO aligns the initial short reads to both the contigs and reference genome, and then constructs a novel data structure called red-black multipositional de Bruijn graph to detect misassemblies. In addition, ReMILO also aligns the contigs to long reads and find their differences from the long reads to detect more misassemblies.<p>Address of the bookmark: <a href="https://github.com/songc001/remilo" rel="nofollow">https://github.com/songc001/remilo</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37574/simlord-a-read-simulator-for-third-generation-sequencing-reads</guid>
	<pubDate>Wed, 22 Aug 2018 10:40:27 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37574/simlord-a-read-simulator-for-third-generation-sequencing-reads</link>
	<title><![CDATA[SimLoRD: A read simulator for third generation sequencing reads]]></title>
	<description><![CDATA[<p>SimLoRD is a read simulator for third generation sequencing reads and is currently focused on the Pacific Biosciences SMRT error model.</p>
<p>Reads are simulated from both strands of a provided or randomly generated reference sequence.</p>
<div id="rst-header-features">
<ul>
<li>The reference can be read from a FASTA file or randomly generated with a given GC content. It can consist of several chromosomes, whose structure is respected when drawing reads. (Simulation of genome rearrangements may be incorporated at a later stage.)</li>
<li>The read lengths can be determined in four ways: drawing from a log-normal distribution (typical for genomic DNA), sampling from an existing FASTQ file (typical for RNA), sampling from a a text file with integers (RNA), or using a fixed length</li>
<li>Quality values and number of passes depend on fragment length.</li>
<li>Provided subread error probabilities are modified according to number of passes</li>
<li>Outputs reads in FASTQ format and alignments in SAM format</li>
</ul>
</div><p>Address of the bookmark: <a href="https://bitbucket.org/genomeinformatics/simlord/" rel="nofollow">https://bitbucket.org/genomeinformatics/simlord/</a></p>]]></description>
	<dc:creator>Aaryan Lokwani</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37737/rebaler-program-for-conducting-reference-based-assemblies-using-long-reads</guid>
	<pubDate>Tue, 18 Sep 2018 07:52:41 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37737/rebaler-program-for-conducting-reference-based-assemblies-using-long-reads</link>
	<title><![CDATA[Rebaler: program for conducting reference-based assemblies using long reads.]]></title>
	<description><![CDATA[<p>Rebaler is a program for conducting reference-based assemblies using long reads. It relies mainly on&nbsp;<a href="https://github.com/lh3/minimap2">minimap2</a>&nbsp;for alignment and&nbsp;<a href="https://github.com/isovic/racon">Racon</a>&nbsp;for making consensus sequences.</p>
<p>I made Rebaler for bacterial genomes (specifically for the task of&nbsp;<a href="https://github.com/rrwick/Basecalling-comparison">testing basecallers</a>). It should in principle work for non-bacterial genomes as well, but I haven't tested it.</p><p>Address of the bookmark: <a href="https://github.com/rrwick/Rebaler" rel="nofollow">https://github.com/rrwick/Rebaler</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/19544/sau-bioinformaticsplant-biotech-jrf-vacancy</guid>
  <pubDate>Fri, 12 Dec 2014 21:27:12 -0600</pubDate>
  <link></link>
  <title><![CDATA[SAU Bioinformatics/Plant Biotech JRF Vacancy]]></title>
  <description><![CDATA[
<p>Applications are invited for the post of Junior Research Fellow (JRF) to work on SERB, DST funded project entitled “Genome wide analysis of ascorbate oxidase multi-gene family and elucidating its role in negative regulation of stress response in rice” under the supervision of Dr. Ananda Mustafiz, Faculty of Life Sciences and Biotechnology, South Asian University.</p>

<p>Qualification: Highly motivated M.Sc. (Bioinformatics/ Biotechnology/ Life Sciences/ Botany/ Agriculture) students are encouraged to apply. Prior experience in Bioinformatics/Plant tissue culture work is preferable. Preferences would be given to DBT/ CSIR / UGC NET qualified students.</p>

<p>Application Procedure: A detailed CV indicating name, date of birth, address, contact number, e-mail address, educational qualifications, NET qualified or not, research experiences if any, should be e-mailed to This email address is being protected from spambots. You need JavaScript enabled to view it. on or before 24th December 2014.</p>

<p>Important Note: Only short listed candidates will be called for interview at Akbar Bhawan, Chanakyapuri, New Delhi. No TA/DA will be paid for attending the interview. SAU Selection Committee reserves the rights to relax any of the qualifications in case the candidate is found otherwise well qualified. The above- mentioned post is temporary and will be initially offered for a period of one year, which can be extended to one more year.</p>

<p>Advertisement:  www.sau.ac.in/recruitment/vacancy.html</p>
]]></description>
</item>

</channel>
</rss>