| Name |
SEQMATCHALLP |
 |
| Status |
The current release has 0
entries and was indexed 19-Sep-2004.
|
| Creation date |
1999 - written.
|
| Description |
SEQMATCHALL application details page
Does an all-against-all comparison of a set of sequences
This takes a set of sequences and does an all-against-all pairwisecomparison of words (fragments of the sequences of a specified fixedsize) in the sequences, finding regions of identity between any twosequences. The larger the specified word size, the faster the comparison willproceed. Regions whose stretches of identity are shorter than the wordsize will be missed. You should therefore choose a word size that issmall enough to find those regions of similarity you are interested inwithin a reasonable time-frame.
|
| Literature |
None.
|
| WWW |
www.hgmp.mrc.ac.uk/Software/EMBOSS/Apps/seqmatchall.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 |
|
MATCHERP
| Finds the best local alignments between two sequences
| |
POLYDOTP
| Displays all-against-all dotplots of a set of sequences
| |
SUPERMATCHERP
| Finds a match of a large sequence against one or more sequences
| |
WATERP
| Smith-Waterman local alignment.
| |
WORDMATCHP
| 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
|