<?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/27430?offset=730</link>
	<atom:link href="https://bioinformaticsonline.com/related/27430?offset=730" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<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/21685/uiar-short-term-trainingfinal-year-dissertation-project-in-life-sciencesbioinformaticsbiotech</guid>
  <pubDate>Mon, 16 Mar 2015 23:56:25 -0500</pubDate>
  <link></link>
  <title><![CDATA[UIAR Short-Term Training/Final Year Dissertation Project in Life Sciences/Bioinformatics/Biotech]]></title>
  <description><![CDATA[
<p>Short-term training/Final year dissertation project</p>

<p>Candidates desirous of doing a short-term training / final year dissertation project for MSc (Life Sciences/Bioinformatics/Biotechnology or any science discipline) at UIAR Biophysics and Bioinformatics department may please drop an email atanju@iiar.res.in along with their resume.</p>

<p>Selected candidates will be further intimated. There will be a fees charged for doing the project at UIAR. The projects will be experimental or computational or involve both.</p>

<p>The training scope will be in the following areas but not limited to:</p>

<p>Bioinformatics analysis, Docking and Virtual screening, Molecular Dynamics simulation, Cloning, expression and purification of proteins, Biophysical and Biochemical characterisation of proteins, Crystallization and Structural Studies.</p>

<p>Advertisement: www.iiar.res.in/?q=node/450</p>
]]></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/opportunity/view/21894/bioinformatics-engineer-algorithm-development</guid>
  <pubDate>Wed, 01 Apr 2015 21:39:05 -0500</pubDate>
  <link></link>
  <title><![CDATA[Bioinformatics Engineer -- Algorithm Development]]></title>
  <description><![CDATA[
<p>Centrillion Biosciences is a venture backed life sciences company located in Palo Alto, California. The company provides high quality genomic services to academic and industrial customers including top universities and research institutes. Centrillion Biosciences has an immediate opening for a full-time Bioinformatics Engineer. We're looking for an energetic, innovative, and motivated person who works well independently and on teams. The ideal candidate will have experience designing and implementing efficient algorithms to process large datasets. The role will involve collaborating with research scientists and other engineers, so strong communication skills are a must.</p>

<p>Job Description</p>

<p>• Work within a fast-paced, collaborative environment with small project teams working on a variety of tasks ranging from new product development to DNA data processing<br />• Collaborate with Centrillion research scientists in order to bridge the gap between the laboratory and the digital world<br />• Develop tools to enable research projects to cope with the enormous amounts of data produced by modern DNA sequencing experiments<br />• Build simulation algorithms to help guide and analyze research done in the lab<br />• Solve challenging engineering problems that require the development of innovative algorithms</p>

<p>Requirements</p>

<p>• Strong background in mathematics/statistics with a degree in a related field<br />• Strong analytical, coding, communication, and organizational skills<br />• Experience with algorithm development, simulations, and data analysis<br />• Proficiency in at least one modern programming language (like Python or Perl)<br />• Experience analyzing genetic and biological data sets (e.g., DNA data analysis and image analysis)<br />• Experience with machine learning and pattern recognition is preferred</p>

<p>Please submit your resume at https://www.centrillionbio.com/career/ to apply for this position.</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36950/salsa-a-tool-to-scaffold-long-read-assemblies-with-hi-c</guid>
	<pubDate>Fri, 15 Jun 2018 04:01:15 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36950/salsa-a-tool-to-scaffold-long-read-assemblies-with-hi-c</link>
	<title><![CDATA[SALSA: A tool to scaffold long read assemblies with Hi-C]]></title>
	<description><![CDATA[This code is used to scaffold your assemblies using Hi-C data. This version implements some improvements in the original SALSA algorithm. If you want to use the old version, it can be found in the old_salsa branch.

To use the latest version, first run the following commands:

  cd SALSA
  make
To run the code, you will need Python 2.7, BOOST libraries and Networkx(version lower than 1.2).

If you consider using this tool, please cite our publication which describes the methods used for scaffolding.

Ghurye, J., Pop, M., Koren, S., Bickhart, D., &amp; Chin, C. S. (2017). Scaffolding of long read assemblies using long range contact information. BMC genomics, 18(1), 527. Link

Ghurye, J., Rhie, A., Walenz, B.P., Schmitt, A., Selvaraj, S., Pop, M., Phillippy, A.M. and Koren, S., 2018. Integrating Hi-C links with assembly graphs for chromosome-scale assembly. bioRxiv, p.261149 Link

For any queries, please either ask on github issue page or send an email to Jay Ghurye (jayg@cs.umd.edu).<p>Address of the bookmark: <a href="https://github.com/machinegun/SALSA" rel="nofollow">https://github.com/machinegun/SALSA</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/22283/iihr-recruitment-2015-%E2%80%93-srf-project-asst-research-associate-posts</guid>
  <pubDate>Wed, 06 May 2015 06:13:26 -0500</pubDate>
  <link></link>
  <title><![CDATA[IIHR Recruitment 2015 – SRF, Project Asst &amp; Research Associate Posts]]></title>
  <description><![CDATA[
<p>IIHR Recruitment 2015 – SRF, Project Asst &amp; Research Associate Posts: ICAR-Indian Institute of Horticultural Research (IIHR) has published a notification for the recruitment of Senior Research Fellow, Project Assistant and Research Associate vacancies on temporary basis. Eligible candidates may apply in prescribed application format on or before 15-05-2015. Other details like age, educational qualification, selection process, how to apply are given below…</p>

<p>IIHR Vacancy Details:<br />Total No. of Posts: 14<br />Name of the Post:<br />1. Senior Research Fellow: 12 Posts<br />2. Project Assistant: 01 Post<br />3. Research Associate: 01 Post</p>

<p>Age Limit: Candidates age limit is 40 years for men &amp; 45 years for women for RA post, 35 years for men &amp; 40 years for women for SRF post, 30 years for men &amp; 35 years for women for JRF post and 21 to 40 years for Other as on closing date of receipt of applications. Age relaxation is applicable as per rules.</p>

<p>Educational Qualification: Candidates should possess M.Sc (Ag) Plant Pathology or Microbiology or Biotechnology or Biochemistry or M.Tech (Ag) or Bioinformatics for SRF Posts, 10th class with experience in workshop (welding fitting) for Project Asst Post and M.Sc (Ag) Plant Pathology or M.Sc (Ag) Biotechnology or Ph.D in Plant Pathology or Agricultural Biotechnology for RA Post.</p>

<p>Selection Process: Candidates will be selected based on their performance in interview.</p>

<p>How to Apply: Eligible candidates may send their application in the prescribed format along with attested copies of relevant certificates and should mention name of PI/ Co-PI, Item No. of the Post &amp; name of the post clearly on the application as well as on the cover to the Concerned PI/ Co-PI, Indian Institute of Horticultural Research, Hessaraghatta Lake Post, Bengaluru-560089 on or before 15-05-2015 and attend the interview along with originals, two passport size photographs on 26 &amp; 27-05-2015 from 10:00 AM Onwards.</p>

<p>Important Dates:<br />Last Date for Receipt of Applications: 15-05-2015.<br />Date &amp; Time of Interview: 26 &amp; 27-05-2015 from 10:00 AM Onwards.<br />Venue: IIHR Campus.</p>

<p>More at http://www.iihr.ernet.in/content/srf-jrf-application-format</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/news/view/22017/binc-2015</guid>
	<pubDate>Sat, 11 Apr 2015 20:35:27 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/22017/binc-2015</link>
	<title><![CDATA[BINC 2015 !!!]]></title>
	<description><![CDATA[<p>Pondicherry University,Puducherry,on behalf of Department of Biotechnology, Government of India, will conduct the BINC examination in2015. The objective of this examination is to certify bioinformatics professionals, trained formally as well as self-trained.Registration will open from March 9,2015 to April 30,2015. Pondicherry University, Puducherry has been identified as a nodal agency by the Department of Biotechnology, Govt. of India to coordinate this examination along with nine centres namely, Pune University, Pune; Anna University, Chennai; Calcutta University, Kolkata; Institute of Bioinformatics &amp; Applied Biotechnology, Bangalore; North-Eastern Hill University, Shillong, University of Hyderabad, Hyderabad; University of Kerala, Thiruvananthapuram; Jawaharlal Nehru University, New Delhi and Assam Agricultural University, Guwahati. In the BINC 2013 examination,17 candidates were certified. DBT has agreed to fund Research fellowships for all the BINC qualified Indian nationals to pursue Ph.D. in Indian Institutes/Universities. Note that the candidate must possess a postgraduate degree(or equivalent) &amp; meet the criteria of the institutes/universities in order to avail research fellowship. In addition, cash prize of Rs. 10,000/- will be awarded to the top 10 BINC qualifiers.</p><p>More at http://www.binc.co.in/College/Index_New.aspx</p><p>BINC notification http://www.binc.co.in/PdfDocuments/Notification.pdf</p><p>Few dates to remember:</p><p>Starting of online submission of application: March 9, 2015<br />Last date for submission of application: April 30,2015<br />Examination consists of two parts:<br />Part I (Paper I) : June 7, 2015 (10 AM-12 PM)<br />Part II ( Paper II &amp; III) :June 28, 2015 (9 AM-12 PM &amp; 2 PM-4 PM)</p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</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>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/22040/karpagam-university-coimbatore-of-sr-prof-prof-associate-and-assistant-professors-karpagam-university-coimbatore-coimbatore-tamil-nadu</guid>
  <pubDate>Thu, 16 Apr 2015 00:30:45 -0500</pubDate>
  <link></link>
  <title><![CDATA[Karpagam University, Coimbatore, of Sr. Prof, Prof, Associate and Assistant Professors Karpagam University, Coimbatore - Coimbatore, Tamil Nadu]]></title>
  <description><![CDATA[
<p>Karpagam University, Coimbatore, Recruitment of Sr. Prof, Prof, Associate and Assistant Professors</p>

<p>Name of the College: Karpagam University, Coimbatore</p>

<p>Date of official publication: 15th April 2015</p>

<p>The newspaper wherein this job advertised: The Hindu Newspaper</p>

<p>Name of the posts: Senior Professors, Professors, Associate Professors and Assistant Professors</p>

<p>Departments:<br />Bioinformatics<br />Biotechnology<br />Qualifications/Eligibility: The candidates should have qualifications as M.E/M.Tech/M.A/M.Com/MBA/M.Sc/M.Phil/NET/SLET/Ph.D</p>

<p>Job Location: Coimbatore, TN</p>

<p>Salary: As per college norms</p>

<p>How to apply: Interested and eligible candidates are requested to apply online at http://www.karpagamuniversity.edu.in/career</p>

<p>Last date: As soon as possible from 15th April 2015</p>

<p>Reference: The Hindu Newspaper dated 15-04-2015, Coimbatore edition on 14th page</p>
]]></description>
</item>

</channel>
</rss>