<?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/32129?offset=700</link>
	<atom:link href="https://bioinformaticsonline.com/related/32129?offset=700" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/34702/run-miniasm-assembler-on-nanopore-reads</guid>
	<pubDate>Mon, 18 Dec 2017 04:07:50 -0600</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/34702/run-miniasm-assembler-on-nanopore-reads</link>
	<title><![CDATA[Run miniasm assembler on nanopore reads !]]></title>
	<description><![CDATA[<p>Miniasm is a very fast OLC-based&nbsp;<em>de novo</em>&nbsp;assembler for noisy long reads. It takes all-vs-all read self-mappings (typically by&nbsp;<a href="https://github.com/lh3/minimap">minimap</a>) as input and outputs an assembly graph in the&nbsp;<a href="https://github.com/pmelsted/GFA-spec/blob/master/GFA-spec.md">GFA</a>&nbsp;format. Different from mainstream assemblers, miniasm does not have a consensus step. It simply concatenates pieces of read sequences to generate the final&nbsp;<a href="http://wgs-assembler.sourceforge.net/wiki/index.php/Celera_Assembler_Terminology">unitig</a>&nbsp;sequences. Thus the per-base error rate is similar to the raw input reads.</p><p>Find the detail of the reads repeats:</p><blockquote><p>fq2fa ONT_A.fastq ONT_A.fasta&nbsp;<br /><br />minimap2 -xava-ont ONT_A.fasta ONT_A.fasta -t10 -X &gt; AONT.paf&nbsp;<br /><br />awk '{if($1==$6){print}}' AONT.paf &gt; AONTself.paf&nbsp;<br /><br />awk '$5=="-"' AONTself.paf | awk '{print $1}'| sort|uniq &gt; invertedrepeat.list</p></blockquote><p>Generated a few palindrome and repeats plots (highlighting only repeats largest than 10, 20 and 30 kb)</p><blockquote><p>minidot -f 5 -m 30000 AONTself.paf &gt; AONTself30000.eps&nbsp;<br />sed 's/_template_pass_FAH31515//' AONTself30000.eps &gt; AONTself30000final.eps&nbsp;<br /><br />minidot -f 5 -m 20000 AONTself.paf &gt; AONTself20000.eps&nbsp;<br />sed 's/_template_pass_FAH31515//' AONTself20000.eps &gt; AONTself20000final.eps&nbsp;<br /><br />minidot -f 5 -m 10000 AONTself.paf &gt; AONTself10000.eps&nbsp;<br />sed 's/_template_pass_FAH31515//' AONTself10000.eps &gt; AONTself10000final.eps&nbsp;</p></blockquote><p>Assemble with miniasm:</p><blockquote><p>miniasm -f ONT_A.fasta AONT.paf &gt; AONT.gfa&nbsp;</p><p>grep '^S' AONT.gfa |awk '{print "&gt;"$2"\n"$3}' &gt; AONT_miniasm.fasta&nbsp;<br /><br />minimap2 -xasm10 AONT_miniasm.fasta AONT_miniasm.fasta -t1 -X &gt; AONT_miniasm.paf&nbsp;<br /><br />awk '{if($1==$6){print}}' AONT_miniasm.paf &gt; AONT_miniasm_self.paf&nbsp;<br /><br />minidot -f 5 -m 10000 AONT_miniasm_self.paf &gt; AONT_miniasm_self10000.eps&nbsp;</p></blockquote><p>Njoy the assembly !</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/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/19187/srbioinformatics-analyst-ngs-at-ocimum-biosolution</guid>
  <pubDate>Sat, 15 Nov 2014 04:46:10 -0600</pubDate>
  <link></link>
  <title><![CDATA[Sr.Bioinformatics Analyst (NGS) at Ocimum Biosolution]]></title>
  <description><![CDATA[
<p>“Ocimum Biosolution” is a comprehensive Integrated Life Science Informatics solutions provider with service offerings that span Sample and Data Management (LIMS, Biologics Data Management), Genomics Data Analysis Services such as Gene Expression, Genotyping, and Next Gen Sequencing, Bioinformatics and Genomics Databases (BioExpress®, ToxExpress®) and Bio-IT consulting services.</p>

<p>Experience Required: 3-5 years of experience</p>

<p>No of Positions : Multiple</p>

<p>Qualifications: Candidates with minimum qualification as M.Sc Bioinformatics with 3-5  years of experience in Life sciences R&amp;D or Pharma Industry.</p>

<p>Ph.D candidates with research experience in Bioinformatics with publications in International journal and minimum 2 years of  industry experience in clinical genomics will be preferred for this position.</p>

<p>Requirement:</p>

<p>1.  Must have basic understanding of molecular biology and Genomics.</p>

<p>2. Experience in application development or must have expertise in programming using either of Perl/Python.</p>

<p>3.  Experience in statistical programming using R/Bioconductor/Matlab.</p>

<p>4. Strong concept in statistical and mathematical modelling.</p>

<p>5.  Experience in designing and developing the bioinformatics pipeline.</p>

<p>6.  Must have minimum 2+ years of hands on experience in NSG data analysis such as RNA-Seq,Exome-Seq ,Chip-Seq and downstream analysis.</p>

<p>7. Knowledge in WGS ,WES, Targeted re-sequencing,GWAS and population genomics will be preferred.</p>

<p>8. Must have experience working on opensource software/Framework and commercial software for NGS data analysis and reporting.</p>

<p>9. Should be aware of handling big data and guiding team members on multiple projects simultaneously.</p>

<p>10. Should have experience coordinating with different groups of clinical research scientist for various project requirements.</p>

<p>11. Ability to work as team as well as independently with minimal support.</p>

<p>More at http://www.ocimumbio.com/careers1/</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36800/genomemapper-simultaneous-alignment-of-short-reads-against-multiple-genomes</guid>
	<pubDate>Fri, 25 May 2018 09:29:44 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36800/genomemapper-simultaneous-alignment-of-short-reads-against-multiple-genomes</link>
	<title><![CDATA[GenomeMapper: Simultaneous alignment of short reads against multiple genomes]]></title>
	<description><![CDATA[GenomeMapper is a short read mapping tool designed for accurate read alignments. It quickly aligns millions of reads either with ungapped or gapped alignments. It can be used to align against multiple genomes simulanteously or against a single reference. If you are unsure which one is the appropriate GenomeMapper, you might want to use the latter

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2768987/<p>Address of the bookmark: <a href="http://1001genomes.org/software/genomemapper.html" rel="nofollow">http://1001genomes.org/software/genomemapper.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/videolist/watch/19555/a-3d-map-of-the-human-genome</guid>
	<pubDate>Fri, 12 Dec 2014 22:27:55 -0600</pubDate>
	<link>https://bioinformaticsonline.com/videolist/watch/19555/a-3d-map-of-the-human-genome</link>
	<title><![CDATA[A 3D Map of the Human Genome]]></title>
	<description><![CDATA[<iframe width="" height="" src="https://www.youtube-nocookie.com/embed/dES-ozV65u4" frameborder="0" allowfullscreen></iframe>Suhas Rao and Miriam Huntley (of the Aiden Lab) describe a 3D map of the human genome at kilobase resolution, revealing the principles of chromatin looping. Guest Origami Folding: Sarah Nyquist.

Suhas S.P. Rao*, Miriam H. Huntley*, Neva C. Durand, Elena K. Stamenova, Ivan D. Bochkov, James T. Robinson, Adrian L. Sanborn, Ido Machol, Arina D. Omer, Eric S. Lander, Erez Lieberman Aiden. (2014). A 3D Map of the Human Genome at Kilobase Resolution Reveals Principles of Chromatin Looping. Cell.]]></description>
	
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37211/jbrowse-embeddable-genome-browser-built-completely-with-javascript-and-html5</guid>
	<pubDate>Fri, 29 Jun 2018 09:19:56 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37211/jbrowse-embeddable-genome-browser-built-completely-with-javascript-and-html5</link>
	<title><![CDATA[JBrowse: Embeddable genome browser built completely with JavaScript and HTML5]]></title>
	<description><![CDATA[JBrowse is a fast, embeddable genome browser built completely with JavaScript and HTML5, with optional run-once data formatting tools written in Perl.

Headline Features:
Fast, smooth scrolling and zooming. Explore your genome with unparalleled speed.
Scales easily to multi-gigabase genomes and deep-coverage sequencing.
Quickly open and view data files on your computer without uploading them to any server.
Supports GFF3, BED, FASTA, Wiggle, BigWig, BAM, VCF (with either .tbi or .idx index), REST, and more.  BAM, BigBed, BigWig, and VCF data are displayed directly from chunks of the compressed binary files, no conversion needed.
Includes an optional “faceted” track selector (see demo) suitable for large installations with thousands of tracks.
Very light server resource requirements. In fact, JBrowse has no back-end server code, just tools for formatting data files to be read directly over HTTP. Serve huge datasets from a single low-cost cloud instance.
Can run as a stand-alone app on OSX and Windows using the Electron platform
Highly extensible plugin architecture, with a large plugin registry of existing examples here https://gmod.github.io/jbrowse-registry

https://jbrowse.org/<p>Address of the bookmark: <a href="https://github.com/GMOD/jbrowse" rel="nofollow">https://github.com/GMOD/jbrowse</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>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37959/rainbow-an-integrated-tool-for-efficient-clustering-and-assembling-rad-seq-reads</guid>
	<pubDate>Fri, 19 Oct 2018 08:23:42 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37959/rainbow-an-integrated-tool-for-efficient-clustering-and-assembling-rad-seq-reads</link>
	<title><![CDATA[Rainbow: an integrated tool for efficient clustering and assembling RAD-seq reads]]></title>
	<description><![CDATA[<p><span>Rainbow is developed to provide an ultra-fast and memory-efficient solution to clustering and assembling short reads produced by RAD-seq. First, Rainbow clusters reads using a spaced seed method. Then, Rainbow implements a heterozygote calling like strategy to divide potential groups into haplotypes in a top&ndash;down manner. And along a guided tree, it iteratively merges sibling leaves in a bottom&ndash;up manner if they are similar enough. Here, the similarity is defined by comparing the 2nd reads of a RAD segment. This approach tries to collapse heterozygote while discriminate repetitive sequences. At last, Rainbow uses a greedy algorithm to locally assemble merged reads into contigs. Rainbow not only outputs the optimal but also suboptimal assembly results. Based on simulation and a real guppy RAD-seq data, we show that Rainbow is more competent than the other tools in dealing with RAD-seq data</span></p><p>Address of the bookmark: <a href="https://sourceforge.net/projects/bio-rainbow/files/" rel="nofollow">https://sourceforge.net/projects/bio-rainbow/files/</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>

</channel>
</rss>