<?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/36211?offset=100</link>
	<atom:link href="https://bioinformaticsonline.com/related/36211?offset=100" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/34552/edit-distance-application-in-bioinformatics</guid>
	<pubDate>Thu, 07 Dec 2017 08:46:51 -0600</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/34552/edit-distance-application-in-bioinformatics</link>
	<title><![CDATA[Edit distance application in bioinformatics !]]></title>
	<description><![CDATA[<p>There are other popular measures of&nbsp;<a href="https://en.wikipedia.org/wiki/Edit_distance" title="Edit distance">edit distance</a>, which are calculated using a different set of allowable edit operations. For instance,</p><ul>
<li>the&nbsp;<a href="https://en.wikipedia.org/wiki/Damerau%E2%80%93Levenshtein_distance" title="Damerau&ndash;Levenshtein distance">Damerau&ndash;Levenshtein distance</a>&nbsp;allows insertion, deletion, substitution, and the&nbsp;<a href="https://en.wikipedia.org/wiki/Transposition_(mathematics)" title="Transposition (mathematics)">transposition</a>&nbsp;of two adjacent characters;</li>
<li>the&nbsp;<a href="https://en.wikipedia.org/wiki/Longest_common_subsequence_problem" title="Longest common subsequence problem">longest common subsequence</a>&nbsp;(LCS) distance allows only insertion and deletion, not substitution;</li>
<li>the&nbsp;<a href="https://en.wikipedia.org/wiki/Hamming_distance" title="Hamming distance">Hamming distance</a>&nbsp;allows only substitution, hence, it only applies to strings of the same length.</li>
<li>the&nbsp;<a href="https://en.wikipedia.org/wiki/Jaro_distance" title="Jaro distance">Jaro distance</a>&nbsp;allows only&nbsp;<a href="https://en.wikipedia.org/wiki/Transposition_(mathematics)" title="Transposition (mathematics)">transposition</a>.</li>
</ul><p>&nbsp;</p><pre><span>use</span> Text<span>::</span>Levenshtein <span>qw</span><span>(</span>distance<span>);</span>

 <span>print</span> <span>distance</span><span>(</span><span>"foo"</span><span>,</span><span>"four"</span><span>);</span>
 <span># prints "2"</span>

 <span>my</span> <span>@words</span>     <span>=</span> <span>qw</span><span>/ four foo bar /</span><span>;</span>
 <span>my</span> <span>@distances</span> <span>=</span> <span>distance</span><span>(</span><span>"foo"</span><span>,</span><span>@words</span><span>);</span>

 <span>print</span> <span>"@distances"</span><span>;</span>
 <span># prints "2 0 3"</span><br /><br /><br /></pre><pre><span>use</span> Algorithm<span>::</span>LCSS <span>qw</span><span>(</span> LCSS CSS CSS_Sorted <span>);</span>
    <span>my</span> <span>$lcss_ary_ref</span> <span>=</span> <span>LCSS</span><span>(</span> <span>\</span><span>@SEQ1</span><span>,</span> <span>\</span><span>@SEQ2</span> <span>);</span>  <span># ref to array</span>
    <span>my</span> <span>$lcss_string</span>  <span>=</span> <span>LCSS</span><span>(</span> <span>$STR1</span><span>,</span> <span>$STR2</span> <span>);</span>    <span># string</span>
    <span>my</span> <span>$css_ary_ref</span> <span>=</span> <span>CSS</span><span>(</span> <span>\</span><span>@SEQ1</span><span>,</span> <span>\</span><span>@SEQ2</span> <span>);</span>    <span># ref to array of arrays</span>
    <span>my</span> <span>$css_str_ref</span> <span>=</span> <span>CSS</span><span>(</span> <span>$STR1</span><span>,</span> <span>$STR2</span> <span>);</span>      <span># ref to array of strings</span>
    <span>my</span> <span>$css_ary_ref</span> <span>=</span> <span>CSS_Sorted</span><span>(</span> <span>\</span><span>@SEQ1</span><span>,</span> <span>\</span><span>@SEQ2</span> <span>);</span>  <span># ref to array of arrays</span>
    <span>my</span> <span>$css_str_ref</span> <span>=</span> <span>CSS_Sorted</span><span>(</span> <span>$STR1</span><span>,</span> <span>$STR2</span> <span>);</span>    <span># ref to array of strings<br /><br /><br /><br /></span></pre><p>There are many different modules on CPAN for calculating the edit distance between two strings. Here's just a selection.</p><p><a href="http://search.cpan.org/perldoc?Text%3A%3ALevenshteinXS">Text::LevenshteinXS</a>&nbsp;and&nbsp;<a href="http://search.cpan.org/perldoc?Text%3A%3ALevenshtein%3A%3AXS">Text::Levenshtein::XS</a>&nbsp;are both versions of the Levenshtein algorithm that require a C compiler, but will be a lot faster than this module.</p><p>The Damerau-Levenshtein edit distance is like the Levenshtein distance, but in addition to insertion, deletion and substitution, it also considers the transposition of two adjacent characters to be a single edit. The module&nbsp;<a href="http://search.cpan.org/perldoc?Text%3A%3ALevenshtein%3A%3ADamerau">Text::Levenshtein::Damerau</a>&nbsp;defaults to using a pure perl implementation, but if you've installed&nbsp;<a href="http://search.cpan.org/perldoc?Text%3A%3ALevenshtein%3A%3ADamerau%3A%3AXS">Text::Levenshtein::Damerau::XS</a>&nbsp;then it will be a lot quicker.</p><p><a href="http://search.cpan.org/perldoc?Text%3A%3AWagnerFischer">Text::WagnerFischer</a>&nbsp;is an implementation of the Wagner-Fischer edit distance, which is similar to the Levenshtein, but applies different weights to each edit type.</p><p><a href="http://search.cpan.org/perldoc?Text%3A%3ABrew">Text::Brew</a>&nbsp;is an implementation of the Brew edit distance, which is another algorithm based on edit weights.</p><p><a href="http://search.cpan.org/perldoc?Text%3A%3AFuzzy">Text::Fuzzy</a>&nbsp;provides a number of operations for partial or fuzzy matching of text based on edit distance.&nbsp;<a href="http://search.cpan.org/perldoc?Text%3A%3AFuzzy%3A%3APP">Text::Fuzzy::PP</a>&nbsp;is a pure perl implementation of the same interface.</p><p><a href="http://search.cpan.org/perldoc?String%3A%3ASimilarity">String::Similarity</a>&nbsp;takes two strings and returns a value between 0 (meaning entirely different) and 1 (meaning identical). Apparently based on edit distance.</p><p><a href="http://search.cpan.org/perldoc?Text%3A%3ADice">Text::Dice</a>&nbsp;calculates&nbsp;<a href="https://en.wikipedia.org/wiki/S%C3%B8rensen%E2%80%93Dice_coefficient">Dice's coefficient</a>&nbsp;for two strings. This formula was originally developed to measure the similarity of two different populations in ecological research.</p><pre><span>&nbsp;</span></pre>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/fun/view/8509/the-best-bioinformatics-computational-biology-quotes</guid>
	<pubDate>Wed, 26 Feb 2014 17:50:59 -0600</pubDate>
	<link>https://bioinformaticsonline.com/fun/view/8509/the-best-bioinformatics-computational-biology-quotes</link>
	<title><![CDATA[The Best Bioinformatics / Computational Biology Quotes]]></title>
	<description><![CDATA[<p><img src="http://bioinformaticsonline.com/mod//photo/hahaha.png" style="border: 0; border: 0px;" alt="image"></p><p>Bioinformatician are not anti-social; We are just genome friendly.</p><p>Bioinformatician would love to change the biological world, but they won't give us the genetic code :P</p><p>If at first you don't succeed; call it version 1.0</p><p>The glass is neither half-full nor half-empty: it's actually have several genomes.</p><p>I'm BioGeek.</p><p>Fedup with LIPS, try God script.</p><p>Idiot, Go ahead, make my data!</p><p>Thank god, my genome just compiled.</p><p>Error message: "Out of space on genome drive:"</p><p>Shut up mobile elements, or i'll flush you out.</p><p>Never underestimate the internet bandwidth, u gotta incomplete.</p><p>Applied fuzzy logic to understand God's logic?</p><p>Warning! Overflow, delete chromosome !</p><p>Be nice to the BioGeek, for all you know they might be the next curator!</p><p>Beware of computational biologist they screw genes and protein.</p><p>Warning! Your genome is full of garbage, delete it !</p><p>Bad or missing mouse genome. Spank the cat? (Y/N)</p><p>Genome make very fast, very accurate mistakes.</p><p>Let's BLAST it.</p><p>Some genome never has transposons. It just develops random features.</p><p>Go watch CINEMA and have BLAST.</p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/35534/awk-for-bioinformatician-and-computational-biologist</guid>
	<pubDate>Tue, 06 Feb 2018 14:54:35 -0600</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/35534/awk-for-bioinformatician-and-computational-biologist</link>
	<title><![CDATA[Awk for Bioinformatician and computational biologist]]></title>
	<description><![CDATA[<p>Awk is a programming language which allows easy manipulation of structured data and is mostly used for pattern scanning and processing. It searches one or more files to see if they contain lines that match with the specified patterns and then perform associated actions. The basic syntax is:</p><blockquote><p><br />awk '/pattern1/ {Actions}<br /> /pattern2/ {Actions}' file</p></blockquote><p><br />The working of Awk is as follows<br />Awk reads the input files one line at a time.<br />For each line, it matches with given pattern in the given order, if matches performs the corresponding action.<br />If no pattern matches, no action will be performed.<br />In the above syntax, either search pattern or action are optional, But not both.<br />If the search pattern is not given, then Awk performs the given actions for each line of the input.<br />If the action is not given, print all that lines that matches with the given patterns which is the default action.<br />Empty braces with out any action does nothing. It wont perform default printing operation.<br />Each statement in Actions should be delimited by semicolon.<br />Say you have data.tsv with the following contents:</p><p><br />$ cat data/test.tsv<br />contig1 ACTGTCTGTCACTGTGTTGTGATGTTGTGTGTG<br />contig2 ACTTTATATATT<br />contig3 ACTTATATATATATA<br />contig4 ACTTATATATATATA<br />contig5 ACTTTATATATT <br />By default Awk prints every line from the file.</p><p><br />$ awk '{print;}' data/test.tsv<br />contig1 ACTGTCTGTCACTGTGTTGTGATGTTGTGTGTG<br />contig2 ACTTTATATATT<br />contig3 ACTTATATATATATA<br />contig4 ACTTATATATATATA<br />contig5 ACTTTATATATT <br />We print the line which matches the pattern contig3</p><p><br />$ awk '/contig3/' data/test.tsv<br />contig3 ACTTATATATATATA<br />Awk has number of builtin variables. For each record i.e line, it splits the record delimited by whitespace character by default and stores it in the $n variables. If the line has 5 words, it will be stored in $1, $2, $3, $4 and $5. $0 represents the whole line. NF is a builtin variable which represents the total number of fields in a record.</p><p><br />$ awk '{print $1","$2;}' data/test.tsv<br />contig1,ACTGTCTGTCACTGTGTTGTGATGTTGTGTGTG<br />contig2,ACTTTATATATT<br />contig3,ACTTATATATATATA<br />contig4,ACTTATATATATATA<br />contig5,ACTTTATATATT</p><p>$ awk '{print $1","$NF;}' data/test.tsv<br />contig1,ACTGTCTGTCACTGTGTTGTGATGTTGTGTGTG<br />contig2,ACTTTATATATT<br />contig3,ACTTATATATATATA<br />contig4,ACTTATATATATATA<br />contig5,ACTTTATATATT</p><p><br />Awk has two important patterns which are specified by the keyword called BEGIN and END. The syntax is as follows:</p><blockquote><p>BEGIN { Actions before reading the file}<br />{Actions for everyline in the file} <br />END { Actions after reading the file }</p></blockquote><p><br />For example,<br />$ awk 'BEGIN{print "Header,Sequence"}{print $1","$2;}END{print "-------"}' data/test.tsv<br />Header,Sequence<br />contig1,ACTGTCTGTCACTGTGTTGTGATGTTGTGTGTG<br />contig2,ACTTTATATATT<br />contig3,ACTTATATATATATA<br />contig4,ACTTATATATATATA<br />contig5,ACTTTATATATT<br />------- <br />We can also use the concept of a conditional operator in print statement of the form print CONDITION ? PRINT_IF_TRUE_TEXT : PRINT_IF_FALSE_TEXT. For example, in the code below, we identify sequences with lengths &gt; 14:</p><p>$ awk '{print (length($2)&gt;14) ? $0"&gt;14" : $0"&lt;=14";}' data/test.tsv<br />contig1 ACTGTCTGTCACTGTGTTGTGATGTTGTGTGTG&gt;14<br />contig2 ACTTTATATATT&lt;=14<br />contig3 ACTTATATATATATA&gt;14<br />contig4 ACTTATATATATATA&gt;14<br />contig5 ACTTTATATATT&lt;=14<br />We can also use 1 after the last block {} to print everything (1 is a shorthand notation for {print $0} which becomes {print} as without any argument print will print $0 by default), and within this block, we can change $0, for example to assign the first field to $0 for third line (NR==3), we can use:</p><p>$ awk 'NR==3{$0=$1}1' data/test.tsv<br />contig1 ACTGTCTGTCACTGTGTTGTGATGTTGTGTGTG<br />contig2 ACTTTATATATT<br />contig3<br />contig4 ACTTATATATATATA<br />contig5 ACTTTATATATT<br />You can have as many blocks as you want and they will be executed on each line in the order they appear, for example, if we want to print $1 three times (here we are using printf instead of print as the former doesn't put end-of-line character),</p><p>$ awk '{printf $1"\t"}{printf $1"\t"}{print $1}' data/test.tsv<br />contig1 contig1 contig1<br />contig2 contig2 contig2<br />contig3 contig3 contig3<br />contig4 contig4 contig4<br />contig5 contig5 contig5 <br />Although, we can also skip executing later blocks for a given line by using next keyword:</p><p>$ awk '{printf $1"\t"}NR==3{print "";next}{print $1}' data/test.tsv<br />contig1 contig1<br />contig2 contig2<br />contig3 <br />contig4 contig4<br />contig5 contig5</p><p>$ awk 'NR==3{print "";next}{printf $1"\t"}{print $1}' data/test.tsv<br />contig1 contig1<br />contig2 contig2</p><p>contig4 contig4<br />contig5 contig5<br />You can also use getline to load the contents of another file in addition to the one you are reading, for example, in the statement given below, the while loop will load each line from test.tsv into k until no more lines are to be read:</p><p>$ awk 'BEGIN{while((getline k &lt;"data/test.tsv")&gt;0) print "BEGIN:"k}{print}' data/test.tsv<br />BEGIN:contig1 ACTGTCTGTCACTGTGTTGTGATGTTGTGTGTG<br />BEGIN:contig2 ACTTTATATATT<br />BEGIN:contig3 ACTTATATATATATA<br />BEGIN:contig4 ACTTATATATATATA<br />BEGIN:contig5 ACTTTATATATT<br />contig1 ACTGTCTGTCACTGTGTTGTGATGTTGTGTGTG<br />contig2 ACTTTATATATT<br />contig3 ACTTATATATATATA<br />contig4 ACTTATATATATATA<br />contig5 ACTTTATATATT <br />You can also store data in the memory with the syntax VARIABLE_NAME[KEY]=VALUE which you can later use through for (INDEX in VARIABLE_NAME) command:</p><p>$ awk '{i[$1]=1}END{for (j in i) print j"&lt;="i[j]}' data/test.tsv<br />contig1&lt;=1<br />contig2&lt;=1<br />contig3&lt;=1<br />contig4&lt;=1<br />contig5&lt;=1</p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/8987/the-dna-of-a-successful-bioinformatician-decoded</guid>
	<pubDate>Wed, 12 Mar 2014 13:41:26 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/8987/the-dna-of-a-successful-bioinformatician-decoded</link>
	<title><![CDATA[The DNA of a Successful Bioinformatician decoded !!!]]></title>
	<description><![CDATA[<p>Many blogs exist about successful bioinformatician, but this blog so far now is my personal view on characteristics of successful bioinformatician or computational biologist. &nbsp;Hmm &hellip; of course these views are subjective to my own personal experiences and therefore I don't claim that the view listed here is complete. As a human, I don&rsquo;t take them too serious. The success must not be the only target of your work. The target is to work on your own virtues; some of those virtues are the topic of this blog.</p><p><img src="http://bioinformaticsonline.com/mod/photo/genome_decode.png" alt="image" width="509" height="458" style="border: 0px; border: 0px;"><br /> <br /> <strong>1. Update new things continuously<br /></strong>As per my personal experience, it&rsquo;s not always easy to work as a bioinformatician! &nbsp;There are couple of reasons to say that; First computational part of biology make our life&rsquo;s a little harder compared to other professional categories. The fact - for instance - that the technology cycle in the bioinformatics world is very short, the actual knowledge becomes outdated in a few months or years. Therefore, we need to learn continuously - new things get important. Second, to stay on top of things we really need the strong will to be good at our job. That's probably the most important characteristic to bioinformatician. They are usually an excellent knowledge worker with great technical abilities, and have the will to be that over decades!<br /> <br /> <strong>2. Avoid the sentence </strong><strong>"I did not know what to do!"</strong><br /> In our computational biology lab, we generally face lots of technical problems. But as you know, it's impossible to know everything to do the computational biology jobs ( Yup.. because you need diverse and multidisciplinary knowledge to understand biological problems and resolve their respective solutions), therefore it's absolutely necessary that a bioinformatician finds its way through a new topic. How I typically do that is I use google and I talk to other experts in our laboratory or online biostar community to find out what they think. "I did not know what to do!" should not be an argument for us.<strong><br /><br /> <strong>3. To make oneself useful</strong></strong><br /> Several time it does happen, you finished our task earlier than expected; in such cases if you have some time left then: Take a coffee and play chess; reversi, etc. In my case I take a rest. Afterwards I think about what I could do that helps the team to achieve its targets, 'cause some of my team mates probably didn't finish! (at least if I didn't met them at coffee bar !!)</p><p><strong>4. Care for all</strong><br /> During my rigorous research duration; I attended several workshop organized by my University departments. I had a discussion with other research fellow, professors; I generally ask &hellip; what it really takes to make a team successful or to be a successful research leader. They always said: "Well, you need some caring people!" I think there is a lot truth in that statement. If we do not care about quality, timelines, good team culture, respectful communication (!!), clean code, if all this doesn&rsquo;t matter to us, then I believe the probability is higher that we fail in research and analysis. <br /> <br /> <strong>5. Be good with people</strong><br /> Because bioinformatician and computational biologist jobs typically involves to work in a (most wanted J cross-departmental!) team, therefore it's important that we're (more or less) good in dealing with other individuals. Everyone have their own strengths and weaknesses, just like us. It's important to treat all the research team mates with respect, regardless of their technical competence or contributions. Of course, sometimes people deserve a clear statement (!!!), but try to do these things one-on-one. Make sure nobody loses his face. Attend the meetings at the coffee bar; be good at table top soccer and go out once in a while to have a beer with your team. You know what I'm talking about.</p><p>At the end of a week I look back and I ask myself what I have produced. This could be paperwork, community days or (best!!) programming code. Always remember there is always a solution to a problem. Most of the times there are at least three solutions. So, don&rsquo;t just blame, suggest a solution.<br /> <br /> That's it. I am looking forward to your thoughts and comments!</p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/36483/popular-bioinformatics-educational-resources</guid>
	<pubDate>Fri, 04 May 2018 19:43:21 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/36483/popular-bioinformatics-educational-resources</link>
	<title><![CDATA[Popular bioinformatics educational resources !]]></title>
	<description><![CDATA[<p>Followings are the list of popular bioinformatics educational resources</p><p><a href="http://Bii.a-star.edu.sg"><strong>Bii.a-star.edu.sg</strong></a></p><p>Bio research and development. Has course information and research information.</p><p><a href="http://Isb-sib.ch"><strong>Isb-sib.ch</strong></a></p><p>SIB operates the ExPASy proteomics server and the Swiss node of EMBnet. Teaching activities include a series of post-graduate courses given at the Universities of Geneva and Lausanne, as well as at the EPFL, and a Masters Degree in bioinformatics. Major research areas include the development of integrated databases and software resources in the field of proteomics.</p><p><a href="http://Bioinformatics.ca"><strong>Bioinformatics.ca</strong></a></p><p>Provides information about bioinformatics in Canada. Workshops, certification and resources.</p><p><a href="http://Chickscope.beckman.uiuc.edu"><strong>Chickscope.beckman.uiuc.edu</strong></a></p><p>Students raise chicken embryos in the classroom and obtain magnetic resonance images through the Internet.</p><p><a href="http://Bcb.iastate.edu"><strong>Bcb.iastate.edu</strong></a></p><p>Graduate program at Iowa State University offering Undergraduate Major (BCBio) and the PhD program (BCB).</p><p><a href="http://Bu.edu/bioinformatics/"><strong>Bu.edu/bioinformatics/</strong></a></p><p>Interdisciplinary PhD and Masters Programs that include an internship in the local industry companies. In conjunction with the NE masters program.</p><p><a href="http://Bioinformatics.ubc.ca"><strong>Bioinformatics.ubc.ca</strong></a></p><p>A computational biology research centre covering many areas of genomics, proteomics, computer science and statistics. Research, training, news and events, resources and support, director's message, faculty and personnel.</p><p><a href="http://Openhelix.com"><strong>Openhelix.com</strong></a></p><p>Provides onsite training on specific bioinformatics databases and tools. Also offers bioinformatic software testing and research consulting services.</p><p><a href="http://Igb.uci.edu"><strong>Igb.uci.edu</strong></a></p><p>Specializing in making publicly available software and database services for computational biology.</p><p><a href="http://Bioinformatics.pe.kr"><strong>Bioinformatics.pe.kr</strong></a></p><p>Maintained by Dr. Seyeon Weon, Korea providing information on courses, a database archive, software archive and online resources.</p><p><a href="http://Groups.yahoo.com/group/bimatics/"><strong>Groups.yahoo.com/group/bimatics/</strong></a></p><p>Bioinformatics group for students interested and/or working in the bioinformatics/computationalbiology fields. Offers opportunities to exchanging information and sharing ideas.</p><p><a href="http://Ncbi.nlm.nih.gov/books/NBK22183/"><strong>Ncbi.nlm.nih.gov/books/NBK22183/</strong></a></p><p>Information about several medically important genes and related diseases. Illustrates the use of bioinformatics in their study.</p><p><a href="http://Bioinfo.mbb.yale.edu/mbb452a/2003/"><strong>Bioinfo.mbb.yale.edu/mbb452a/2003/</strong></a></p><p>Bioinformatics course at Yale University. All course slides are available online.</p><p><a href="http://Cs.iastate.edu/~honavar/comp-bio-courses.html"><strong>Cs.iastate.edu/~honavar/comp-bio-courses.html</strong></a></p><p>Listing of computational molecular biology course pages that have extensive online course materials.</p><p><a href="http://Bioinf.manchester.ac.uk/dbbrowser/bioactivity/prefacefrm.html"><strong>Bioinf.manchester.ac.uk/dbbrowser/bioactivity/prefacefrm.html</strong></a></p><p>A web-based tutorial associated with "Introduction to bioinformatics" published by Addison Wesley Longman.</p><p><a href="http://Northeastern.edu/bioinformatics/"><strong>Northeastern.edu/bioinformatics/</strong></a></p><p>From the Biology department and in cooperation with Boston University. Emphasis on the ability to integrate knowledge from biological, computational, and mathematical disciplines.</p><p><a href="http://Biocomp.unibo.it/lsbioinfo/"><strong>Biocomp.unibo.it/lsbioinfo/</strong></a></p><p>A two year, international master's programme in bioinformatics at the Universita di Bologna, Italy.</p><p><a href="http://Cs.helsinki.fi/bioinformatiikka/mbi/programme.html"><strong>Cs.helsinki.fi/bioinformatiikka/mbi/programme.html</strong></a></p><p>A two year Masters Degree Programme in Bioinformatics (MBI) offered by the University of Helsinki and Helsinki University of Technology, Finland.</p><p><a href="http://Ornl.gov/sci/techresources/Human_Genome/education/education.shtml"><strong>Ornl.gov/sci/techresources/Human_Genome/education/education.shtml</strong></a></p><p>A resource for introductory information on the Human Genome Project.</p><p><a href="http://His.se/bioinformatics"><strong>His.se/bioinformatics</strong></a></p><p>A one-year, international master's programme in bioinformatics at the University of Skovde, Sweden.</p><p><a href="http://Members.tripod.com/C.elegans/"><strong>Members.tripod.com/C.elegans/</strong></a></p><p>Resources in biochemical, molecular, cellular, system, and organism biology, including over 25,000 indexed links, accumulated since 2000, from topic menus or from search interface.</p><p><a href="http://Bioinformatics.org/faq/#contents"><strong>Bioinformatics.org/faq/#contents</strong></a></p><p>Summary of basics of bioinformatics for the intelligent newcomer.</p><p><a href="http://Jiscmail.ac.uk/archives/bioinformatics.html"><strong>Jiscmail.ac.uk/archives/bioinformatics.html</strong></a></p><p>Forum featuring various aspects, events and developments in the bioinformatics field.</p><p><a href="http://Biinoida.blogspot.com"><strong>Biinoida.blogspot.com</strong></a></p><p>Blog focusing on bioinformatics, biotechnology, pharma regulatory affairs, IPR and clinical trials.</p><p><a href="http://Colorbasepair.com/bioinformatics_courses_tutorials.html"><strong>Colorbasepair.com/bioinformatics_courses_tutorials.html</strong></a></p><p>A list of on-line course materials and tutorials for bioinformatics and computational biology.</p><p><a href="http://Geospiza.com/education/"><strong>Geospiza.com/education/</strong></a></p><p>Instructional materials for teaching bioinformatics. These include animated tutorials on topicssuch as BLAST, finding mutations in a protein, and graphing with MS-Excel.</p><p><a href="http://Bioinformatics.fi"><strong>Bioinformatics.fi</strong></a></p><p>An international, two-year Master's programme jointly managed by the University of Tampere and the University of Turku, Finland.</p><p><a href="http://Perlsource.net"><strong>Perlsource.net</strong></a></p><p>Provides online courses in Perl programming for bioinformatic tools.</p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/9028/linux-for-bioinformatician</guid>
	<pubDate>Thu, 13 Mar 2014 16:59:26 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/9028/linux-for-bioinformatician</link>
	<title><![CDATA[Linux for bioinformatician !!!]]></title>
	<description><![CDATA[<p>Linux, free operating system for computers, provides several powerful admin tools and utilities which will help you to manage your systems effectively and handle huge amount of genomic/biological data with an ease. The field of bioinformatics relies heavily on Linux-based computers and software. Although most bioinformatics programs can be compiled to run. If you don&rsquo;t know what these no so user-friendly tools are and how to use them, you could be spending lot of time trying to perform even the basic admin tasks. The focus of this linux series is to help you understand system admin as well as basic tools, which will help you to become an effective bioinformatician and computational biologist.<br /><br /></p><p>For knowledge about Linux and their importance amongst bioinformatician plesae read this article "<a href="http://www.ualberta.ca/~stothard/downloads/linux_for_bioinformatics.pdf">An introduction to Linux for bioinformatics</a>" by Paul Stothard.</p><p>Linux cheat sheet at http://bioinformaticsonline.com/file/view/87/linux-cheat-sheet</p><p>Please browse for futher useful linux pages on right hand side ...</p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38472/gpsrdocker-docker-based-container-that-contain-all-softwareweb-servers-developed-in-the-field-of-bioinformatics</guid>
	<pubDate>Sun, 16 Dec 2018 13:04:46 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38472/gpsrdocker-docker-based-container-that-contain-all-softwareweb-servers-developed-in-the-field-of-bioinformatics</link>
	<title><![CDATA[gpsrdocker: docker-based container that contain all software/web servers developed in the field of bioinformatics.]]></title>
	<description><![CDATA[<p><span>GPSRdocker (</span><a href="http://webs.iiitd.edu.in/gpsrdocker/">http://webs.iiitd.edu.in/gpsrdocker/</a><span>) is&nbsp; Presently it contain software developed at G. P. S. Raghava's group (</span><a href="http://webs.iiitd.edu.in/raghava/">http://webs.iiitd.edu.in/raghava/</a><span>&nbsp;). </span></p>
<p><span>The programs and the package are free software for academic users. Permission to use, copy, and modify any part of this software for educational, research and non-profit purposes is hereby granted. In this package or Docker image, number of other supported software has been integrated which may be under other licenses, along with any direct or indirect dependencies of the primary software being contained. As for any pre-built image usage, it is the image user's responsibility to ensure that any use of this image complies with any relevant licenses for all software contained within. </span></p>
<p><span>All software packages are distributed in the hope that they will be useful but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. If you have any query, please contact at raghava@iiitd.ac.in.</span></p><p>Address of the bookmark: <a href="https://hub.docker.com/r/raghavagps/gpsrdocker/" rel="nofollow">https://hub.docker.com/r/raghavagps/gpsrdocker/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/9204/keep-your-important-ssh-session-running-when-you-disconnect-from-server</guid>
	<pubDate>Sat, 15 Mar 2014 21:39:17 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/9204/keep-your-important-ssh-session-running-when-you-disconnect-from-server</link>
	<title><![CDATA[Keep Your Important SSH Session Running when You Disconnect from Server !!!]]></title>
	<description><![CDATA[<p>As a Bioinformatician/ Computational biologist we swim in the ocean of genomic/proteomics data, and play with them with an ease. In our day to day simulation, analysis, comparative study we do need to run exhaustive programs, which might take more than a week. In such cases we do need to disconnect from sever in a way that our program/session should not get terminated. To do so there are lots of software, tools such as tmux ( <a href="http://tmux.sourceforge.net/">http://tmux.sourceforge.net/</a>, nohup (<a href="http://ss64.com/bash/nohup.html">http://ss64.com/bash/nohup.html</a>) , byobu (<a href="https://help.ubuntu.com/10.04/serverguide/byobu.html">https://help.ubuntu.com/10.04/serverguide/byobu.html</a>) and other commands (disown -a &amp;&amp; exit), but following are the ones I use the most.</p><p>Screen is like a window manager for your console. It will allow you to keep multiple terminal sessions running and easily switch between them. It also protects you from disconnection, because the screen session doesn&rsquo;t end when you get disconnected.<br /><br />You&rsquo;ll need to make sure that screen is installed on the server you are connecting to. If that server is Ubuntu or Debian, just use this command:<br /><br />sudo apt-get install screen<br /><br />Now you can start a new screen session by just typing screen at the command line. You&rsquo;ll be shown some information about screen. Hit enter, and you&rsquo;ll be at a normal prompt.<br /><br /><strong>To disconnect (but leave the session running)</strong><br /><br />Hit Ctrl + A and then Ctrl + D in immediate succession. You will see the message [detached]<br /><br /><strong>To reconnect to an already running session</strong><br /><br />screen -r<br /><br /><strong>To reconnect to an existing session, or create a new one if none exists</strong><br /><br />screen -D -r<br /><br /><strong>To create a new window inside of a running screen session</strong><br /><br />Hit Ctrl + A and then C in immediate succession. You will see a new prompt.<br /><br /><strong>To switch from one screen window to another</strong><br /><br />Hit Ctrl + A and then Ctrl + A in immediate succession.<br /><br /><strong>To list open screen windows</strong><br /><br />Hit Ctrl + A and then W in immediate succession</p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/39472/louisiana-biomedical-research-network-summer-bioinformatics-training-program</guid>
	<pubDate>Wed, 05 Jun 2019 15:30:01 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/39472/louisiana-biomedical-research-network-summer-bioinformatics-training-program</link>
	<title><![CDATA[Louisiana Biomedical Research Network: Summer Bioinformatics Training Program]]></title>
	<description><![CDATA[<p><img src="https://edu.t-bio.info/wp-content/uploads/2019/06/LBRN-Summer-Program1-CCT.jpg" alt="2019 summer bioinformatics training program" width="600" height="337.5" style="border: 0px;"></p><p>Louisiana Biomedical Research Network (LBRN) announces registration for it's Summer 2019 Bioinformatics Training Program. The program will be focused on processing, analysis and interpretation of next generation sequecning data for biologists. Learn more:</p><p>https://edu.t-bio.info/louisiana-biomedical-research-network-summer-2019-lbrn-bioinformatics-training-program/</p>]]></description>
	<dc:creator>eliabrodsky</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/9242/check-the-size-of-a-directory-free-disk-space</guid>
	<pubDate>Mon, 17 Mar 2014 02:35:32 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/9242/check-the-size-of-a-directory-free-disk-space</link>
	<title><![CDATA[Check the Size of a directory &amp; Free disk space.]]></title>
	<description><![CDATA[<p>The amount of databases we bioinformatician deal are just HUGE &hellip; In such cases, we always need to check our server for free spaces etc. I planned this article to explains 2 simple commands that most bioinformatician want to know when they start using Linux / BioLinux. First: Size of a directory (du) and and second: free disk space that exists on your machine (df).</p><p><br /><strong>'du' &ndash; Check the size of a directory</strong></p><p><br />$ du<br />This command ( du) gives you a list of directories that exist in the current working directory along with their sizes in kilobytes (default). The last line of the output gives you the total size of the current directory including its subdirectories. <br /><br />$ du /home/jin1<br />The above command would give you the directory size of the directory /home/david<br /><br />$ du -h<br />The same &ldquo;du&rdquo;command with some flag gives you a better output than the default one. The option '-h' stands for human readable format. Therefore, in order to print the sizes of the files / directories in your desire notation use this time suffixed with a 'k' if its kilobytes and 'M' if its Megabytes and 'G' if its Gigabytes.<br /><br />$ du -ah<br />If you are interested in checking everything present in a folder use above mentioned command. It gives us not only the directories but also all the files that are present in the current directory. The &ldquo;-a&rdquo; flag displays the filenames along with the directory names in the output. <br /><br />$ du -c<br />This gives you a grand total as the last line of the output. So if your directory occupies 30MB the last 2 lines of the output would be 30M.<br /><br />$ du -s<br />Use this command to displays a summary of the directory size. It is the simplest way to know the total size of the current directory.<br /><br />$ du -S<br />This would display the size of the current directory excluding the size of the subdirectories that exist within that directory. So it basically shows you the total size of all the files that exist in the current directory.<br /><br />$ du --exculde=mp3<br />Several times it required to exclude some directory in our size calculation. In such cases the above command would display the size of the current directory along with all its subdirectories, but it would exclude all the files having the given pattern present in their filenames.</p><p><br /><strong>'df' - finding the disk free space / disk usage</strong><br /><br />$ df<br />Hmmm &hellip; now &ldquo;df&rdquo; command is really useful, and I guess you are going to use it over time. Typing the above command, outputs a table consisting of 6 columns. All the columns are very easy to understand. Remember that the 'Size', 'Used' and 'Avail' columns use kilobytes as the unit. The 'Use%' column shows the usage as a percentage which is also very useful.<br /><br />$ df -h<br />Displays the same output as the previous command but the '-h' indicates human readable format. Hence instead of kilobytes as the unit the output would have 'M' for Megabytes and 'G' for Gigabytes.<br /><br />Example: Linux installed on /dev/hda1<br />$ df -h | grep /dev/hda1</p><p><br />All right, this is not the only option to check the sizes and free spaces but there are a few more options that can be used with 'du' and 'df' . I will discuss it later.<br /><br /></p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>

</channel>
</rss>