| Name |
SUPERMATCHERN |
 |
| Status |
The current release has 0
entries and was indexed 19-Sep-2004.
|
| Creation date |
Finished.
|
| Description |
SUPERMATCHER application details page
Finds a match of a large sequence against one or more sequences
This is a rough and ready local alignment program for large sequences. The reason it is rough and ready is that wordmatch is used to find all the word matches between the first sequence and another sequence. Then by calculating the highest score for a diagonal we can then use this as the centre point for a Smith-Waterman type calculation of a width given by the user. So a narrow diagonal Smith-Waterman is calculated hence the results will be rough but due to the space saving much larger sequences can be aligned.
|
| Literature |
None.
|
| WWW |
www.hgmp.mrc.ac.uk/Software/EMBOSS/Apps/supermatcher.html
|
| Ftp |
The latest version of the EMBOSS package is available on
ftp://ftp.uk.embnet.org/pub/EMBOSS/
|
| Contact |
This application was written by Ian Longden (il@sanger.ac.uk) InformaticsDivision, The Sanger Centre, Wellcome Trust Genome Campus, Hinxton,Cambridge, CB10 1SA, UK.
|
| See also |
|
MATCHERN
| Finds the best local alignments between two sequences
| |
SEQMATCHALLN
| Does an all-against-all comparison of a set of sequences
| |
WATERN
| Smith-Waterman local alignment.
| |
WORDMATCHN
| Finds all exact matches of a given size between 2 sequences
|
|
|
|
| Data-fields in SRS |
|
| Loaders |
|
| SRS Description |
Structure
(
srsgen.i
,
srsdb.i
,
href.i
)
Syntax
Information
|