<?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/27099?offset=870</link>
	<atom:link href="https://bioinformaticsonline.com/related/27099?offset=870" 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/19635/walk-in-interview-for-research-associate-studentship-and-traineeship-at-bif-nehu-tura-campus</guid>
  <pubDate>Thu, 18 Dec 2014 11:02:05 -0600</pubDate>
  <link></link>
  <title><![CDATA[Walk in interview for Research Associate, Studentship and Traineeship at BIF, NEHU, Tura Campus]]></title>
  <description><![CDATA[
<p>BIOINFORMATICS INFRASTRUCTURE FACILITY (BIF)<br />Department of RDAP<br />North-Eastern Hil University, Tura Campus<br />Tura-79402, Meghalaya</p>

<p>Walk in interview for Research Associate, Studentship and Traineeship at BIF</p>

<p>Applications are invited for the Post of Research Associate, Traineeship and Studentship in the DBT sponsored Bioinformatics Infrastructure Facility (BIF) at the Bioinformatics Centre, Department of RDAP, North-Eastern Hil University, Tura Campus, Tura-79402, Meghalaya. The Posts are purely temporary and terminable at any time without prior notice or assigning any reason thereof. The person engaged, shall not be entailed for any claim implicit or explicit for permanent absorption in the University.</p>

<p>Research Associate- 01</p>

<p>Essential Qualification: M.Sc. in Bioinformatics/Biotechnology from a recognized University/ institute.</p>

<p>Desirable: PhD or Pursuing PhD in the relevant subject(s) or equivalent published work in reputed peer reviewed journals or Advance PG diploma in Bioinformatics courses.</p>

<p>Duties: Creation of database, web designing, maintenance of internet, training of students in Bioinformatics, handling and knowledge of Bioinformatics software tools and technique, conducting Bioinformatics based research and other day to day laboratory work, writing report and scientific papers.</p>

<p>Pay:Rs. 2,00/- + Admissible 10% HRA per month</p>

<p>Age: Below 35 years</p>

<p>Traineeship- 02</p>

<p>Students who have completed Masters Degree in Bioinformatics/Biotechnology or any branch of Life Sciences/Agricultural Sciences/Computer Science to cary out a project work in Bioinformatics.</p>

<p>Desirable: Prior Knowledge of programming languages such as C, JAVA, MySQL is preferable.</p>

<p>Stipend: Rs. 800/- p.m. fixed. Purely temporary for a period of six months.</p>

<p>Studentship: 02</p>

<p>Students pursuing postgraduate degree in Bioinformatics/biotechnology/Agricultural Sciences or any branch of Life Science</p>

<p>Desirable: Prior knowledge of bioinformatics/ programming language is preferable.</p>

<p>Stipend: 800/- p.m. fixed. Purely temporary for a period of six months.</p>

<p>Candidates must send the detailed Biodata via mail/post and bring al the relevant documents in original and one set of attested photocopies of the same at the time of interview. No TA/DA will be paid for attending the interview and candidates have to make their own arrangements.</p>

<p>Last date for receiving application by mail or by post: 16.02.2014</p>

<p>Contact Information:<br />Dr.B.K. Mishra<br />Cordinator BIF,<br />RDAP Department, NEHU, Tura Campus<br />Phone: 91-03651-23107<br />Fax: 91-03651-23953<br />E-mail: drbkm1972@yaho.co.in, birendramishra14@gmail.com</p>

<p>Advertisement: http://www.nehu.ac.in/Advertisements/BIF_TuraAdtvPV_171214.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/19597/assistant-professor-at-gauhati-university-guwahati</guid>
  <pubDate>Tue, 16 Dec 2014 01:15:30 -0600</pubDate>
  <link></link>
  <title><![CDATA[Assistant Professor at GAUHATI UNIVERSITY, GUWAHATI]]></title>
  <description><![CDATA[
<p>Advt. No.T/2014/4</p>

<p>Ref. No. GU/Estt/T/308(VI)/2014/6451-61</p>

<p>Applications are invited from the Indian citizens for five (5) teaching posts of Assistant Professor (Contractual) under various departments of Gauhati University. Details of the advertisement, other terms and conditions and the application forms are available in the University website www.gauhati.ac.in</p>

<p>Asstt. Professor (Contractual)</p>

<p>    2. M.Sc. Microbiology Course in Botany</p>

<p>    3 1.M.Sc. Microbiology/M.Sc. Botany (Specialization in Microbiology)/M.Sc. Biochemistry (1 post). (Preference will be given to candidates having experience in Biochemistry).</p>

<p>    2.M.Sc. Microbiology/M.Sc. Botany (Specialization in Microbiology)/M.Sc. Biotechnology(1 post). (Preference will be given to candidates having experience in Bioinformatics).</p>

<p>    3.M.Sc. Microbiology/M.Sc. Botany (Specialization in Microbiology)/M.Sc.  Biotechnology(1 post). (Preference will be given to candidates having experience in Microbial Genetics).</p>

<p>As per UGC norms</p>

<p>Pay Band &amp; Academic Grade Pay : (Consolidated pay) : Rs. 21,600/- per month</p>

<p>Application Form : Prescribe application form may download from the G.U. website www.gauhati.ac.in</p>

<p>Last date of receipt of filled-in application is 08.01.2015.</p>

<p>Advertisement: www.gauhati.ac.in/openfile.php?file=Notice1258.pdf</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/19695/china-university-of-macau-phd-position-2015-in-bioinformatics-computer-science</guid>
  <pubDate>Mon, 22 Dec 2014 00:12:49 -0600</pubDate>
  <link></link>
  <title><![CDATA[China University of Macau PhD Position 2015 in Bioinformatics, Computer Science]]></title>
  <description><![CDATA[
<p>The Computational Biology and Bioinformatics Group at the University of Macau is inviting applications for PhD Position. Applicants will work on a research project focusing on the flexible receptor protein-ligand docking algorithms for computer-aided drug design.  The candidate will be working as part of a team in developing novel metaheuristic algorithms and scoring functions for large-scale, highly flexible protein-ligand docking problems. The duration of this PhD position is 2-3 years, starting in August 2015. Remuneration paid to candidate is MOP 11000-14000/month (~USD 1375-1750/month). The applications should be submitted before March 2015.</p>

<p>Study Subject(s): PhD position is award in the field of Bioinformatics/Computer Science.<br />Course Level: Position is available for pursuing PhD degree level at the University of Macau.<br />Scholarship Provider: University of Macau<br />Scholarship can be taken at: China</p>

<p>Eligibility: The ideal candidate would be a master degree holder in Bioinformatics or related disciplines with knowledge in Medical sciences or Life sciences (with GPA of at least 3.0 on a 4-point scale or equivalent) . Knowledge in programming (C and C++) and Linux scripting are necessary; experience in molecular docking, molecular dynamics simulations or molecular modeling is an advantage. The candidate should be fluent in spoken and written English; preference will be given to applicants with good publication records in relevant areas.</p>

<p>Scholarship Open for International Students: Researchers from China can apply for this PhD position.</p>

<p>Scholarship Description:</p>

<p>The Computational Biology and Bioinformatics Group at the University of Macau is looking for a motivated PhD student in Bioinformatics or Computer Science to work on a research project focusing on the flexible receptor protein-ligand docking algorithms for computer-aided drug design.  The candidate will be working as part of a team in developing novel metaheuristic algorithms and scoring functions for large-scale, highly flexible protein-ligand docking problems.</p>

<p>Number of award(s): There is only one PhD position available.</p>

<p>Duration of award(s): The duration of this PhD position is 2-3 years.</p>

<p>What does it cover? Remuneration paid to candidate is  MOP 11000-14000/month (~USD 1375-1750/month).</p>

<p>Selection Criteria: Not Known</p>

<p>Notification: Not Known</p>

<p>How to Apply: Send your current CV, your academic transcripts, a letter of motivation and research interests, two letters of recommendations from academic faculty to Dr. Shirley Siu at shirleysiu[at]umac.mo before March 2015.</p>

<p>Scholarship Application Deadline: The applications should be submitted before March 2015.</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/19811/jnu-neurosciencesystems-biologymathematical-modeling-jrf-vacancies</guid>
  <pubDate>Fri, 26 Dec 2014 11:22:20 -0600</pubDate>
  <link></link>
  <title><![CDATA[JNU Neuroscience/Systems Biology/Mathematical modeling JRF Vacancies]]></title>
  <description><![CDATA[
<p>School of Computational and Integrative Sciences<br />Jawaharlal Nehru University<br />New Delhi 110067</p>

<p>Recruitment for Project</p>

<p>Applications were invited from the citizens of India for filling up the following temporary position for the CSIR sponsored Fellowship in the School of Computational and Integrative Sciences, Jawaharlal Nehru University, New Delhi 110067. This position is temporary for a period of two and half years or tenable only for the duration of the project. The requisite qualifications &amp; experience are given below.</p>

<p>Project Title : "Understanding Complex dynamics and Information processing in Brain Networks"<br />Funding Agency : CSIR</p>

<p>Principal Investigator : Dr. R.K. Brojen Singh</p>

<p>Position : Junior Research Fellow(One post)</p>

<p>Salary : As per CSIR rules and guidelines for JRF.</p>

<p>Qualifications &amp; Experience : M.Sc. in Physics/Mathematics/Biology/B.Tech. In Eng. Physics/Comp. Sc. and desirable CSIR-UGC NET Qualified. Candidates should also have at least one years research experience after M. Sc./B.Tech. in works related to Neuroscience/Mathematical modeling.</p>

<p>Candidates possessing requisite qualifications may apply either on plain paper stating the project title along with CV and send to the following address or send as email attachment (pdf or word format) so as to reach on or before 8 January, 2014.</p>

<p>Dr. R.K. Brojen Singh<br />School of Computational and Integrative Sciences<br />Jawharlal Nehru University<br />New Delhi 110067<br />Email: brojen@jnu.ac.in, brojen@mail.jnu.ac.in</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37496/gsearch-a-fast-and-flexible-general-search-tool-for-whole-genome-sequencing</guid>
	<pubDate>Mon, 06 Aug 2018 17:19:15 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37496/gsearch-a-fast-and-flexible-general-search-tool-for-whole-genome-sequencing</link>
	<title><![CDATA[gSearch: a fast and flexible general search tool for whole-genome sequencing]]></title>
	<description><![CDATA[<p><span>gSearch compares sequence variants in the Genome Variation Format (GVF) or Variant Call Format (VCF) with a pre-compiled annotation or with variants in other genomes. Its search algorithms are subsequently optimized and implemented in a multi-threaded manner.&nbsp;</span></p><p>Address of the bookmark: <a href="http://ml.ssu.ac.kr/gSearch/index.html" rel="nofollow">http://ml.ssu.ac.kr/gSearch/index.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37643/lorma-a-tool-for-correcting-sequencing-errors-in-long-reads</guid>
	<pubDate>Thu, 06 Sep 2018 16:21:01 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37643/lorma-a-tool-for-correcting-sequencing-errors-in-long-reads</link>
	<title><![CDATA[LoRMA: A tool for correcting sequencing errors in long reads]]></title>
	<description><![CDATA[<p><span>An error correction method that uses long reads only. The method consists of two phases: first, we use an iterative alignment-free correction method based on de Bruijn graphs with increasing length of&nbsp;</span><em>k</em><span>-mers, and second, the corrected reads are further polished using long-distance dependencies that are found using multiple alignments. According to our experiments, the proposed method is the most accurate one relying on long reads only for read sets with high coverage. Furthermore, when the coverage of the read set is at least 75&times;, the throughput of the new method is at least 20% higher.</span></p>
<blockquote>
<p><span>conda install -c atgc-montpellier lorma</span></p>
</blockquote><p>Address of the bookmark: <a href="https://gite.lirmm.fr/lorma/lorma-releases/wikis/home" rel="nofollow">https://gite.lirmm.fr/lorma/lorma-releases/wikis/home</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>

</channel>
</rss>