| Index | Recent Threads | Unanswered Threads | Who's Active | Guidelines | Search |
 |
World Community Grid Forums
Category: Completed Research
Forum: Genome Comparison
Thread: faster way in finding genomes |
| No member browsing this thread |
|
Thread Status: Active Total posts in this thread: 2
|
|
| Author |
|
|
Former Member
Cruncher Joined: May 22, 2018 Post Count: 0 Status: Offline |
Hi all,
I stumbled on the internet and I found this: https://sourceforge.net/projects/burstsort It's a new algorithm for sorting data. I don't know if it will help with the genome comparison project because the source code is not free and I couldn't find how the project searches through all these genes. It's probably not worthwhile to implement it in this release of genome comparison because it will be done in a few months but I thought it is worthwhile mentioning. |
||
|
|
Former Member
Cruncher Joined: May 22, 2018 Post Count: 0 Status: Offline |
The Genome Comparison project uses SSEARCH, which uses William Pearson's implementation of Smith and Waterman's search algorithm.
|
||
|
|
|