In article <366rpk$e1d at mserv1.dl.ac.uk>, Paul Britton <paul.britton at afrc.ac.uk> (Tel \(44\) \(0\)635 578411) writes:
> Hi
>> Does anybody know of a program for sorting restriction digests into suitable
> patterns. I have access to programs that requires the sequences to be known but
> I am specifically interested in deriving a restriction map when only the
> lengths are known for both single and multiple digests. The program must be
> compatible for a PC either under DOS or preferably under windows.
>> Thanks in advance
Yes, I have written and distribute a program RESOLVE which constructs all
restriction maps from double digest data and then uses a 3-enzyme consensus
analysis to build the maps in a *definitive* file. You can then edit, optimise,
align, etc the maps and analyse them for phylogenetically informative sites etc
and output files appropriately formatted for your favorite phylogenetic
analysis package (HENNIG86, PHYLIP, PAUP, NJ etc). Its mainly designed for
mitDNA work but will work on linear sequences as well.
Let me know (use harley at chempath.uct.ac.za) if ypu want it and its .DOC file.
and I'll send it down the wire.
> Paul
> *******************************************************************************
> * Paul Britton | Tel : (44) 635 577268 *
> * Division of Molecular Biology | Fax : (44) 635 577263 *
> * Institute for Animal Health | Janet : Paul.Britton at bbsrc.ac.uk *
> * Compton Laboratory | X.400 : G=Paul; S=Britton; O=BBSRC; *
> * Compton | P=uk.ac; C=GB *
> * Newbury, Berkshire | *
> * RG16 0NN, UK | *
> * | *
> * // \\ // \\ // \\ // \\ // \\ // \\ // \\ *
> * | \\ // | :,\\': | \\ // | :,\\': | \\ // | :,\\': | \\ *
> * | | \\ // | | // \\ | | \\ // | | // \\ | | \\ // | | // \\ | | *
> * \\ | :,\\': | // \\ | :,\\': | // \\ | :,\\': | // \\ | *
> * \\ // \\ // \\ // \\ // \\ // \\ // \\ *
> *******************************************************************************
