<?xml version="1.0" encoding="utf-8"?>
<rss version="2.0" xml:base="http://www.nodalpoint.org" xmlns:dc="http://purl.org/dc/elements/1.1/">
<channel>
 <title>nodalpoint.org - Algorithms, algorithms everywhere... - Comments</title>
 <link>http://www.nodalpoint.org/2006/04/15/algorithms_algorithms_everywhere_0</link>
 <description>Comments for &quot;Algorithms, algorithms everywhere...&quot;</description>
 <language>en</language>
<item>
 <title>phylogeny programs</title>
 <link>http://www.nodalpoint.org/2006/04/15/algorithms_algorithms_everywhere_0#comment-3165</link>
 <description>&lt;p&gt;I should have added joe felsentein&#039;s list of phylogeny programs to that post. quote: &lt;a href=&quot;http://evolution.genetics.washington.edu/phylip/software.html&quot;&gt;&quot;Here are 267 of the phylogeny packages, and 32 free servers, that I know about.&quot;&lt;/a&gt; I admit that my example motif discovery is nothing against old disciplines like that...&lt;/p&gt;
&lt;br class=&quot;clear&quot; /&gt;</description>
 <pubDate>Wed, 11 Oct 2006 11:53:13 -0400</pubDate>
 <dc:creator>maximilianh</dc:creator>
 <guid isPermaLink="false">comment 3165 at http://www.nodalpoint.org</guid>
</item>
<item>
 <title>Another method paper</title>
 <link>http://www.nodalpoint.org/2006/04/15/algorithms_algorithms_everywhere_0#comment-3089</link>
 <description>&lt;p&gt;Hey hey, look at this, I&#039;ve found a really cool methods paper: &lt;a href=&quot;http://www.bioinfo.de/isb/2006/06/0024/&quot;&gt;Piva et al 2006&lt;/a&gt; They are describing a tool that (tataaa!) generates random sequences!!! Really! Generated with the Delphi function that generates random numbers. Impressive, isn&#039;t it!&lt;/p&gt;
&lt;br class=&quot;clear&quot; /&gt;</description>
 <pubDate>Tue, 27 Jun 2006 07:48:56 -0400</pubDate>
 <dc:creator>maximilianh</dc:creator>
 <guid isPermaLink="false">comment 3089 at http://www.nodalpoint.org</guid>
</item>
<item>
 <title>Wu &amp; Manber</title>
 <link>http://www.nodalpoint.org/2006/04/15/algorithms_algorithms_everywhere_0#comment-2988</link>
 <description>&lt;p&gt;We used Wu &amp;amp; Manber&#039;s algorithm [1], famously used in agrep, to recover a set of known subsequences from a longer sequence.  For a set of 4 (one each taken from 4 pools of ~150 candidates, each of ~20bp length), we can recover the 4 members in each of 10,000 sequences in about 2 minutes on a standard desktop PC.  The algorithm also matches with a specified error count - which can be handy if the sequencer is playing up!&lt;/p&gt;
&lt;p&gt;[1] S. Wu and U. Manber, ``Fast Text Searching Allowing Errors,&quot; Communications of the ACM 35 (October 1992), pp. 83-91.&lt;/p&gt;
&lt;br class=&quot;clear&quot; /&gt;</description>
 <pubDate>Wed, 03 May 2006 11:56:39 -0400</pubDate>
 <dc:creator>daen</dc:creator>
 <guid isPermaLink="false">comment 2988 at http://www.nodalpoint.org</guid>
</item>
<item>
 <title>New additions</title>
 <link>http://www.nodalpoint.org/2006/04/15/algorithms_algorithms_everywhere_0#comment-2987</link>
 <description>&lt;p&gt;Waiting to see what new stuff they add to the suite. I am waiting to see things on systems biology and networks.&lt;/p&gt;
&lt;br class=&quot;clear&quot; /&gt;</description>
 <pubDate>Sat, 29 Apr 2006 16:09:25 -0400</pubDate>
 <dc:creator>Animesh</dc:creator>
 <guid isPermaLink="false">comment 2987 at http://www.nodalpoint.org</guid>
</item>
<item>
 <title>good emboss news</title>
 <link>http://www.nodalpoint.org/2006/04/15/algorithms_algorithms_everywhere_0#comment-2986</link>
 <description>&lt;p&gt;Pleased to hear it.  I&#039;m a big fan of EMBOSS too, especially in combination with BioPerl&#039;s Bio::Factory::EMBOSS.  It seems to have been chugging along OK as a sourceforge project but I&#039;m sure the funding will help a lot.&lt;/p&gt;
&lt;br class=&quot;clear&quot; /&gt;</description>
 <pubDate>Fri, 28 Apr 2006 07:03:59 -0400</pubDate>
 <dc:creator>Neil</dc:creator>
 <guid isPermaLink="false">comment 2986 at http://www.nodalpoint.org</guid>
</item>
<item>
 <title>Recursive bioinformatics</title>
 <link>http://www.nodalpoint.org/2006/04/15/algorithms_algorithms_everywhere_0#comment-2985</link>
 <description>&lt;p&gt;How can I trust that tree without a tree of methods for building trees?&lt;/p&gt;
&lt;br class=&quot;clear&quot; /&gt;</description>
 <pubDate>Fri, 28 Apr 2006 02:52:52 -0400</pubDate>
 <dc:creator>Martin Jambon</dc:creator>
 <guid isPermaLink="false">comment 2985 at http://www.nodalpoint.org</guid>
</item>
<item>
 <title>EMBOSS lives again</title>
 <link>http://www.nodalpoint.org/2006/04/15/algorithms_algorithms_everywhere_0#comment-2984</link>
 <description>&lt;p&gt;Guys the best known open source bioinformatics suite EMBOSS [ &lt;a href=&quot;http://emboss.sourceforge.net/&quot; title=&quot;http://emboss.sourceforge.net/&quot;&gt;http://emboss.sourceforge.net/&lt;/a&gt; ] get a new life. &quot;The funding from the BBSRC means that EMBOSS co-founders Peter Rice and Alan Bleasby will be able to continue the EMBOSS project at the EMBL -EBI for the next three years.&quot; [ &lt;a href=&quot;http://www.genomicsproteomics.com/index.aspx?ID=71972&quot; title=&quot;http://www.genomicsproteomics.com/index.aspx?ID=71972&quot;&gt;http://www.genomicsproteomics.com/index.aspx?ID=71972&lt;/a&gt; ].&lt;br /&gt;
EMBOSS has almost all the well known bioinformatics algorithms in separate programs as well as API&#039;s.&lt;br /&gt;
I just love this program and I am very happy to hear this news.&lt;br /&gt;
Ani&lt;/p&gt;
&lt;p&gt;______________________&quot;The Answer Lies in Genome&quot;______________________&lt;br /&gt;
&lt;a href=&quot;http://fuzzylife.org/animesh/&quot; title=&quot;http://fuzzylife.org/animesh/&quot;&gt;http://fuzzylife.org/animesh/&lt;/a&gt;&lt;/p&gt;
&lt;br class=&quot;clear&quot; /&gt;</description>
 <pubDate>Fri, 28 Apr 2006 02:45:38 -0400</pubDate>
 <dc:creator>Animesh</dc:creator>
 <guid isPermaLink="false">comment 2984 at http://www.nodalpoint.org</guid>
</item>
<item>
 <title>Tree of methods?</title>
 <link>http://www.nodalpoint.org/2006/04/15/algorithms_algorithms_everywhere_0#comment-2978</link>
 <description>&lt;p&gt;A tree of alignment algorithms.  Now I&#039;ve seen everything.&lt;/p&gt;
&lt;p&gt;One of my pet hates in bioinformatics is excessive method development.  I appreciate new tools, algorithm development and so on, but there are far too many papers reporting tiny incremental improvements in pre-existing methods.  People coming in from compsci need to remember what biologists want.  They want a tool that they can understand, have some idea of its pros, cons, accuracy and apply to biological data.  &quot;I want action - not theory!&quot; as a sample proclaims on a &quot;Man...or Astroman?&quot; record.&lt;/p&gt;
&lt;br class=&quot;clear&quot; /&gt;</description>
 <pubDate>Mon, 24 Apr 2006 07:51:23 -0400</pubDate>
 <dc:creator>Neil</dc:creator>
 <guid isPermaLink="false">comment 2978 at http://www.nodalpoint.org</guid>
</item>
<item>
 <title>Algorithms, algorithms everywhere...</title>
 <link>http://www.nodalpoint.org/2006/04/15/algorithms_algorithms_everywhere_0</link>
 <description>&lt;p&gt;There are indeed quite a few multiple alignment algorithms. &lt;a href=&quot;http://nar.oxfordjournals.org/cgi/content/full/34/6/1692&quot;&gt;Wallace et al&lt;/a&gt; counted around 50. They started drawing &lt;a href=&quot;http://nar.oxfordjournals.org/content/vol34/issue6/images/large/gkl091f1.jpeg&quot;&gt;trees of alignment algorithms&lt;/a&gt;. &lt;/p&gt;
&lt;p&gt;Has anyone collected a list of all papers that developed a new alignment algorithm (each one, of course, better than a couple of the others)? I personally would bet that - given that the number of algorithms raise with algorithmical simplicity and the interpretability of the results - motif discovery on DNA is one of the disciplines that &lt;a href=&quot;http://www.stud.uni-potsdam.de/~haussler/master/list.php&quot;&gt;generated the most different papers about a new algorithm&lt;/a&gt; (counted around 80). Fortunately, the decision is much simpler as the savvy bio-computerfreak knows: With so much choice, the first program that gently compiles after &quot;make&quot; has a good chance of getting used in the end. Is this the reason why everyone is using BLAST today? Or was that a completely different time?&lt;/p&gt;
&lt;br class=&quot;clear&quot; /&gt;&lt;p&gt;&lt;a href=&quot;http://www.nodalpoint.org/2006/04/15/algorithms_algorithms_everywhere_0&quot;&gt;read more&lt;/a&gt;&lt;/p&gt;</description>
 <comments>http://www.nodalpoint.org/2006/04/15/algorithms_algorithms_everywhere_0#comments</comments>
 <category domain="http://www.nodalpoint.org/master_list/bioinformatics">Bioinformatics</category>
 <category domain="http://www.nodalpoint.org/science/bioinformatics">Bioinformatics</category>
 <category domain="http://www.nodalpoint.org/bioinformatics/sequence_analysis">Sequence analysis</category>
 <pubDate>Sat, 15 Apr 2006 16:23:01 -0400</pubDate>
 <dc:creator>maximilianh</dc:creator>
 <guid isPermaLink="false">1820 at http://www.nodalpoint.org</guid>
</item>
</channel>
</rss>
