<?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/26911?offset=1540</link>
	<atom:link href="https://bioinformaticsonline.com/related/26911?offset=1540" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	
<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/10380/ra-at-alagappa-university</guid>
  <pubDate>Sun, 04 May 2014 23:33:15 -0500</pubDate>
  <link></link>
  <title><![CDATA[RA at ALAGAPPA UNIVERSITY]]></title>
  <description><![CDATA[
<p>DEPARTMENT OF BIOTECHNOLOGY<br />(UGC SAP and DST-FIST &amp; PURSE Sponsored Department)<br />ALAGAPPA UNIVERSITY<br />(A State University Accredited by NAAC with „A‟ Grade)<br />Karaikudi - 630 004, India</p>

<p>WALK IN INTERVIEW</p>

<p>A walk-in Interview for the following position tenable at the Bioinformatics Infrastructure Facility (BIF), Department of Biotechnology, Alagappa University will be held at the Department of Biotechnology, Alagappa University, Karaikudi 630 003 on 15.05.2014 (Thursday) at 01:00 PM. This national facility is funded by the Department of Biotechnology, Ministry of Science and Technology, Government of India, New Delhi. The main objectives of the Centre involve teaching and research activities in bioinformatics/biotechnology.</p>

<p>RA (One Post):</p>

<p>Salary : Rs. 11000 p.m. plus admissible HRA</p>

<p>Qualification: M.Sc., in Bioinformatics/Biotechnology/Biophysics/Biochemistry/ Life Sciences</p>

<p>Interested candidates are encouraged to send their Curriculum Vitae by email to “sk_pandian@rediffmail.com” in advance. On the day of interview, the candidates must produce original certificates in proof of their educational qualification and experience and a recommendation letter from the Head of the Department/Institution where last studied/worked. Candidates who have already passed the required Degree alone are eligible to appear for interview. No TA&amp;DA will be given for attending the interview.</p>

<p>Advertisement: http://www.alagappabiotech.org/Walk%20in%20interview.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41009/genomics-public-data-links</guid>
	<pubDate>Thu, 13 Feb 2020 00:20:00 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41009/genomics-public-data-links</link>
	<title><![CDATA[genomics public data links !]]></title>
	<description><![CDATA[<p>List of publically available databases on google server.</p>
<p>More at <a href="https://software.broadinstitute.org/gatk/download/bundle">https://software.broadinstitute.org/gatk/download/bundle</a></p>
<p><a href="ftp://ftp.ncbi.nlm.nih.gov/snp/organisms/human_9606/VCF/GATK/">ftp://ftp.ncbi.nlm.nih.gov/snp/organisms/human_9606/VCF/GATK/</a>.</p>
<p><a href="ftp://ftp.broadinstitute.org/bundle/hg38/hg38bundle/">ftp://ftp.broadinstitute.org/bundle/hg38/hg38bundle/</a></p><p>Address of the bookmark: <a href="https://console.cloud.google.com/storage/browser/genomics-public-data/resources/broad/hg38/v0?pli=1" rel="nofollow">https://console.cloud.google.com/storage/browser/genomics-public-data/resources/broad/hg38/v0?pli=1</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/10459/associate-professor-bio-informatics-at-university-of-allahabad-in-allahabad</guid>
  <pubDate>Wed, 07 May 2014 00:26:53 -0500</pubDate>
  <link></link>
  <title><![CDATA[Associate Professor - Bio-Informatics at University of Allahabad in Allahabad]]></title>
  <description><![CDATA[
<p>No of vacancies: 01</p>

<p>Pay scale: Pay Band of Rs. 37400-67000 with AGP of Rs. 9000.</p>

<p>i. Educational Qualification: Good academic record with a Ph.D. Degree in the concerned/allied/relevant disciplines.</p>

<p>ii. A Master's Degree with at least 55% marks (or an equivalent grade in a point scale wherever grading system is followed).</p>

<p>iii. A minimum of eight years of experience of teaching and/or research in an academic/research position equivalent to that of Assistant Professor in a University, College or Accredited Research Institution/industry excluding the period of Ph.D. research with evidence of published work and a minimum of 5 publications as books and/or research/policy papers.</p>

<p>iv. Contribution to educational innovation, design of new curricula and courses, and technology - mediated teaching learning process with evidence of having guided doctoral candidates and research students.</p>

<p>v. A minimum score as stipulated in the Academic Performance Indicator (API) based Performance Based Appraisal System (PBAS), set out in UGC Regulation.</p>

<p>Download application form from website: http://www.allduniv.ac.in/</p>

<p>Send your application to the Registrar, University of Allahabad, Allahabad-211002 (U.P.) on or before 30th April 2014</p>

<p>For more details: http://www.allduniv.ac.in/images/adv/backlog/advt-details.pdf OR http://www.allduniv.ac.in/images/news/extension-notice.pdf</p>

<p>Last Apply Date: 30 May 2014</p>
]]></description>
</item>
<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/videolist/watch/10664/dna-replication-process-3d-animation</guid>
	<pubDate>Sat, 10 May 2014 04:41:22 -0500</pubDate>
	<link>https://bioinformaticsonline.com/videolist/watch/10664/dna-replication-process-3d-animation</link>
	<title><![CDATA[DNA Replication Process [3D Animation]]]></title>
	<description><![CDATA[<iframe width="" height="" src="https://www.youtube-nocookie.com/embed/27TxKoFU2Nw" frameborder="0" allowfullscreen></iframe>See an organised list of all the animations: http://doctorprodigious.wordpress.com/hd-animations/]]></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/10748/bioinformatics-phd-at-cuk-kerala</guid>
  <pubDate>Sat, 10 May 2014 20:21:22 -0500</pubDate>
  <link></link>
  <title><![CDATA[Bioinformatics PhD at CUK Kerala]]></title>
  <description><![CDATA[
<p>Applications are invited from highly motivated students (UGC-CSIR-JRF) with a background in Genomics/ Biotechnology/ Molecular Microbiology/ Biochemistry and Bioinformatics to pursue research leading to Ph.D. in the following areas;</p>

<p>    1. Cancer Genomics</p>

<p>    2. Microbial Genetics and Metagenomics</p>

<p>    3. Human Infective Diseases</p>

<p>    4. Computational Drug Design</p>

<p>Interested candidates may apply to Dr. Ranjith N. Kumavath, Assistant Professor &amp; Head, Department of Genomic Science, School of Biological Sciences, Central University of Kerala, Padannakad (PO), Nileshwar, Kasaragod-671328,Kerala. Email: RNkumavath@gmail.com</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36755/minialign-fast-and-accurate-alignment-tool-for-pacbio-and-nanopore-long-reads</guid>
	<pubDate>Thu, 24 May 2018 08:33:26 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36755/minialign-fast-and-accurate-alignment-tool-for-pacbio-and-nanopore-long-reads</link>
	<title><![CDATA[minialign: fast and accurate alignment tool for PacBio and Nanopore long reads]]></title>
	<description><![CDATA[Minialign is a little bit fast and moderately accurate nucleotide sequence alignment tool designed for PacBio and Nanopore long reads. It is built on three key algorithms, minimizer-based index of the minimap overlapper, array-based seed chaining, and SIMD-parallel Smith-Waterman-Gotoh extension.<p>Address of the bookmark: <a href="https://github.com/ocxtal/minialign" rel="nofollow">https://github.com/ocxtal/minialign</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/10925/a-brief-bioinformatics-tutorial</guid>
	<pubDate>Wed, 21 May 2014 12:50:09 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/10925/a-brief-bioinformatics-tutorial</link>
	<title><![CDATA[A Brief Bioinformatics Tutorial]]></title>
	<description><![CDATA[<p>This is about how to use a computer to find what is known about a gene of interest and also how to get new insights about it.</p>
<p>The tutorial is divided in three main parts:</p>
<ul>
<li>In the <strong>Sequence </strong>part, you will see how to look efficiently for a particular protein sequence, how to blast it against the database of your choice to find homologues, how to perform a multiple alignment of the homologues you've selected and how to edit this alignment.</li>
<li>The <strong>Structure </strong>part is about molecular visualization, homology modeling and structural domain prediction.</li>
<li>In the <strong>Function </strong>part, you will be introduced to you 3 useful servers to investigate the function of a protein. i.e. finding interactors, co-expressed genes, see a phylogenetic profile, easily access papers citing your gene etc ...</li>
</ul>
<p>During all the three parts, we will use the <em>S. cerevisiae </em>VPS36 protein as an example.</p><p>Address of the bookmark: <a href="http://www.mrc-lmb.cam.ac.uk/rlw/text/bioinfo_tuto/introduction.html" rel="nofollow">http://www.mrc-lmb.cam.ac.uk/rlw/text/bioinfo_tuto/introduction.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36921/breakpointer-using-local-mapping-artifacts-to-support-sequence-breakpoint-discovery-from-single-end-reads</guid>
	<pubDate>Tue, 12 Jun 2018 12:41:10 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36921/breakpointer-using-local-mapping-artifacts-to-support-sequence-breakpoint-discovery-from-single-end-reads</link>
	<title><![CDATA[Breakpointer: using local mapping artifacts to support sequence breakpoint discovery from single-end reads]]></title>
	<description><![CDATA[Breakpointer is a fast tool for locating sequence breakpoints from the alignment of single end reads (SE) produced by next generation sequencing (NGS). It adopts a heuristic method in searching for local mapping signatures created by insertion/deletions (indels) or more complex structural variants(SVs).<p>Address of the bookmark: <a href="https://github.com/ruping/Breakpointer" rel="nofollow">https://github.com/ruping/Breakpointer</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>