University of Catania & New York University

Home
GraphGrep
Closest Match
Anticlustal
Netmatch
Back Translation
Register
Downloads
Contacts

AntiClustal: Fast, Scalable Multiple Sequence Alignment

 

DNA Sequence

These pages present a new algorithm for multiple sequence alignment of DNA or proteins. The algorithm produces biologically meaningful multiple sequence alignments of divergent sequences. It calculates the best approximate match for the selected sequences, and lines them up so that the identities, similarities and differences can be seen. We believe it improves on the Clustal algorithm in both computation time and accuracy. In the following forms you will see  how to upload a file containing the sequences or paste a sequence or test an existing file stored on the server. If you want upload a file you must browse to find the file and click on the start button. If you want to paste a sequence or test an existing file on the server you simply click on the start button. If you want the output of the alignment and/or the philogenetic tree by email, you must enter a valid email address in the textarea. If the email address is valid, the algorithm will be executed and the results are sent.The existence of email address will not testing.

          Select Input Type

If you want to upload a sequence from a file, browse the file and upload it by clicking on the start button. If you want to paste a sequence or test an archived file on the server, click on the start button.

Select File to Upload:
 

For problems, doubts, and more info about parameters and options, you may consult help on line or contact us.

 
 

Top    Help

 
Developed at University of Catania. Copyright © 2002 - 2004 - Web Master: Giuseppe Pigola