<?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/43431?</link>
	<atom:link href="https://bioinformaticsonline.com/related/43431?" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/21703/coding-ground</guid>
	<pubDate>Tue, 17 Mar 2015 00:47:20 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/21703/coding-ground</link>
	<title><![CDATA[Coding Ground]]></title>
	<description><![CDATA[<p>Online coding group for most of the programming languages.</p>
<p>Code in almost all popular languages using Coding Ground.&nbsp;Edit, compile, execute and share your projects, 100% cloud.</p>
<p>http://www.tutorialspoint.com/codingground.htm</p><p>Address of the bookmark: <a href="http://www.tutorialspoint.com/codingground.htm" rel="nofollow">http://www.tutorialspoint.com/codingground.htm</a></p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/file/view/18653/genetic-code-amino-acid</guid>
	<pubDate>Sun, 26 Oct 2014 07:45:58 -0500</pubDate>
	<link>https://bioinformaticsonline.com/file/view/18653/genetic-code-amino-acid</link>
	<title><![CDATA[Genetic code - Amino Acid]]></title>
	<description><![CDATA[<p>The genetic code consists of 64 triplets of nucleotides. These triplets are called codons.With three exceptions, each codon encodes for one of the 20 amino acids used in the synthesis of proteins. That produces some redundancy in the code: most of the amino acids being encoded by more than one codon.</p><p>The image summarise all in one.</p><p>More at http://users.rcn.com/jkimball.ma.ultranet/BiologyPages/C/Codons.html</p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
	<enclosure url="https://bioinformaticsonline.com/file/download/18653" length="226605" type="image/jpeg" />
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/30654/source-code-and-pseudo-code</guid>
	<pubDate>Mon, 23 Jan 2017 10:17:35 -0600</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/30654/source-code-and-pseudo-code</link>
	<title><![CDATA[Source Code and Pseudo Code !!]]></title>
	<description><![CDATA[<p>An <span style="text-decoration: underline;">algorithm</span> is a procedure for solving a problem in terms of the actions to be executed and the order in which those actions are to be executed. An algorithm is merely the sequence of steps taken to solve a problem. The steps are normally "sequence," "selection, " "iteration," and a case-type statement.</p><p>In C, "sequence statements" are imperatives. The "selection" is the "if then else" statement, and the iteration is satisfied by a number of statements, such as the "while," " do," and the "for," while the case-type statement is satisfied by the "switch" statement.</p><hr><p><span style="text-decoration: underline;">Pseudocode</span> is an artificial and informal language that helps programmers develop algorithms. Pseudocode is a "text-based" detail (algorithmic) design tool.</p><p>The rules of Pseudocode are reasonably straightforward. All statements showing "dependency" are to be indented. These include while, do, for, if, switch. Examples below will illustrate this notion.</p><p><strong> GUIDE TO PSEUDOCODE LEVEL OF DETAIL: Given record/file descriptions, pseudocode should be created in sufficient detail so as to directly support the programming effort. It is the purpose of pseudocode to elaborate on the algorithmic detail and not just cite an abstraction. </strong></p><hr><p>Examples:</p><p>1.</p><pre>If student's grade is greater than or equal to 60
    Print "passed"
else
    Print "failed"  
endif
</pre><hr><p>2.</p><pre>  
Set total to zero
Set grade counter to one
While grade counter is less than or equal to ten
    Input the next grade
    Add the grade into the total
endwhile 
Set the class average to the total divided by ten
Print the class average.
</pre><hr><p>3.</p><pre>Initialize total to zero
Initialize counter to zero
Input the first grade
while the user has not as yet entered the sentinel
   add this grade into the running total 
   add one to the grade counter  
   input the next grade (possibly the sentinel)
endwhile

if the counter is not equal to zero
   set the average to the total divided by the counter
   print the average  
else
   print 'no grades were entered' 
endif 
</pre><hr><p>4.</p><pre>initialize passes to zero
initialize failures to zero
initialize student to one
while student counter is less than or equal to ten
    input the next exam result  
    if the student passed</pre><p>add one to passes else add one to failures add one to student counter endif endwhile print the number of passes print the number of failures if eight or more students passed print "raise tuition" endif</p><hr><h3><strong>5.</strong></h3><pre>Larger example:  

NOTE:  NEVER ANY DATA DECLARATIONS IN PSEUDOCODE

Print out appropriate heading and make it pretty
While not EOF do:
     Scan over blanks and white space until a char is found 
	(get first character on the line)
     set can't-be-ascending-flag to 0
     set consec cntr to 1
     set ascending cntr to 1
     putchar first char of string to screen
     set read character to hold character
     While next character read != blanks and white space
          putchar out on screen
          if new char = hold char + 1
               add 1 to consec cntr
               set hold char = new char
               continue
          endif
          if new char &gt;= hold char 
               if consec cntr &lt; 3 
                    set consec cntr to 1
               endif
               set hold char = new char
               continue
          endif
          if new char &lt; hold char
               if consec cntr &lt; 3
                    set consec cntr to 1
               endif
               set hold char = new char
               set can't be ascending flag to 1
               continue
           endif
     end while
     if consec cntr &gt;= 3 
          printf (Appropriate message 1 and skip a line)
          add 1 to consec total
     endif
     if  can't be ascending flag = 0
          printf (Appropriate message 2 and skip a line)
          add 1 to ascending total
     else
          printf (Sorry message and skip a line)
          add 1 to sorry total
     endif
end While
Print out totals:  Number of consecs, ascendings, and sorries.
Stop
</pre><p>Some Keywords That Should be Used And Additional Points</p><p>For looping and selection, The keywords that are to be used include Do While...EndDo; Do Until...Enddo; While .... Endwhile is acceptable. Also, Loop .... endloop is also VERY good and is language independent. Case...EndCase; If...Endif; Call ... with (parameters); Call; Return ....; Return; When;</p><p>Always use scope terminators for loops and iteration.</p><p>As verbs, use the words Generate, Compute, Process, etc. Words such as set, reset, increment, compute, calculate, add, sum, multiply, ... print, display, input, output, edit, test , etc. with careful indentation tend to foster desirable pseudocode. Also, using words such as Set and Initialize, when assigning values to variables is also desirable.</p><p>More on Formatting and Conventions in Pseudocoding</p><ul>
<li>INDENTATION in pseudocode should be identical to its implementation in a programming language. Try to indent at least four spaces.</li>
<li>As noted above, the pseudocode entries are to be cryptic, AND SHOULD NOT BE PROSE. NO SENTENCES.</li>
<li>No flower boxes (discussed ahead) in your pseudocode.</li>
<li>Do not include data declarations in your pseudocode.</li>
<li>But do cite variables that are initialized as part of their declarations. E.g. "initialize count to zero" is a good entry.<hr>Function Calls, Function Documentation, and Pseudocode</li>
<li>Calls to Functions should appear as:
<ul>     </ul>
</li>
<li>Returns in functions should appear as:
<ul> </ul>
</li>
<li>Function headers should appear as:
<ul>     </ul>
</li>
<li>Note that in C, arguments and parameters such as "fieldn" could be written: "pointer to fieldn ...."</li>
<li>Functions called with addresses should be written as:
<ul>         </ul>
</li>
<li>Function headers containing pointers should be indicated as:
<ul>        </ul>
</li>
<li>Returns in functions where a pointer is returned:
<ul>   </ul>
</li>
<li>It would not hurt the appearance of your pseudocode to draw a line or make your function header line "bold" in your pseudocode. Try to set off your functions.</li>
<li>Try to use scope terminators in your pseudocode and source code too. It really hels the readability of the text.<hr>Source Code</li>
<li>EVERY function should have a flowerbox PRECEDING IT. This flower box is to include the functions name, the main purpose of the function, parameters it is expecting (number and type), and the type of the data it returns. All of these listed items are to be on separate lines with spaces in between each explanatory item.</li>
<li>FORMAT of flowerbox should be
<p>&nbsp;</p>
<pre>	 ********************************************************
	 Function:   ( cryptic text describing single function
		     ....... (indented like this) 	
		     .......
	 Calls:      Start listing functions "this" function calls
		     Show these functions:  one per line, indented

	 Called by:  List of functions that calls "this" function
		     Show these functions:  one per line, indented.

	 Input Parameters:  list, if appropriate; else None
	 
	 Returns:    List, if appropriate.
	 ****************************************************************
</pre>
</li>
<li>INDENTATION is critically important in Source Code. Follow standard examples given in class. If in doubt, ASK. Always indent statements within IFs, FOR loops, WILLE loops, SWITCH statements, etc. a consistent number of spaces, such as four. Alternatively, use the tab key. One or two spaces is insufficient.</li>
<li>Use scope terminators at the end of if statements, for statements, while statements, and at the end of functions. It will make your program much more readable.
<p><strong> SPELLING ERRORS ARE NOT ACCEPTABLE </strong></p>
</li>
</ul>]]></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/32076/ngs-teaching-material</guid>
	<pubDate>Wed, 05 Apr 2017 04:29:06 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32076/ngs-teaching-material</link>
	<title><![CDATA[NGS teaching material]]></title>
	<description><![CDATA[<p><span>High throughput sequencing (HTS) technologies are being applied to a wide range of important topics in biology. However, the analyses of non-model organisms, for which little previous sequence information is available, pose specific problems. This course addresses the specific strengths and weaknesses of alternative HTS technologies, the computational resources needed for HTS, and how to analyze non-model species using HTS. The course consists of a practical training module, HTS bioinformatics training, and lecturing/seminars of HTS approaches specifically targeting non-model organisms.</span></p><p>Address of the bookmark: <a href="http://marinetics.org/teaching/hts/Assembly.html" rel="nofollow">http://marinetics.org/teaching/hts/Assembly.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/36605/hello-python-world</guid>
	<pubDate>Mon, 14 May 2018 16:41:01 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/36605/hello-python-world</link>
	<title><![CDATA[Hello Python World !]]></title>
	<description><![CDATA[<p>As I mentioned earlier, I will keep on posting one Python script per day to introduce you to Python programming. Whether you are an experienced programmer or not, this tutorial is intended for everyone who wishes to learn the Python programming language.</p><p>Python is a very simple language, and has a very straightforward syntax. The simplest directive in Python is the "print" directive - it simply prints out a line (and also includes a newline).</p><p>Create a file Hello.py</p><blockquote><p>print("Hello, Python World !.")</p></blockquote><p>Run</p><p>python3 Hello.py</p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/42811/bioinformatics-in-africa-part-4-morocco</guid>
	<pubDate>Sat, 06 Feb 2021 13:31:24 -0600</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/42811/bioinformatics-in-africa-part-4-morocco</link>
	<title><![CDATA[Bioinformatics in Africa: Part 4 - Morocco]]></title>
	<description><![CDATA[<p>Bioinformatics, in the UFR in Artificial Intelligence and Bioinformatics, deals with the management, the analysis, the modelling and the visualization of biological databases. Since the size of the databases is often exponential, the traditional algorithms are not very effective when seeking for a good computational solution.</p><p>To take care of this issue, many ways are opened to the researchers&nbsp;to&nbsp;improve&nbsp;the&nbsp;quality&nbsp;of&nbsp;the&nbsp;algorithms:</p><p>1. Usage of new information processing methods like artificial neuronal networks, genetic algorithms,&nbsp;etc. 2. Usage&nbsp;of&nbsp;Data&nbsp;mining&nbsp;&nbsp;to&nbsp;explore&nbsp;biochemical&nbsp;databases,<br />3. Usage of Machine learning on the biological examples to solve, for example, the problem of classification&nbsp;in&nbsp;Bioinformatics.</p><p>UFR&nbsp;offers&nbsp;in&nbsp;addition&nbsp;a&nbsp;doctoral&nbsp;training&nbsp;in&nbsp;Computer&nbsp;Science&nbsp;and&nbsp;Bioinformatics.</p><p>Doctoral&nbsp;module&nbsp;which&nbsp;includes:&nbsp;a&nbsp;Dipl&ocirc;me&nbsp;des&nbsp;Etudes&nbsp;Sup&eacute;rieures&nbsp;Approfondies&nbsp;(DESA)&nbsp; of&nbsp;two&nbsp;years;&nbsp;and&nbsp;a&nbsp;doctorate&nbsp;studies&nbsp;program&nbsp;with&nbsp;a&nbsp;national&nbsp;Ph.D.&nbsp;certification. Three&nbsp;specializations&nbsp;constitute&nbsp;the&nbsp;teaching&nbsp;trunk&nbsp;of&nbsp;the&nbsp;ENSAT:&nbsp;Computer&nbsp;engineering,&nbsp;Telecom&nbsp; engineering,&nbsp;and&nbsp;electronic&nbsp;systems&nbsp;engineering.</p><p>Research&nbsp;Interest&nbsp;and&nbsp;Activities:</p><p>The&nbsp;following&nbsp;are&nbsp;the&nbsp;present&nbsp;areas&nbsp;of&nbsp;research&nbsp;interest:</p><p>1. Machine&nbsp;Learning&nbsp;and&nbsp;Profile&nbsp;Gene&nbsp;Expression&nbsp;of&nbsp;Cancer<br />2. Predicting&nbsp;Protein&nbsp;structure <br />3. Hidden&nbsp;Markov&nbsp;Models&nbsp;(HMMs)&nbsp;and&nbsp;multiple&nbsp;alignments <br />4. Transformational&nbsp;Grammar&nbsp;for&nbsp;sequence&nbsp;modelling <br />5. Physical&nbsp;Mapping:&nbsp;STSs <br />6. Evolutionary&nbsp;Computation&nbsp;applied&nbsp;to&nbsp;Genomic&nbsp;and&nbsp;Proteomic <br />7. Predicate&nbsp;Logic&nbsp;and&nbsp;Protein&nbsp;Structure</p><p>Web&nbsp;site&nbsp;and&nbsp;links:</p><p>http://www.ensat.ac.ma/udiab http://www.pasteur.fr/pasteur/international/annonce_coursBioinfoannonce06_casa.pdf</p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/43008/list-of-useful-machine-ai-learning-resources</guid>
	<pubDate>Tue, 30 Mar 2021 08:56:06 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/43008/list-of-useful-machine-ai-learning-resources</link>
	<title><![CDATA[List of useful machine / ai learning resources !]]></title>
	<description><![CDATA[<p>ML&nbsp;cheatsheet !</p><p>https://github.com/remicnrd/ml_cheatsheet</p><p>Visual AI / ML</p><p>https://setosa.io/ev/</p><p>Simple and efficient tools for predictive data analysis</p><p><span>https://scikit-learn.org/stable/</span></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43587/fix-rewritable-error-of-elgg</guid>
	<pubDate>Mon, 15 Nov 2021 06:23:46 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43587/fix-rewritable-error-of-elgg</link>
	<title><![CDATA[Fix rewritable error of ELGG !]]></title>
	<description><![CDATA[<p>The&nbsp;<code><a href="https://httpd.apache.org/docs/2.4/mod/mod_rewrite.html">mod_rewrite</a></code>&nbsp;module uses a rule-based rewriting engine, based on a PCRE regular-expression parser, to rewrite requested URLs on the fly. By default,&nbsp;<code><a href="https://httpd.apache.org/docs/2.4/mod/mod_rewrite.html">mod_rewrite</a></code>&nbsp;maps a URL to a filesystem path. However, it can also be used to redirect one URL to another URL, or to invoke an internal proxy fetch.</p>
<p><code><a href="https://httpd.apache.org/docs/2.4/mod/mod_rewrite.html">mod_rewrite</a></code>&nbsp;provides a flexible and powerful way to manipulate URLs using an unlimited number of rules. Each rule can have an unlimited number of attached rule conditions, to allow you to rewrite URL based on server variables, environment variables, HTTP headers, or time stamps.</p>
<p><code><a href="https://httpd.apache.org/docs/2.4/mod/mod_rewrite.html">mod_rewrite</a></code>&nbsp;operates on the full URL path, including the path-info section. A rewrite rule can be invoked in&nbsp;<code>httpd.conf</code>&nbsp;or in&nbsp;<code>.htaccess</code>. The path generated by a rewrite rule can include a query string, or can lead to internal sub-processing, external request redirection, or internal proxy throughput.</p>
<p>Further details, discussion, and examples, are provided in the&nbsp;<a href="https://httpd.apache.org/docs/2.4/rewrite/">detailed mod_rewrite documentation</a>.</p>
<p>&nbsp;</p>
<ul>
<li>sudo a2enmod rewrite</li>
</ul>
<ul>
<li>sudo systemctl restart apache2</li>
</ul>
<ul>
<li>sudo nano /etc/apache2/sites-available/000-default.conf</li>
</ul>
<p>Write this</p>
<div title="/etc/apache2/sites-available/000-default.conf">/etc/apache2/sites-available/000-default.conf</div>
<div>
<div>
<pre><code><span>&lt;</span>VirtualHost *:8<span><span>0</span>&gt;</span>
    <span></span><span><span>&lt;</span>Directory /var/www/html<span>&gt;</span></span><span></span>
        <span>Options Indexes FollowSymLinks MultiViews</span>
        <span>AllowOverride All</span>
        <span>Require all granted</span>
    <span></span><span><span>&lt;</span>/Directory<span>&gt;</span></span><span></span>

    <span>.</span> <span>.</span> <span>.</span>
<span>&lt;</span>/VirtualHost<span>&gt;</span></code></pre>
</div>
</div><p>Address of the bookmark: <a href="https://www.digitalocean.com/community/tutorials/how-to-rewrite-urls-with-mod_rewrite-for-apache-on-ubuntu-18-04" rel="nofollow">https://www.digitalocean.com/community/tutorials/how-to-rewrite-urls-with-mod_rewrite-for-apache-on-ubuntu-18-04</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44403/programming-for-lovers</guid>
	<pubDate>Tue, 07 Nov 2023 23:56:30 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44403/programming-for-lovers</link>
	<title><![CDATA[Programming for Lovers !]]></title>
	<description><![CDATA[<p>Programming for Lovers (P4❤️) is a free online course that teaches programming using the Go programming language by immersing learners in fun scientific applications.</p>
<p>Each chapter focuses on a single scientific problem and contains a core text accompanied by code alongs and autograded exercises.</p>
<p>You can meet Phillip Compeau in our intro video. Phillip has taught programming at Carnegie Mellon University for years and is a serial online education founder. He is thrilled to bring you this course.</p><p>Address of the bookmark: <a href="https://programmingforlovers.com/" rel="nofollow">https://programmingforlovers.com/</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>

</channel>
</rss>