| Primer Match |
 |
 |
Introduction
The Primer Match suite of tools is designed to find and count exact
and near exact matches of short oligonucleotide sequences in large
genomic databases. All matches to the oligos will be output, the tools
guarantee a complete enumeration of all matches consistent with the
search options. Substitutions, insertions and deletions can be
prohibited in the start, end, 5' or 3' bases of oligos. Many options
for constraining acceptable alignments and input/output formats are
provided. The tools automatically optimize the sequence search
strategies to match the search parameters.
Installation
- Pull down the source from the central CVS repository at
bioinformatics.org
cvs -d:pserver:anonymous@bioinformatics.org:/cvsroot login
<Enter>
cvs -d:pserver:anonymous@bioinformatics.org:/cvsroot checkout PrimerMatch
- Type make!
There are a number of OS's, architectures and
compilers supported out of the box, namely OSF (Alpha/Compaq) with cxx
and g++, AIX (IBM) with xlC, Cygwin/MinGW (WinTel) with g++, and Linux
with g++. If your environment is not shown, don't despair, between the
Makefile variables and the defines in types.h it should be possible to
compile primer_match in your environment.
Programs
- primer_match
-
primer_match finds and counts exact and
near exact instances of short DNA sequences, usually primers, in a
(much) larger DNA sequence database such as the human genome.
- pcr_match
-
pcr_match finds pairs of short DNA
sequences, usually primers, in a (much) larger DNA sequence database
such as the human genome.
- compress_seq
-
compress_seq reformats multi-FASTA
sequence databases for efficient searching by primer_match and
pcr_match.
Examples
|