<?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/4193?offset=520</link>
	<atom:link href="https://bioinformaticsonline.com/related/4193?offset=520" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/file/view/5307/clean-the-fasta-file</guid>
	<pubDate>Thu, 03 Oct 2013 14:19:14 -0500</pubDate>
	<link>https://bioinformaticsonline.com/file/view/5307/clean-the-fasta-file</link>
	<title><![CDATA[Clean the FASTA file]]></title>
	<description><![CDATA[<p>Mostly FASTA file contain NNN characters, which can be replace by random A T G C character with this perl script. It also print the FASTA sequence name, N's counts, nucleotide count and percentage details at command prompt/standard output.</p><p>&nbsp;</p>]]></description>
	<dc:creator>Jit</dc:creator>
	<enclosure url="https://bioinformaticsonline.com/file/download/5307" length="1408" type="text/x-perl" />
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/12940/ra-at-iiser-kolkata-computational-biologybioinformatics</guid>
  <pubDate>Wed, 23 Jul 2014 06:24:28 -0500</pubDate>
  <link></link>
  <title><![CDATA[RA at IISER Kolkata Computational Biology/Bioinformatics]]></title>
  <description><![CDATA[
<p>Applications are invited from suitable candidates for research associate (post-doc; Rs. 22000-32000)/research fellow (16000-18000)/project assistant (Rs. 10000-14000) positions in the Department of Biological Sciences, Indian Institute for Science Education and Research Kolkata in the extramural project. Condition to satisfactory performance, the positions is for a period of upto 2 years (or funding of the project).</p>

<p>Brief description: We are looking for suitable candidates in the area o computational biology/bioinformatics/genomics or related field for next-generation sequencing (NGS) data analysis for small-RNAs, RNA-Seq and targeted resequencing of plants and associated organisms. We are an interdisciplinary group where projects equally involve bioinformatics and systems biology (specially microarrays and next-generation sequencing (NGS) data analysis and its use), along with plant molecular biology, genetic engineering, field biology, and analytical plant chemistry for understanding response of plants to biotic stresses.</p>

<p>Essential qualification: MSc/BTech/MTech/PhD (or other suitable qualification) in disciplines preferable to bioinformatics, computational biology, computer application (or equivalent)/ ‘Advance Post-Graduate Diploma in Bioinformatics’. Proficiency in programming languages (such as Perl, C++) and/or statistics (proficient in R for example) is compulsory.</p>

<p>Desirable qualification: Experience in the field of genomics e.g. microarray analysis, NGS, genome annotation, database development and management, software development, systems and network biology (or related fields) will be preferred.</p>

<p>Application process: Applications should contain CV along with brief description (maximum 1 page) of research conducted (highlighting skills and experience) till now. Applications should be sent by e-mail to Shree Prakash Pandey, Department of Biological Sciences, Indian Institute of Science Education and Research Kolkata, Mohanpur Campus, WB, India within 14 days of this advertisement.</p>

<p>E-mail: sppiiserkol@gmail.com, sppandey@iiserkol.ac.in</p>

<p>Advertisement:</p>

<p>http://www.iiserkol.ac.in/announcements/adverts/671-advt_ra_shree_prakash_july_2014</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/33693/circleator</guid>
	<pubDate>Sun, 25 Jun 2017 18:04:32 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/33693/circleator</link>
	<title><![CDATA[Circleator]]></title>
	<description><![CDATA[<p>The Charm City Circleator--or Circleator for short--is a Perl-based visualization tool developed at the&nbsp;<a href="http://igs.umaryland.edu/">Institute for Genome Sciences</a>&nbsp;in the University of Maryland's School of Medicine. Circleator produces circular plots of genome-associated data, like this one:</p>
<p><a href="https://camo.githubusercontent.com/0b414f050a7dcb672386932ee0cd83e5f42d2271/687474703a2f2f6a6f6e617468616e63726162747265652e6769746875622e696f2f436972636c6561746f722f696d616765732f43503030323732352d322d3432302e706e673f7261773d74727565" target="_blank"><img src="https://camo.githubusercontent.com/0b414f050a7dcb672386932ee0cd83e5f42d2271/687474703a2f2f6a6f6e617468616e63726162747265652e6769746875622e696f2f436972636c6561746f722f696d616765732f43503030323732352d322d3432302e706e673f7261773d74727565" alt="Sample Circleator image" title="Sample Circleator Image" style="border: 0px;"></a></p>
<p>Common uses of the tool include:</p>
<ul>
<li>Displaying the sequence and/or genes in a&nbsp;<a href="http://www.ncbi.nlm.nih.gov/genbank/">GenBank</a>&nbsp;flat file.</li>
<li>Highlighting differences and/or similarities in gene content between related organisms.</li>
<li>Comparing SNPs and indels between closely-related strains or serovars.</li>
<li>Comparing gene expression values across multiple samples or timepoints.</li>
<li>Visualizing coverage plots of RNA-Seq read alignments.</li>
</ul>
<h3><a href="https://github.com/jonathancrabtree/Circleator#key-features"></a>Key Features</h3>
<p>Circleator...</p>
<ul>
<li>Builds on&nbsp;<a href="http://www.bioperl.org/">BioPerl</a>&nbsp;and the input file formats that it supports, including:
<ul>
<li><a href="http://www.ncbi.nlm.nih.gov/genbank/">GenBank</a>&nbsp;flat files, GFF, FASTA</li>
</ul>
</li>
<li>Accepts a number of other commonly-used datatypes and file formats:
<ul>
<li><a href="http://bsr.igs.umaryland.edu/">BSR</a>&nbsp;and&nbsp;<a href="http://tandem.bu.edu/trf/trf.html">TRF</a>&nbsp;output,&nbsp;<a href="http://samtools.sourceforge.net/">SAM/BAM</a>&nbsp;files,&nbsp;<a href="http://vcftools.sourceforge.net/">VCF</a>-encoded SNPs, tab-delimited files</li>
</ul>
</li>
<li>Outputs publication-ready figures in the&nbsp;<a href="http://www.w3.org/Graphics/SVG/">SVG</a>&nbsp;(Scalable Vector Graphics) format.</li>
<li>Requires only a single configuration file whose layout mirrors that of the figure itself.
<ul>
<li>Predefined configuration files and "track" types are supplied for common datasets.</li>
<li>Advanced features allow limited analyses to be performed as a figure is drawn.</li>
</ul>
</li>
<li>Includes an extensive set of regression tests.</li>
<li>Offers a prototype web-based GUI (under the "Ringmaster" project.)</li>
</ul>
<p>https://github.com/jonathancrabtree/Circleator</p><p>Address of the bookmark: <a href="https://github.com/jonathancrabtree/Circleator" rel="nofollow">https://github.com/jonathancrabtree/Circleator</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/13226/you-and-your-friend-have-similar-dna</guid>
	<pubDate>Sun, 27 Jul 2014 20:44:05 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/13226/you-and-your-friend-have-similar-dna</link>
	<title><![CDATA[You and your friend have similar DNA !!!]]></title>
	<description><![CDATA[<p>New research out of Massachusetts claims that people often choose friends that are similar to them in genetics and they are more accurate than you might suppose. A study published on PNAS&nbsp;http://www.pnas.org/content/111/Supplement_3/10796.full found that people are apt to pick friends who are genetically similar to themselves - so much so that friends tend to be as alike at the genetic level as a person's fourth cousin.</p><div style="text-align: center;"><img src="http://i.kinja-img.com/gawker-media/image/upload/s--CwLwHa43--/18fbmlokxcmqcjpg.jpg" alt="image" width="300" height="271" style="border: 0px; border: 0px;"></div><p>Scientists with a long-running Framingham Heart Study looked at 1,932 people (examination of about 1.5 million markers of genetic variations), comparing unrelated friends to unrelated strangers. They found that friends shared about 1% of their genes &mdash; a percentage much higher than those shared with strangers.This new findings made it clear that people have more DNA in common with those who are selected as friends than with strangers in the same population.&nbsp;</p><p>The genes that lined up the most were olfactory genes, which deal with smell. The ones that lined up the least were immune system genes. The researchers weren't sure why that happened :/. Olfactory genes might be a straightforward explanation: People who like the same smells tend to be drawn to similar environments, where they meet others with the same tendencies.</p><p>Reference:</p><p>http://www.pnas.org/content/111/Supplement_3/10796.full</p><p>Image : http://i.kinja-img.com</p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35148/mojolicious-a-next-generation-web-framework-for-the-perl-programming-language</guid>
	<pubDate>Fri, 12 Jan 2018 16:48:10 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35148/mojolicious-a-next-generation-web-framework-for-the-perl-programming-language</link>
	<title><![CDATA[mojolicious: a next generation web framework for the Perl programming language.]]></title>
	<description><![CDATA[<p><span>Back in the early days of the web, many people learned Perl because of a wonderful Perl library called&nbsp;</span><a href="https://metacpan.org/module/CGI" target="_blank">CGI</a><span>. It was simple enough to get started without knowing much about the language and powerful enough to keep you going, learning by doing was much fun. While most of the techniques used are outdated now, the idea behind it is not. Mojolicious is a new endeavor to implement this idea using bleeding edge technologies.</span></p>
<h2>Features</h2>
<ul>
<li>An amazing&nbsp;<strong>real-time web framework</strong>, allowing you to easily grow single file prototypes into well-structured MVC web applications.
<ul>
<li>Powerful out of the box with RESTful routes, plugins, commands, Perl-ish templates, content negotiation, session management, form validation, testing framework, static file server, CGI/<a href="http://plackperl.org/" target="_blank">PSGI</a>&nbsp;detection, first class Unicode support and much more for you to discover.</li>
</ul>
</li>
<li>A powerful&nbsp;<strong>web development toolkit</strong>, that you can use for all kinds of applications, independently of the web framework.
<ul>
<li>Full stack HTTP and WebSocket client/server implementation with IPv6, TLS, SNI, IDNA, HTTP/SOCKS5 proxy, UNIX domain socket, Comet (long polling), Promises/A+, keep-alive, connection pooling, timeout, cookie, multipart and gzip compression support.</li>
<li>Built-in non-blocking I/O web server, supporting multiple event loops as well as optional pre-forking and hot deployment, perfect for building highly scalable web services.</li>
<li>JSON and HTML/XML parser with CSS selector support.</li>
</ul>
</li>
<li>Very clean, portable and object-oriented pure-Perl API with no hidden magic and no requirements besides Perl 5.24.0 (versions as old as 5.10.1 can be used too, but may require additional CPAN modules to be installed)</li>
<li>Fresh code based upon years of experience developing&nbsp;<a href="http://catalystframework.org/" target="_blank">Catalyst</a>, free and open source.</li>
<li>Hundreds of 3rd party&nbsp;<a href="https://metacpan.org/requires/distribution/Mojolicious">extensions</a>&nbsp;and high quality spin-off projects like the&nbsp;<a href="https://metacpan.org/pod/Minion">Minion</a>&nbsp;job queue.</li>
</ul>
<p>http://mojolicious.org/</p><p>Address of the bookmark: <a href="http://mojolicious.org/" rel="nofollow">http://mojolicious.org/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/13338/protein-function-annotation-and-machine-learning-upmc-paris-france</guid>
  <pubDate>Sat, 02 Aug 2014 01:22:52 -0500</pubDate>
  <link></link>
  <title><![CDATA[Protein function annotation and machine learning - UPMC - Paris, France]]></title>
  <description><![CDATA[
<p>Protein function annotation and machine learning - UPMC - Paris, France</p>

<p>Job Description: We are interested in finding an excellent postdoc with interests in protein functional annotation, machine learning and computer grids. The position is open for 3.5 years at the Université Pierre et Marie Curie, in the heart of paris.</p>

<p>Research topic: Protein function annotation, multiple probabilistic models, domain architecture, machine learning, combinatorial optimization, computer grid.</p>

<p>Title: A novel integrative platform for large scale protein annotation that exploits a multitude of diversified probabilistic models in several protein signature databases.</p>

<p>We propose a novel integrated approach for large scale protein annotation that will exploit an unprecedented amount of genomic data as well as sophisticated machine learning techniques and combinatorial optimization approaches taking advantages of High Performance Computing (HPC) environments. The idea is to uncover as much as possible the evolutionary processes of protein sequences that took place throughout the whole tree of life and that affected the evolution of a protein family. We have already demonstrated in a previous work that the problem of functional annotation is inherent to the ability of uncovering such paths. Now, we shall extend this approach to large scale genome annotation by considering 11 different protein databases, constituted by about 10^9 protein sequences, and by producing a large pool of diversified probabilistic models coding for about 10^7 evolutionary protein pathways. Such models will be used to search for specific domains in genomes to be annotated. Our previous methodology needs to be fundamentally improved to deal with this large amount of biological data. In this project, we shall work on the algorithms to reduce the space of models and the search complexity, and we shall implement some important algorithmic changes towards the realization of a powerful integrated annotation tool.</p>

<p>Where: This project is run on the Laboratoire de Biologie Computationnelle et Quantitative UMR7238 CNRS-UPMC – Analytical Genomics team, headed by A.Carbone. It is co-advised with Pierre-Henri Wuillemin, Laboratoire d’Informatique de Paris 6 – Equipe DECISION.</p>

<p>Start date: September 1st, 2014<br />Contact Person: Alessandra Carbone<br />Contact: alessandra.carbone@lip6.fr</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/13842/swabs-to-genomes-a-comprehensive-workflow</guid>
	<pubDate>Sun, 10 Aug 2014 03:01:21 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/13842/swabs-to-genomes-a-comprehensive-workflow</link>
	<title><![CDATA[Swabs to Genomes: A Comprehensive Workflow]]></title>
	<description><![CDATA[<p>The sequencing, assembly, and basic analysis of microbial genomes, once a painstaking and expensive undertaking, has become almost trivial for research labs with access to standard molecular biology and computational tools. However, there are a wide variety of options available for DNA library preparation and sequencing, and inexperience with bioinformatics can pose a significant barrier to entry for many who may be interested in microbial genomics. The objective of the present study was to design, test, troubleshoot, and publish a simple, comprehensive workflow from the collection of an environmental sample (a swab) to a published microbial genome; empowering even a lab or classroom with limited resources and bioinformatics experience to perform it.</p><p>Address of the bookmark: <a href="https://peerj.com/preprints/453.pdf" rel="nofollow">https://peerj.com/preprints/453.pdf</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/40736/list-of-perl-special-symbols</guid>
	<pubDate>Tue, 28 Jan 2020 06:44:27 -0600</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/40736/list-of-perl-special-symbols</link>
	<title><![CDATA[List of perl special symbols !]]></title>
	<description><![CDATA[<p><span>There are some variables which have a predefined and special meaning in Perl. They are the variables that use punctuation characters after the usual variable indicator ($, @, or %), such as $_ ( explained below ).</span></p><p>Special Symbols &ndash; File handlers</p><blockquote><p>$@ Perl error string</p><p>$! Error number from C, &lsquo;errno&rsquo;</p><p>$^E Extended OS error info, such as &lsquo;CDROM tray not closed&rsquo;</p><p>$? Exit status from last process</p><p>$AGRV &ndash; name of current file</p><p>@ARGV &ndash; command line arguments</p><p>$ARGV &ndash; special file handle for command line filenames</p><p>$. &ndash; current line number</p><p>$/ - input line delimiter</p><p>$\ - output line delimiter</p><p>$% - current page number</p><p>$&amp;/${^MATCH} &ndash; last successful matching string</p><p>$`/${^PREMATCH} &ndash; the string preceding the last matching string</p><p>$&rsquo;/${^POSTMATCH} &ndash; the string following the last matching string</p><p>$1, $2, &hellip; - matching groups in the parentheses in pattern</p></blockquote><p>More at&nbsp;<a href="https://www.tutorialspoint.com/perl/perl_special_variables.htm">https://www.tutorialspoint.com/perl/perl_special_variables.htm</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/14050/assistant-professor-in-bioinformatics-at-indian-institute-of-technology-delhi</guid>
  <pubDate>Fri, 15 Aug 2014 06:16:06 -0500</pubDate>
  <link></link>
  <title><![CDATA[Assistant Professor 	in Bioinformatics at Indian Institute of Technology Delhi]]></title>
  <description><![CDATA[
<p>Indian Institute of Technology Delhi Hauz Khas ,New Delhi – 110016</p>

<p>ROLLING ADVERTISEMENT NO. 01/2014(E-1)<br />ADVERTISEMENT FOR THE POSITIONS OF ASSISTANT PROFESSOR CANDIDATES CAN APPLY ANY TIME DURING THE YEAR.</p>

<p>IIT Delhi invites applications from qualified Indian Nationals, Persons of Indian Origin (PIOs) and Overseas Citizens of India (OCIs) for the following positions in the various Departments/Centres/Schools (in the fields<br />mentioned alongwith them):<br />Post Pay Band Assistant Professor and Assistant Professor (on Contract) Rs.15600-39100 (PB-3) (Minimum pay of Rs.30000/-)+ AGP Rs.8000/-</p>

<p>The following norms will be followed for fixing the basic pay + AGP for Assistant Professors appointed on<br />contract with Ph.D but experience of 3 years or less:-<br />Type Qualification &amp; Experience on the date of joining<br />Assistant Professor (Contract) PB3 (Rs. 15,600-39,100).</p>

<p>MINIMUM QUALIFICATIONS AND EXPERIENCE:<br />Ph.D. with First class at the preceding degree or equivalent in the appropriate branch with very good academic record throughout. A minimum of three years industrial/research/teaching experience, excluding however, the experience gained while Pursuing Ph. D. The candidates should preferably be below<br />35 years of age for male and 38 years for female ( to be relaxed by 5 years in case of persons with physical disability, SC/ST and 3 years in case of OBC-NCL).</p>

<p>Qualified persons include:<br />(a) Indian Nationals,<br />(b) Foreign Nationals who are “Persons of Indian Origin” (PIO) or Overseas<br />Citizens of India (OCI), in whose case, if selected, permission will be sought from Govt. of India<br />before he/she can join IIT Delhi, or<br />(c) Other Foreign Nationals, in whose case, if selected, appointment will be on a contract basis for up to 5 (five) years subject to permission from the Govt. of India before he/she can join IIT Delhi.<br />(d) Institute specifically encourages applicants from SC/ST/OBC category as well as persons<br />with disability to apply for these positions. </p>

<p>AMAR NATH &amp; SHASHI KHOSLA SCHOOL OF INFORMATION TECHNOLOGY:<br />Computational Neuroscience, Medical Applications of Information Technologies, Computational &amp; Systems Biology, Machine to Machine (M2M) Technologies, Embedded Systems &amp; Sensors, Computer Security.<br />KUSUMA SCHOOL OF BIOLOGICAL SCIENCES:<br />In-silico Biology Applications, Systems Biology, Infection Biology, Neurodegeneration. </p>

<p>More at http://www.iitd.ac.in/sites/default/files/jobs/faculty/spl-areas-rolling-advt.pdf</p>

<p>http://www.iitd.ac.in/content/faculty-positions</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/44371/steps-to-find-all-the-repeats-in-the-genome</guid>
	<pubDate>Thu, 31 Aug 2023 02:43:28 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/44371/steps-to-find-all-the-repeats-in-the-genome</link>
	<title><![CDATA[Steps to find all the repeats in the genome !]]></title>
	<description><![CDATA[<div><p>To find repeats in a genome from 2 to 9 length using a Perl script, you can use the RepeatMasker tool with the "--length" option<a href="https://mobilednajournal.biomedcentral.com/articles/10.1186/1759-8753-5-13" target="_blank">[0]</a>. Here's a step-by-step guide:</p></div><div><ol>
<li>Install RepeatMasker: First, you need to install RepeatMasker on your system. You can download it from the RepeatMasker website<a href="https://mobilednajournal.biomedcentral.com/articles/10.1186/1759-8753-5-13" target="_blank">[0]</a>.</li>
</ol></div><div><ol>
<li>Prepare the genome sequence: Make sure you have the genome sequence in a FASTA file format. Let's assume the file is named "genome.fasta".</li>
</ol><blockquote><p>./RepeatMasker -pa &lt;number_of_processors&gt; -nolow -norna -no_is -div &lt;divergence_value&gt; -lib RepeatMaskerLib.embl -gff -xsmall -small -poly -species &lt;species_name&gt; -dir &lt;output_directory&gt; -length &lt;min_length&gt;-&lt;max_length&gt; genome.fasta</p></blockquote><div><p>Replace the following placeholders with appropriate values:</p><ul>
<li><code>&lt;number_of_processors&gt;</code>: The number of processors/threads you want to use for parallel processing.</li>
<li><code>&lt;divergence_value&gt;</code>: The divergence value for the species you are analyzing. You can find divergence values for different species in the RepeatMasker documentation<a href="https://mobilednajournal.biomedcentral.com/articles/10.1186/1759-8753-5-13" target="_blank">[0]</a>.</li>
<li><code>&lt;species_name&gt;</code>: The name of the species you are analyzing.</li>
<li><code>&lt;output_directory&gt;</code>: The directory where you want the output files to be saved.</li>
<li><code>&lt;min_length&gt;</code>&nbsp;and&nbsp;<code>&lt;max_length&gt;</code>: The minimum and maximum lengths of the repeats you want to find (in this case, 2 and 9).</li>
</ul></div><div><ol>
<li>Analyze the output: RepeatMasker will generate several output files, including a .out file. You can parse this file to extract the information you need. There is a Perl tool called "one_code_to_find_them_all.pl" that can help you parse RepeatMasker output files<a href="https://mobilednajournal.biomedcentral.com/articles/10.1186/1759-8753-5-13" target="_blank">[0]</a>. You can download it from the source provided.</li>
</ol></div><div><ol>
<li>Use the provided Perl script: Once you have the "one_code_to_find_them_all.pl" script, you can run it to conveniently parse the RepeatMasker output files. Here's an example of how to use it:</li>
</ol><blockquote><p>perl one_code_to_find_them_all.pl --rm &lt;RepeatMasker_out_file&gt; --length &lt;length_file&gt;</p></blockquote></div><p>&nbsp;</p></div><div><div><p>Replace&nbsp;<code>&lt;RepeatMasker_out_file&gt;</code>&nbsp;with the path to your RepeatMasker .out file, and&nbsp;<code>&lt;length_file&gt;</code>&nbsp;with the path to a file containing the lengths of the reference elements.</p></div><div><p>This script will generate several output files, including .log.txt and .copynumber.csv, which contain quantitative information about the identified repeat elements.</p></div><div><p>Remember to adjust the parameters and options according to your specific needs and the characteristics of your genome.</p></div></div>]]></description>
	<dc:creator>Neel</dc:creator>
</item>

</channel>
</rss>