<?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/38702?offset=20</link>
	<atom:link href="https://bioinformaticsonline.com/related/38702?offset=20" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/videolist/watch/2759/dynamic-programming-alignment</guid>
	<pubDate>Thu, 22 Aug 2013 09:38:28 -0500</pubDate>
	<link>https://bioinformaticsonline.com/videolist/watch/2759/dynamic-programming-alignment</link>
	<title><![CDATA[Dynamic Programming Alignment]]></title>
	<description><![CDATA[<iframe width="" height="" src="https://www.youtube-nocookie.com/embed/EWJnDMKBEv0" frameborder="0" allowfullscreen></iframe>lecture 9, Chem. C100, Spring 2013, UCLA]]></description>
	
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/5210/sandelin-group</guid>
  <pubDate>Mon, 30 Sep 2013 19:12:58 -0500</pubDate>
  <link></link>
  <title><![CDATA[Sandelin group]]></title>
  <description><![CDATA[
<p>Sandelin group have a deep interest in most biology, but focus on gene regulation and the many areas that are connected with this, including transcriptomics, epigenetics and technological and informatics aspects.</p>

<p>The group is both computational and experimental.</p>

<p>We ask biological questions to large datasets made using novel genomics techniques, with the help of computers. One of the strengths in the group are the many connections to high-profile experimental laboratories which supply data to be analyzed.</p>

<p>Lab webpage @ http://people.binf.ku.dk/albin/Sandelin_group_at_the_Bioinformatic_Centre/The_Sandelin_group.html</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/8385/peng-lab</guid>
  <pubDate>Tue, 18 Feb 2014 13:53:46 -0600</pubDate>
  <link></link>
  <title><![CDATA[Peng Lab]]></title>
  <description><![CDATA[
<p>Peng Lab at Janelia Farm Research Campus, Howard Hughes Medical Institute focuses on data mining for bioinformatics and computational molecular biology, particularly, bioimage data mining and informatics. These bioimages include cellular and molecular images and related medical images. </p>

<p>* Analysis of Gene Expression Pattern Images: high-performance image analysis and mining for different model organisms, such as fruitfly, C. elegans, and mouse;<br />* Feature/Model Learning: developing algorithms and software</p>

<p>Location :Janelia Farm Research Campus, Howard Hughes Medical Institute, Ashburn, Virginia, USA.</p>

<p>http://research.janelia.org/peng/</p>
]]></description>
</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/17885/international-conference-on-bioinformatics-models-methods-and-algorithms</guid>
	<pubDate>Sun, 05 Oct 2014 11:42:52 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/17885/international-conference-on-bioinformatics-models-methods-and-algorithms</link>
	<title><![CDATA[International Conference on Bioinformatics Models, Methods and Algorithms]]></title>
	<description><![CDATA[<p><span>The purpose of the International Conference on Bioinformatics Models, Methods and Algorithms is to bring together researchers and practitioners interested in the application of computational systems and information technologies to the field of molecular biology, including for example the use of statistics and algorithms to understanding biological processes and systems, with a focus on new developments in genome bioinformatics and computational biology. Areas of interest for this community include sequence analysis, biostatistics, image analysis, scientific data management and data mining, machine learning, pattern recognition, computational evolutionary biology, computational genomics and other related fields.</span></p>
<p><span><span>Position Paper Submission Extension:</span><span>&nbsp;</span><span>October 9, 2014</span><span>&nbsp;</span><br><span>Regular Paper Authors Notification:</span><span>&nbsp;</span><span>November 3, 2014</span><span>&nbsp;</span><br><span>Position Paper Authors Notification:</span><span>&nbsp;</span><span>November 6, 2014</span><span>&nbsp;</span><br><span>Regular and Position Paper Camera Ready and Registration:</span><span>&nbsp;</span><span>November 17, 2014</span><span>&nbsp;</span></span></p><p>Address of the bookmark: <a href="http://www.bioinformatics.biostec.org/" rel="nofollow">http://www.bioinformatics.biostec.org/</a></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35800/scikit-bio%E2%84%A2-is-an-open-source-bsd-licensed-python-package-providing-data-structures-algorithms-and-educational-resources-for-bioinformatics</guid>
	<pubDate>Fri, 02 Mar 2018 04:29:47 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35800/scikit-bio%E2%84%A2-is-an-open-source-bsd-licensed-python-package-providing-data-structures-algorithms-and-educational-resources-for-bioinformatics</link>
	<title><![CDATA[scikit-bio™ is an open-source, BSD-licensed, python package providing data structures, algorithms, and educational resources for bioinformatics.]]></title>
	<description><![CDATA[<p><span>scikit-bio is currently in beta. We are very actively developing it, and&nbsp;</span><strong>backward-incompatible interface changes can and will arise</strong><span>. To avoid these types of changes being a surprise to our users, our public APIs are decorated to make it clear to users when an API can be relied upon (stable) and when it may be subject to change (experimental). See the&nbsp;</span><a href="https://github.com/biocore/scikit-bio/blob/master/doc/source/user/api_stability.rst">API stability docs</a><span>&nbsp;for more details, including what we mean by&nbsp;</span><em>stable</em><span>&nbsp;and&nbsp;</span><em>experimental</em><span>&nbsp;in this context.</span></p><p>Address of the bookmark: <a href="http://scikit-bio.org/" rel="nofollow">http://scikit-bio.org/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/33586/genetic-mapper-svg-genetic-map-drawer</guid>
	<pubDate>Sun, 18 Jun 2017 14:11:10 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/33586/genetic-mapper-svg-genetic-map-drawer</link>
	<title><![CDATA[Genetic-mapper: SVG Genetic Map Drawer]]></title>
	<description><![CDATA[<p><span>Genetic-mapper is a perl script able to draw publication-ready vectorial genetic maps.</span></p>
<p>Perl script for creating a publication-ready vectorial genetic/linkage map in Scalable Vector Graphics (SVG) format. The resulting file can either be submitted for publication and edited with any vectorial drawing software like&nbsp;<a href="https://inkscape.org/">Inkscape</a>&nbsp;and&nbsp;<a href="http://www.adobe.com/uk/products/illustrator.html">Abobe Illustrator(R)</a>.</p>
<p>The input file must be a text file with at least the marker name (ID), linkage group (LG) and the position (POS) separeted by tabulations. Additionally a logarithm of odds (LOD score) can be provided. Any extra parameter will be ignored.</p>
<pre><code>map.tsv

ID&lt;tab&gt;LG&lt;tab&gt;POS&lt;tab&gt;LOD
13519  12     0       0.250840894
2718   12     1.0     0.250840893
11040  12     1.6     0.252843341
...</code></pre>
<p>https://github.com/pseudogene/genetic-mapper</p><p>Address of the bookmark: <a href="https://github.com/pseudogene/genetic-mapper" rel="nofollow">https://github.com/pseudogene/genetic-mapper</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/44773/genetic-basis-of-tail-loss-evolution</guid>
	<pubDate>Tue, 04 Mar 2025 12:12:36 -0600</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/44773/genetic-basis-of-tail-loss-evolution</link>
	<title><![CDATA[Genetic basis of tail-loss evolution]]></title>
	<description><![CDATA[<p>The paper <em>"On the genetic basis of tail-loss evolution in humans and apes (https://www.nature.com/articles/s41586-024-07095-8)"</em>, published in <em>Nature</em>, investigates the genetic mechanisms that led to the loss of tails in humans and apes. The study suggests that a specific genetic mutation, involving the insertion of an <em>Alu</em> element (a type of transposable DNA sequence), played a critical role in the evolutionary transition from tailed primates to tailless hominoids.</p><h3><strong>Key Findings of the Study:</strong></h3><ol>
<li>
<p><strong>Alu Insertion and Tail Loss:</strong><br /> The researchers discovered an <em>Alu</em>-mediated genetic change in a common ancestor of modern apes and humans. This change disrupted the normal function of a gene involved in tail development, leading to the suppression of tail formation.</p>
</li>
<li>
<p><strong>Gene Disruption Mechanism:</strong><br /> The <em>Alu</em> insertion was found within a regulatory region of the <em>TBXT</em> gene (also known as <em>T</em> or <em>Brachyury</em>), which is crucial for tail development in vertebrates. This insertion likely altered the gene's expression patterns, leading to tail reduction over evolutionary time.</p>
</li>
<li>
<p><strong>Functional Evidence from Model Organisms:</strong><br /> To test their hypothesis, the researchers introduced similar genetic modifications in mice. The modified mice exhibited shortened or absent tails, supporting the idea that the identified mutation played a role in tail loss in hominoids.</p>
</li>
<li>
<p><strong>Evolutionary Implications:</strong><br /> The findings suggest that small, random genomic changes&mdash;such as transposable element insertions&mdash;can have profound effects on body morphology. This study provides evidence that mobile DNA elements (like <em>Alu</em>) can drive major evolutionary transitions.</p>
</li>
<li>
<p><strong>Relevance to Human Evolution:</strong><br /> Understanding the genetic basis of tail loss helps in reconstructing the evolutionary history of hominins (the lineage that includes humans and our extinct relatives). It also sheds light on how genetic variations contribute to anatomical diversity among primates.</p>
</li>
</ol><h3><strong>Significance of the Study:</strong></h3><p>This research highlights the role of transposable elements in shaping evolutionary traits and provides a concrete genetic explanation for a defining characteristic of humans and great apes. It also demonstrates how mutations in regulatory regions of developmental genes can lead to significant anatomical changes.</p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41125/chromonomer-a-tool-set-for-repairing-and-enhancing-assembled-genomes-through-integration-of-genetic-maps-and-conserved-synteny</guid>
	<pubDate>Mon, 17 Feb 2020 05:38:46 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41125/chromonomer-a-tool-set-for-repairing-and-enhancing-assembled-genomes-through-integration-of-genetic-maps-and-conserved-synteny</link>
	<title><![CDATA[Chromonomer: a tool set for repairing and enhancing assembled genomes through integration of genetic maps and conserved synteny]]></title>
	<description><![CDATA[<p>Chromonomer is a program designed to integrate a genome assembly with a genetic map. Chromonomer tries very hard to identify and remove markers that are out of order in the genetic map, when considered against their local assembly order; and to identify scaffolds that have been incorrectly assembled according to the genetic map, and split those scaffolds.</p><p>Address of the bookmark: <a href="http://catchenlab.life.illinois.edu/chromonomer/" rel="nofollow">http://catchenlab.life.illinois.edu/chromonomer/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/4098/bioinformatics-algorithm-demonstrations-and-tutorials</guid>
	<pubDate>Thu, 29 Aug 2013 09:23:51 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/4098/bioinformatics-algorithm-demonstrations-and-tutorials</link>
	<title><![CDATA[Bioinformatics Algorithm Demonstrations and Tutorials]]></title>
	<description><![CDATA[<p>Abstract</p>
<p>This project presents demonstrations of selected computer science algorithms important in&nbsp;bioinformatics, implemented in the spreadsheet program Microsoft Excel. Spreadsheets provide an&nbsp;interesting platform for demonstration of algorithms, since various steps of the calculations can be&nbsp;exposed in a manner that is easily comprehensible to users with little programming experience. The&nbsp;algorithms demonstrated include two approaches to approximate string matching (dynamic programming&nbsp;and Shift-AND numeric approximate matching), Hierarchical Clustering (used in phylogenetic studies&nbsp;and microarray analysis of gene expression), a Naive Bayes Classifier for simulated microarray gene&nbsp;expression data, and a simple Neural Network. These demonstrations are designed to serve as&nbsp;instructional aids in bioinformatics courses.</p>
<p>Tutorial @&nbsp;http://www.cybertory.org/downloads/bae/BioinformaticsAlgorithmsInExcel.zip</p>
<p>One of the best resource for online bioinformatics learning is https://stepic.org/Bioinformatics-Algorithms-2 Enjoy the online learning.</p>
<p>Reference :&nbsp;cybertory</p>
<blockquote>
<p><span>" Please add your favourite bioinformatics algorithms and tutorial links below in the comment section, for the benefit of bioinformatics and computational biology community ".&nbsp;</span></p>
</blockquote><p>Address of the bookmark: <a href="http://www.cybertory.org/downloads/bae/BioinformaticsAlgorithmsExcelDoc.pdf" rel="nofollow">http://www.cybertory.org/downloads/bae/BioinformaticsAlgorithmsExcelDoc.pdf</a></p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>

</channel>
</rss>