Hi - What is the best way to test for symbol equality in biojava.
for example one would expect that N is not equivalent to A, however in some cases it would be nice to tolerate the fact that sometimes N can be A and that A is a member of N. So what is the best way to do a strict equality test ie is subsequence x equal to acggttg and what is the best way to do an ambiguous equality test, ie is subsequence x a member of yynggws thanks - Mark Schreiber Bioinformatics AgResearch Invermay PO Box 50034 Mosgiel New Zealand PH: +64 3 489 9175 ======================================================================= Attention: The information contained in this message and/or attachments from AgResearch Limited is intended only for the persons or entities to which it is addressed and may contain confidential and/or privileged material. Any review, retransmission, dissemination or other use of, or taking of any action in reliance upon, this information by persons or entities other than the intended recipients is prohibited by AgResearch Limited. If you have received this message in error, please notify the sender immediately. ======================================================================= _______________________________________________ Biojava-l mailing list - [EMAIL PROTECTED] http://biojava.org/mailman/listinfo/biojava-l
