The open source
DNA / Protein Sequence Alignment
What does the sample do?
This sample searches, in a database of DNA or protein sequences, a sequence that is as close as possible to an input sequence. The comparisons are performed through sequence alignment and result in a comparison score. The sequence with the highest score is given as the result. In this sample, the database search is performed in parallel, meaning that multiple sequence alignments are occurring concurrently.
How do I run it?Before running this sample application, you must have a JPPF server and at least one node running.
For information on how to set up a node and server, please refer to the JPPF documentation.
Once you have a server and node, you can either run the "run.bat" script (on Windows), "./run.sh" script (on Linux/Unix) or, from a command prompt, type: "ant run".
How do I use it?
The GUI is separated in two main parts, top and bottom.
The "Compute" button submits the sequence database search for processing by JPPF.
The "Reset defaults" button restores the target sequence, database location and substitution matrix to their original values
The database search relies on 3 parameters:
How can I build the sample?To compile the source code, from a command prompt, type: "ant compile"
To generate the Javadoc, from a command prompt, type: "ant javadoc"
I have additional questions and comments, where can I go?
If you need more insight into the code of this demo, you can consult the source, or have a look at the API documentation.
In addition, There are 2 privileged places you can go to:
|Copyright © 2005-2016 JPPF.org||Tweet|